/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/product-lines/elevator_spec1_product09.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 08:21:48,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 08:21:48,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 08:21:48,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 08:21:48,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 08:21:48,571 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 08:21:48,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 08:21:48,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 08:21:48,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 08:21:48,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 08:21:48,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 08:21:48,603 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 08:21:48,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 08:21:48,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 08:21:48,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 08:21:48,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 08:21:48,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 08:21:48,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 08:21:48,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 08:21:48,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 08:21:48,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 08:21:48,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 08:21:48,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 08:21:48,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 08:21:48,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 08:21:48,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 08:21:48,648 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 08:21:48,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 08:21:48,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 08:21:48,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 08:21:48,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 08:21:48,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 08:21:48,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 08:21:48,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 08:21:48,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 08:21:48,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 08:21:48,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 08:21:48,666 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 08:21:48,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 08:21:48,667 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 08:21:48,668 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 08:21:48,669 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 08:21:48,721 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 08:21:48,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 08:21:48,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 08:21:48,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 08:21:48,726 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 08:21:48,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 08:21:48,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 08:21:48,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 08:21:48,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 08:21:48,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 08:21:48,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 08:21:48,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 08:21:48,728 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 08:21:48,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 08:21:48,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 08:21:48,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 08:21:48,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 08:21:48,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 08:21:48,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 08:21:48,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 08:21:48,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 08:21:48,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 08:21:48,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 08:21:48,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 08:21:48,731 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 08:21:48,731 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 [2020-12-23 08:21:49,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 08:21:49,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 08:21:49,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 08:21:49,134 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 08:21:49,135 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 08:21:49,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec1_product09.cil.c [2020-12-23 08:21:49,217 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b96bbda74/f5543f1e317849c1825352f33f3262df/FLAG0bc18e56c [2020-12-23 08:21:50,036 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 08:21:50,037 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec1_product09.cil.c [2020-12-23 08:21:50,075 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b96bbda74/f5543f1e317849c1825352f33f3262df/FLAG0bc18e56c [2020-12-23 08:21:50,262 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b96bbda74/f5543f1e317849c1825352f33f3262df [2020-12-23 08:21:50,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 08:21:50,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 08:21:50,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 08:21:50,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 08:21:50,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 08:21:50,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 08:21:50" (1/1) ... [2020-12-23 08:21:50,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eb5c426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:21:50, skipping insertion in model container [2020-12-23 08:21:50,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 08:21:50" (1/1) ... [2020-12-23 08:21:50,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 08:21:50,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 08:21:50,547 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/product-lines/elevator_spec1_product09.cil.c[1221,1234] left hand side expression in assignment: lhs: VariableLHS[~excep~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~cf~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_15~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_16~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~1,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~1,] left hand side expression in assignment: lhs: VariableLHS[~excep~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~2,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~new~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_18~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~2,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_20~0,] left hand side expression in assignment: lhs: VariableLHS[~next~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_21~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~3,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~count,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_22~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mem_23~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_24~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~4,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~nd~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~maxLength~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~counter~0,] left hand side expression in assignment: lhs: VariableLHS[~counter~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~action~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~origin~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~floor~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__utac__ad__arg1~0,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~2,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~3,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp18~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp19~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp20~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp24~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp25~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp26~0,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] [2020-12-23 08:21:51,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 08:21:51,117 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 08:21:51,178 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/product-lines/elevator_spec1_product09.cil.c[1221,1234] left hand side expression in assignment: lhs: VariableLHS[~excep~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~cf~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_15~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_16~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~1,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~1,] left hand side expression in assignment: lhs: VariableLHS[~excep~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~2,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~new~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_18~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~2,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_20~0,] left hand side expression in assignment: lhs: VariableLHS[~next~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_21~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~3,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~count,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_22~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mem_23~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_24~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~4,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~nd~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~maxLength~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~counter~0,] left hand side expression in assignment: lhs: VariableLHS[~counter~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~action~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~origin~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~floor~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__utac__ad__arg1~0,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~2,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~3,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp18~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp19~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp20~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp24~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp25~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp26~0,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] [2020-12-23 08:21:51,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 08:21:51,467 INFO L208 MainTranslator]: Completed translation [2020-12-23 08:21:51,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:21:51 WrapperNode [2020-12-23 08:21:51,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 08:21:51,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 08:21:51,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 08:21:51,470 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 08:21:51,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:21:51" (1/1) ... [2020-12-23 08:21:51,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:21:51" (1/1) ... [2020-12-23 08:21:51,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 08:21:51,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 08:21:51,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 08:21:51,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 08:21:51,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:21:51" (1/1) ... [2020-12-23 08:21:51,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:21:51" (1/1) ... [2020-12-23 08:21:51,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:21:51" (1/1) ... [2020-12-23 08:21:51,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:21:51" (1/1) ... [2020-12-23 08:21:51,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:21:51" (1/1) ... [2020-12-23 08:21:51,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:21:51" (1/1) ... [2020-12-23 08:21:51,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:21:51" (1/1) ... [2020-12-23 08:21:51,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 08:21:51,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 08:21:51,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 08:21:51,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 08:21:51,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:21:51" (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 [2020-12-23 08:21:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 08:21:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 08:21:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 08:21:51,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 08:21:57,175 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 08:21:57,175 INFO L299 CfgBuilder]: Removed 493 assume(true) statements. [2020-12-23 08:21:57,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 08:21:57 BoogieIcfgContainer [2020-12-23 08:21:57,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 08:21:57,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 08:21:57,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 08:21:57,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 08:21:57,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 08:21:50" (1/3) ... [2020-12-23 08:21:57,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8cffbfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 08:21:57, skipping insertion in model container [2020-12-23 08:21:57,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:21:51" (2/3) ... [2020-12-23 08:21:57,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8cffbfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 08:21:57, skipping insertion in model container [2020-12-23 08:21:57,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 08:21:57" (3/3) ... [2020-12-23 08:21:57,189 INFO L111 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product09.cil.c [2020-12-23 08:21:57,195 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 08:21:57,202 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-12-23 08:21:57,221 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-23 08:21:57,258 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 08:21:57,259 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 08:21:57,259 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 08:21:57,259 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 08:21:57,259 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 08:21:57,260 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 08:21:57,260 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 08:21:57,260 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 08:21:57,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states. [2020-12-23 08:21:57,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-23 08:21:57,332 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:21:57,333 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] [2020-12-23 08:21:57,334 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:21:57,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:21:57,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1130982941, now seen corresponding path program 1 times [2020-12-23 08:21:57,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:21:57,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945254194] [2020-12-23 08:21:57,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:21:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:21:57,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:21:57,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945254194] [2020-12-23 08:21:57,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:21:57,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:21:57,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299707746] [2020-12-23 08:21:57,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:21:57,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:21:57,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:21:57,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:21:57,798 INFO L87 Difference]: Start difference. First operand 2319 states. Second operand 3 states. [2020-12-23 08:21:58,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:21:58,184 INFO L93 Difference]: Finished difference Result 6877 states and 13043 transitions. [2020-12-23 08:21:58,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:21:58,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-12-23 08:21:58,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:21:58,261 INFO L225 Difference]: With dead ends: 6877 [2020-12-23 08:21:58,262 INFO L226 Difference]: Without dead ends: 4563 [2020-12-23 08:21:58,277 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 [2020-12-23 08:21:58,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4563 states. [2020-12-23 08:21:58,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4563 to 2315. [2020-12-23 08:21:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2315 states. [2020-12-23 08:21:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 4378 transitions. [2020-12-23 08:21:58,470 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 4378 transitions. Word has length 47 [2020-12-23 08:21:58,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:21:58,470 INFO L481 AbstractCegarLoop]: Abstraction has 2315 states and 4378 transitions. [2020-12-23 08:21:58,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:21:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 4378 transitions. [2020-12-23 08:21:58,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-23 08:21:58,475 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:21:58,475 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] [2020-12-23 08:21:58,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 08:21:58,477 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:21:58,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:21:58,478 INFO L82 PathProgramCache]: Analyzing trace with hash 544606887, now seen corresponding path program 1 times [2020-12-23 08:21:58,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:21:58,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992070666] [2020-12-23 08:21:58,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:21:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:21:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:21:58,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992070666] [2020-12-23 08:21:58,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:21:58,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:21:58,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586805778] [2020-12-23 08:21:58,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:21:58,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:21:58,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:21:58,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:21:58,704 INFO L87 Difference]: Start difference. First operand 2315 states and 4378 transitions. Second operand 4 states. [2020-12-23 08:21:59,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:21:59,074 INFO L93 Difference]: Finished difference Result 9014 states and 17067 transitions. [2020-12-23 08:21:59,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:21:59,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-12-23 08:21:59,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:21:59,121 INFO L225 Difference]: With dead ends: 9014 [2020-12-23 08:21:59,122 INFO L226 Difference]: Without dead ends: 6721 [2020-12-23 08:21:59,132 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:21:59,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6721 states. [2020-12-23 08:21:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6721 to 2291. [2020-12-23 08:21:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 08:21:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 4325 transitions. [2020-12-23 08:21:59,250 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 4325 transitions. Word has length 54 [2020-12-23 08:21:59,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:21:59,251 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 4325 transitions. [2020-12-23 08:21:59,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:21:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 4325 transitions. [2020-12-23 08:21:59,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-23 08:21:59,257 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:21:59,257 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] [2020-12-23 08:21:59,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 08:21:59,257 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:21:59,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:21:59,259 INFO L82 PathProgramCache]: Analyzing trace with hash -727744059, now seen corresponding path program 1 times [2020-12-23 08:21:59,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:21:59,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428161714] [2020-12-23 08:21:59,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:21:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:21:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:21:59,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428161714] [2020-12-23 08:21:59,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:21:59,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:21:59,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151112020] [2020-12-23 08:21:59,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:21:59,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:21:59,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:21:59,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:21:59,413 INFO L87 Difference]: Start difference. First operand 2291 states and 4325 transitions. Second operand 4 states. [2020-12-23 08:21:59,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:21:59,838 INFO L93 Difference]: Finished difference Result 6781 states and 12826 transitions. [2020-12-23 08:21:59,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:21:59,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2020-12-23 08:21:59,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:21:59,870 INFO L225 Difference]: With dead ends: 6781 [2020-12-23 08:21:59,871 INFO L226 Difference]: Without dead ends: 4512 [2020-12-23 08:21:59,877 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:21:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2020-12-23 08:21:59,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 2291. [2020-12-23 08:21:59,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 08:22:00,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 4319 transitions. [2020-12-23 08:22:00,006 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 4319 transitions. Word has length 55 [2020-12-23 08:22:00,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:00,013 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 4319 transitions. [2020-12-23 08:22:00,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:22:00,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 4319 transitions. [2020-12-23 08:22:00,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-23 08:22:00,016 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:00,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] [2020-12-23 08:22:00,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 08:22:00,017 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:00,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:00,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1677018580, now seen corresponding path program 1 times [2020-12-23 08:22:00,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:00,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003867881] [2020-12-23 08:22:00,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:00,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:00,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003867881] [2020-12-23 08:22:00,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:00,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:22:00,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689561553] [2020-12-23 08:22:00,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:22:00,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:00,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:22:00,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:22:00,151 INFO L87 Difference]: Start difference. First operand 2291 states and 4319 transitions. Second operand 4 states. [2020-12-23 08:22:00,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:00,536 INFO L93 Difference]: Finished difference Result 6781 states and 12814 transitions. [2020-12-23 08:22:00,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:22:00,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2020-12-23 08:22:00,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:00,565 INFO L225 Difference]: With dead ends: 6781 [2020-12-23 08:22:00,565 INFO L226 Difference]: Without dead ends: 4512 [2020-12-23 08:22:00,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:00,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2020-12-23 08:22:00,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 2291. [2020-12-23 08:22:00,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 08:22:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 4313 transitions. [2020-12-23 08:22:00,698 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 4313 transitions. Word has length 57 [2020-12-23 08:22:00,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:00,700 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 4313 transitions. [2020-12-23 08:22:00,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:22:00,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 4313 transitions. [2020-12-23 08:22:00,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 08:22:00,704 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:00,705 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] [2020-12-23 08:22:00,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 08:22:00,705 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:00,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:00,706 INFO L82 PathProgramCache]: Analyzing trace with hash 654883119, now seen corresponding path program 1 times [2020-12-23 08:22:00,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:00,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432518720] [2020-12-23 08:22:00,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:00,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:00,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432518720] [2020-12-23 08:22:00,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:00,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:22:00,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354025532] [2020-12-23 08:22:00,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:22:00,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:00,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:22:00,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:22:00,831 INFO L87 Difference]: Start difference. First operand 2291 states and 4313 transitions. Second operand 4 states. [2020-12-23 08:22:01,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:01,425 INFO L93 Difference]: Finished difference Result 11205 states and 21180 transitions. [2020-12-23 08:22:01,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:22:01,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-23 08:22:01,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:01,479 INFO L225 Difference]: With dead ends: 11205 [2020-12-23 08:22:01,479 INFO L226 Difference]: Without dead ends: 8936 [2020-12-23 08:22:01,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:01,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8936 states. [2020-12-23 08:22:01,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8936 to 2291. [2020-12-23 08:22:01,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 08:22:01,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 4312 transitions. [2020-12-23 08:22:01,627 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 4312 transitions. Word has length 59 [2020-12-23 08:22:01,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:01,627 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 4312 transitions. [2020-12-23 08:22:01,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:22:01,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 4312 transitions. [2020-12-23 08:22:01,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-23 08:22:01,629 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:01,630 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:22:01,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 08:22:01,631 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:01,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:01,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1117046252, now seen corresponding path program 1 times [2020-12-23 08:22:01,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:01,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538495008] [2020-12-23 08:22:01,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:01,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:01,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538495008] [2020-12-23 08:22:01,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:01,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:22:01,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190161694] [2020-12-23 08:22:01,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:22:01,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:01,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:22:01,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:22:01,734 INFO L87 Difference]: Start difference. First operand 2291 states and 4312 transitions. Second operand 4 states. [2020-12-23 08:22:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:02,079 INFO L93 Difference]: Finished difference Result 6781 states and 12801 transitions. [2020-12-23 08:22:02,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:22:02,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-12-23 08:22:02,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:02,094 INFO L225 Difference]: With dead ends: 6781 [2020-12-23 08:22:02,095 INFO L226 Difference]: Without dead ends: 4512 [2020-12-23 08:22:02,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:02,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2020-12-23 08:22:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 2291. [2020-12-23 08:22:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 08:22:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 4306 transitions. [2020-12-23 08:22:02,255 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 4306 transitions. Word has length 60 [2020-12-23 08:22:02,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:02,255 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 4306 transitions. [2020-12-23 08:22:02,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:22:02,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 4306 transitions. [2020-12-23 08:22:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 08:22:02,258 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:02,258 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] [2020-12-23 08:22:02,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 08:22:02,258 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:02,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:02,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1300648748, now seen corresponding path program 1 times [2020-12-23 08:22:02,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:02,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608140326] [2020-12-23 08:22:02,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:02,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608140326] [2020-12-23 08:22:02,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:02,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:22:02,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934505718] [2020-12-23 08:22:02,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:22:02,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:02,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:22:02,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:22:02,364 INFO L87 Difference]: Start difference. First operand 2291 states and 4306 transitions. Second operand 4 states. [2020-12-23 08:22:02,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:02,670 INFO L93 Difference]: Finished difference Result 6781 states and 12789 transitions. [2020-12-23 08:22:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:22:02,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-23 08:22:02,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:02,685 INFO L225 Difference]: With dead ends: 6781 [2020-12-23 08:22:02,685 INFO L226 Difference]: Without dead ends: 4512 [2020-12-23 08:22:02,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2020-12-23 08:22:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 2291. [2020-12-23 08:22:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 08:22:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 4300 transitions. [2020-12-23 08:22:02,807 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 4300 transitions. Word has length 61 [2020-12-23 08:22:02,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:02,808 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 4300 transitions. [2020-12-23 08:22:02,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:22:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 4300 transitions. [2020-12-23 08:22:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 08:22:02,810 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:02,810 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] [2020-12-23 08:22:02,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 08:22:02,811 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:02,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:02,811 INFO L82 PathProgramCache]: Analyzing trace with hash 509241625, now seen corresponding path program 1 times [2020-12-23 08:22:02,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:02,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753829502] [2020-12-23 08:22:02,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:02,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:02,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753829502] [2020-12-23 08:22:02,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:02,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:22:02,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023517154] [2020-12-23 08:22:02,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:22:02,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:02,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:22:02,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:22:02,881 INFO L87 Difference]: Start difference. First operand 2291 states and 4300 transitions. Second operand 4 states. [2020-12-23 08:22:03,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:03,297 INFO L93 Difference]: Finished difference Result 8972 states and 16933 transitions. [2020-12-23 08:22:03,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:22:03,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-12-23 08:22:03,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:03,319 INFO L225 Difference]: With dead ends: 8972 [2020-12-23 08:22:03,319 INFO L226 Difference]: Without dead ends: 6709 [2020-12-23 08:22:03,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:03,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6709 states. [2020-12-23 08:22:03,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6709 to 2293. [2020-12-23 08:22:03,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2020-12-23 08:22:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 4301 transitions. [2020-12-23 08:22:03,482 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 4301 transitions. Word has length 62 [2020-12-23 08:22:03,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:03,482 INFO L481 AbstractCegarLoop]: Abstraction has 2293 states and 4301 transitions. [2020-12-23 08:22:03,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:22:03,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 4301 transitions. [2020-12-23 08:22:03,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-23 08:22:03,488 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:03,488 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] [2020-12-23 08:22:03,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 08:22:03,488 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:03,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:03,489 INFO L82 PathProgramCache]: Analyzing trace with hash -329996983, now seen corresponding path program 1 times [2020-12-23 08:22:03,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:03,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399484092] [2020-12-23 08:22:03,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:03,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399484092] [2020-12-23 08:22:03,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:03,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:22:03,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159511198] [2020-12-23 08:22:03,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:22:03,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:03,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:22:03,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:22:03,587 INFO L87 Difference]: Start difference. First operand 2293 states and 4301 transitions. Second operand 4 states. [2020-12-23 08:22:03,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:03,959 INFO L93 Difference]: Finished difference Result 8964 states and 16913 transitions. [2020-12-23 08:22:03,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:22:03,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-12-23 08:22:03,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:03,980 INFO L225 Difference]: With dead ends: 8964 [2020-12-23 08:22:03,980 INFO L226 Difference]: Without dead ends: 6704 [2020-12-23 08:22:03,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:03,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6704 states. [2020-12-23 08:22:04,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6704 to 2298. [2020-12-23 08:22:04,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2298 states. [2020-12-23 08:22:04,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 4309 transitions. [2020-12-23 08:22:04,133 INFO L78 Accepts]: Start accepts. Automaton has 2298 states and 4309 transitions. Word has length 63 [2020-12-23 08:22:04,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:04,137 INFO L481 AbstractCegarLoop]: Abstraction has 2298 states and 4309 transitions. [2020-12-23 08:22:04,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:22:04,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 4309 transitions. [2020-12-23 08:22:04,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-23 08:22:04,146 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:04,147 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] [2020-12-23 08:22:04,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 08:22:04,147 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:04,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:04,148 INFO L82 PathProgramCache]: Analyzing trace with hash -300266866, now seen corresponding path program 1 times [2020-12-23 08:22:04,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:04,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242364911] [2020-12-23 08:22:04,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:04,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242364911] [2020-12-23 08:22:04,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:04,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:22:04,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087788254] [2020-12-23 08:22:04,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:22:04,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:04,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:22:04,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:22:04,216 INFO L87 Difference]: Start difference. First operand 2298 states and 4309 transitions. Second operand 3 states. [2020-12-23 08:22:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:04,338 INFO L93 Difference]: Finished difference Result 4553 states and 8560 transitions. [2020-12-23 08:22:04,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:22:04,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-12-23 08:22:04,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:04,345 INFO L225 Difference]: With dead ends: 4553 [2020-12-23 08:22:04,345 INFO L226 Difference]: Without dead ends: 2292 [2020-12-23 08:22:04,350 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 [2020-12-23 08:22:04,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2020-12-23 08:22:04,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 2292. [2020-12-23 08:22:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2292 states. [2020-12-23 08:22:04,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 4297 transitions. [2020-12-23 08:22:04,455 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 4297 transitions. Word has length 64 [2020-12-23 08:22:04,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:04,455 INFO L481 AbstractCegarLoop]: Abstraction has 2292 states and 4297 transitions. [2020-12-23 08:22:04,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:22:04,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 4297 transitions. [2020-12-23 08:22:04,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 08:22:04,460 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:04,460 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] [2020-12-23 08:22:04,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 08:22:04,460 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:04,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:04,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1687101641, now seen corresponding path program 1 times [2020-12-23 08:22:04,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:04,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667955312] [2020-12-23 08:22:04,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:04,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667955312] [2020-12-23 08:22:04,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:04,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:22:04,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477858065] [2020-12-23 08:22:04,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:22:04,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:04,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:22:04,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:04,550 INFO L87 Difference]: Start difference. First operand 2292 states and 4297 transitions. Second operand 5 states. [2020-12-23 08:22:04,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:04,753 INFO L93 Difference]: Finished difference Result 4497 states and 8473 transitions. [2020-12-23 08:22:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:22:04,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2020-12-23 08:22:04,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:04,759 INFO L225 Difference]: With dead ends: 4497 [2020-12-23 08:22:04,760 INFO L226 Difference]: Without dead ends: 2279 [2020-12-23 08:22:04,763 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 08:22:04,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2020-12-23 08:22:04,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2279. [2020-12-23 08:22:04,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2020-12-23 08:22:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 4275 transitions. [2020-12-23 08:22:04,869 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 4275 transitions. Word has length 66 [2020-12-23 08:22:04,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:04,870 INFO L481 AbstractCegarLoop]: Abstraction has 2279 states and 4275 transitions. [2020-12-23 08:22:04,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:22:04,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 4275 transitions. [2020-12-23 08:22:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-23 08:22:04,872 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:04,872 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] [2020-12-23 08:22:04,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 08:22:04,873 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:04,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:04,873 INFO L82 PathProgramCache]: Analyzing trace with hash -544783691, now seen corresponding path program 1 times [2020-12-23 08:22:04,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:04,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959623376] [2020-12-23 08:22:04,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:04,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:04,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959623376] [2020-12-23 08:22:04,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:04,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:22:04,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755615110] [2020-12-23 08:22:04,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:22:04,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:04,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:22:04,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:04,945 INFO L87 Difference]: Start difference. First operand 2279 states and 4275 transitions. Second operand 5 states. [2020-12-23 08:22:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:05,123 INFO L93 Difference]: Finished difference Result 4491 states and 8462 transitions. [2020-12-23 08:22:05,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:22:05,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2020-12-23 08:22:05,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:05,131 INFO L225 Difference]: With dead ends: 4491 [2020-12-23 08:22:05,131 INFO L226 Difference]: Without dead ends: 2273 [2020-12-23 08:22:05,135 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 08:22:05,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2020-12-23 08:22:05,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2273. [2020-12-23 08:22:05,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2273 states. [2020-12-23 08:22:05,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 4266 transitions. [2020-12-23 08:22:05,244 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 4266 transitions. Word has length 69 [2020-12-23 08:22:05,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:05,245 INFO L481 AbstractCegarLoop]: Abstraction has 2273 states and 4266 transitions. [2020-12-23 08:22:05,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:22:05,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 4266 transitions. [2020-12-23 08:22:05,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-23 08:22:05,250 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:05,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:22:05,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 08:22:05,251 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:05,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:05,251 INFO L82 PathProgramCache]: Analyzing trace with hash 746929973, now seen corresponding path program 1 times [2020-12-23 08:22:05,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:05,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820538576] [2020-12-23 08:22:05,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:05,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820538576] [2020-12-23 08:22:05,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:05,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:22:05,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003266869] [2020-12-23 08:22:05,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:22:05,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:05,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:22:05,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:22:05,328 INFO L87 Difference]: Start difference. First operand 2273 states and 4266 transitions. Second operand 4 states. [2020-12-23 08:22:05,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:05,464 INFO L93 Difference]: Finished difference Result 4485 states and 8453 transitions. [2020-12-23 08:22:05,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:22:05,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2020-12-23 08:22:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:05,471 INFO L225 Difference]: With dead ends: 4485 [2020-12-23 08:22:05,471 INFO L226 Difference]: Without dead ends: 2259 [2020-12-23 08:22:05,479 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2020-12-23 08:22:05,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 2259. [2020-12-23 08:22:05,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2259 states. [2020-12-23 08:22:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 4245 transitions. [2020-12-23 08:22:05,585 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 4245 transitions. Word has length 69 [2020-12-23 08:22:05,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:05,585 INFO L481 AbstractCegarLoop]: Abstraction has 2259 states and 4245 transitions. [2020-12-23 08:22:05,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:22:05,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 4245 transitions. [2020-12-23 08:22:05,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-23 08:22:05,587 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:05,588 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] [2020-12-23 08:22:05,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 08:22:05,588 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:05,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:05,588 INFO L82 PathProgramCache]: Analyzing trace with hash -276984670, now seen corresponding path program 1 times [2020-12-23 08:22:05,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:05,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716169721] [2020-12-23 08:22:05,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:05,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716169721] [2020-12-23 08:22:05,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:05,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 08:22:05,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854371744] [2020-12-23 08:22:05,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:22:05,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:05,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:22:05,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:22:05,691 INFO L87 Difference]: Start difference. First operand 2259 states and 4245 transitions. Second operand 6 states. [2020-12-23 08:22:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:05,930 INFO L93 Difference]: Finished difference Result 4485 states and 8448 transitions. [2020-12-23 08:22:05,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:22:05,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2020-12-23 08:22:05,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:05,936 INFO L225 Difference]: With dead ends: 4485 [2020-12-23 08:22:05,937 INFO L226 Difference]: Without dead ends: 2279 [2020-12-23 08:22:05,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-23 08:22:05,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2020-12-23 08:22:06,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2259. [2020-12-23 08:22:06,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2259 states. [2020-12-23 08:22:06,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 4244 transitions. [2020-12-23 08:22:06,093 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 4244 transitions. Word has length 70 [2020-12-23 08:22:06,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:06,093 INFO L481 AbstractCegarLoop]: Abstraction has 2259 states and 4244 transitions. [2020-12-23 08:22:06,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:22:06,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 4244 transitions. [2020-12-23 08:22:06,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-23 08:22:06,095 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:06,096 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] [2020-12-23 08:22:06,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 08:22:06,096 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:06,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:06,097 INFO L82 PathProgramCache]: Analyzing trace with hash 918713326, now seen corresponding path program 1 times [2020-12-23 08:22:06,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:06,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18684681] [2020-12-23 08:22:06,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:06,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18684681] [2020-12-23 08:22:06,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:06,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 08:22:06,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804012349] [2020-12-23 08:22:06,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:22:06,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:06,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:22:06,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:22:06,188 INFO L87 Difference]: Start difference. First operand 2259 states and 4244 transitions. Second operand 6 states. [2020-12-23 08:22:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:06,461 INFO L93 Difference]: Finished difference Result 4475 states and 8429 transitions. [2020-12-23 08:22:06,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:22:06,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2020-12-23 08:22:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:06,468 INFO L225 Difference]: With dead ends: 4475 [2020-12-23 08:22:06,468 INFO L226 Difference]: Without dead ends: 2274 [2020-12-23 08:22:06,474 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-23 08:22:06,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2020-12-23 08:22:06,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2259. [2020-12-23 08:22:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2259 states. [2020-12-23 08:22:06,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 4243 transitions. [2020-12-23 08:22:06,597 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 4243 transitions. Word has length 71 [2020-12-23 08:22:06,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:06,598 INFO L481 AbstractCegarLoop]: Abstraction has 2259 states and 4243 transitions. [2020-12-23 08:22:06,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:22:06,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 4243 transitions. [2020-12-23 08:22:06,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 08:22:06,600 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:06,600 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] [2020-12-23 08:22:06,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 08:22:06,601 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:06,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:06,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1035877837, now seen corresponding path program 1 times [2020-12-23 08:22:06,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:06,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746383421] [2020-12-23 08:22:06,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:06,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:06,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746383421] [2020-12-23 08:22:06,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:06,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:22:06,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79766126] [2020-12-23 08:22:06,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:22:06,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:06,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:22:06,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:06,711 INFO L87 Difference]: Start difference. First operand 2259 states and 4243 transitions. Second operand 5 states. [2020-12-23 08:22:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:08,665 INFO L93 Difference]: Finished difference Result 8993 states and 16919 transitions. [2020-12-23 08:22:08,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:22:08,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2020-12-23 08:22:08,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:08,684 INFO L225 Difference]: With dead ends: 8993 [2020-12-23 08:22:08,685 INFO L226 Difference]: Without dead ends: 6807 [2020-12-23 08:22:08,690 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 08:22:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6807 states. [2020-12-23 08:22:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6807 to 2263. [2020-12-23 08:22:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2020-12-23 08:22:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 4247 transitions. [2020-12-23 08:22:08,904 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 4247 transitions. Word has length 72 [2020-12-23 08:22:08,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:08,904 INFO L481 AbstractCegarLoop]: Abstraction has 2263 states and 4247 transitions. [2020-12-23 08:22:08,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:22:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 4247 transitions. [2020-12-23 08:22:08,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-23 08:22:08,907 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:08,907 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:22:08,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 08:22:08,908 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:08,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:08,908 INFO L82 PathProgramCache]: Analyzing trace with hash -380545157, now seen corresponding path program 1 times [2020-12-23 08:22:08,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:08,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958403446] [2020-12-23 08:22:08,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:08,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:08,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958403446] [2020-12-23 08:22:08,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:08,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:22:08,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134470044] [2020-12-23 08:22:08,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:22:08,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:09,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:22:09,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:22:09,001 INFO L87 Difference]: Start difference. First operand 2263 states and 4247 transitions. Second operand 4 states. [2020-12-23 08:22:10,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:10,511 INFO L93 Difference]: Finished difference Result 6517 states and 12216 transitions. [2020-12-23 08:22:10,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:22:10,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-12-23 08:22:10,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:10,529 INFO L225 Difference]: With dead ends: 6517 [2020-12-23 08:22:10,530 INFO L226 Difference]: Without dead ends: 4314 [2020-12-23 08:22:10,538 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 [2020-12-23 08:22:10,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4314 states. [2020-12-23 08:22:10,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4314 to 3080. [2020-12-23 08:22:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2020-12-23 08:22:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 5728 transitions. [2020-12-23 08:22:10,728 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 5728 transitions. Word has length 73 [2020-12-23 08:22:10,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:10,728 INFO L481 AbstractCegarLoop]: Abstraction has 3080 states and 5728 transitions. [2020-12-23 08:22:10,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:22:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 5728 transitions. [2020-12-23 08:22:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 08:22:10,730 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:10,730 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] [2020-12-23 08:22:10,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 08:22:10,730 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:10,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:10,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1816838429, now seen corresponding path program 1 times [2020-12-23 08:22:10,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:10,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448717762] [2020-12-23 08:22:10,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:10,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:10,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448717762] [2020-12-23 08:22:10,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:10,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:22:10,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233329950] [2020-12-23 08:22:10,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:22:10,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:10,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:22:10,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:10,826 INFO L87 Difference]: Start difference. First operand 3080 states and 5728 transitions. Second operand 5 states. [2020-12-23 08:22:12,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:12,099 INFO L93 Difference]: Finished difference Result 21999 states and 41209 transitions. [2020-12-23 08:22:12,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:22:12,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2020-12-23 08:22:12,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:12,155 INFO L225 Difference]: With dead ends: 21999 [2020-12-23 08:22:12,155 INFO L226 Difference]: Without dead ends: 18988 [2020-12-23 08:22:12,165 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 08:22:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18988 states. [2020-12-23 08:22:12,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18988 to 5627. [2020-12-23 08:22:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5627 states. [2020-12-23 08:22:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5627 states to 5627 states and 10520 transitions. [2020-12-23 08:22:12,562 INFO L78 Accepts]: Start accepts. Automaton has 5627 states and 10520 transitions. Word has length 75 [2020-12-23 08:22:12,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:12,562 INFO L481 AbstractCegarLoop]: Abstraction has 5627 states and 10520 transitions. [2020-12-23 08:22:12,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:22:12,563 INFO L276 IsEmpty]: Start isEmpty. Operand 5627 states and 10520 transitions. [2020-12-23 08:22:12,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 08:22:12,564 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:12,564 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] [2020-12-23 08:22:12,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 08:22:12,565 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:12,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:12,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1950851935, now seen corresponding path program 1 times [2020-12-23 08:22:12,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:12,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570000459] [2020-12-23 08:22:12,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:12,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570000459] [2020-12-23 08:22:12,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:12,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:22:12,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427546873] [2020-12-23 08:22:12,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:22:12,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:12,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:22:12,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:22:12,657 INFO L87 Difference]: Start difference. First operand 5627 states and 10520 transitions. Second operand 4 states. [2020-12-23 08:22:13,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:13,256 INFO L93 Difference]: Finished difference Result 13750 states and 25696 transitions. [2020-12-23 08:22:13,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:22:13,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-23 08:22:13,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:13,279 INFO L225 Difference]: With dead ends: 13750 [2020-12-23 08:22:13,279 INFO L226 Difference]: Without dead ends: 11326 [2020-12-23 08:22:13,286 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 [2020-12-23 08:22:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11326 states. [2020-12-23 08:22:13,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11326 to 7800. [2020-12-23 08:22:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7800 states. [2020-12-23 08:22:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7800 states to 7800 states and 14579 transitions. [2020-12-23 08:22:13,654 INFO L78 Accepts]: Start accepts. Automaton has 7800 states and 14579 transitions. Word has length 75 [2020-12-23 08:22:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:13,654 INFO L481 AbstractCegarLoop]: Abstraction has 7800 states and 14579 transitions. [2020-12-23 08:22:13,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:22:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 7800 states and 14579 transitions. [2020-12-23 08:22:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 08:22:13,656 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:13,656 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:22:13,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 08:22:13,657 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:13,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:13,657 INFO L82 PathProgramCache]: Analyzing trace with hash 131116715, now seen corresponding path program 1 times [2020-12-23 08:22:13,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:13,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000439915] [2020-12-23 08:22:13,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:13,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:13,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000439915] [2020-12-23 08:22:13,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:13,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:22:13,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734380035] [2020-12-23 08:22:13,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:22:13,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:13,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:22:13,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:22:13,727 INFO L87 Difference]: Start difference. First operand 7800 states and 14579 transitions. Second operand 4 states. [2020-12-23 08:22:14,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:14,482 INFO L93 Difference]: Finished difference Result 16178 states and 30139 transitions. [2020-12-23 08:22:14,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:22:14,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-12-23 08:22:14,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:14,501 INFO L225 Difference]: With dead ends: 16178 [2020-12-23 08:22:14,502 INFO L226 Difference]: Without dead ends: 11770 [2020-12-23 08:22:14,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:14,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11770 states. [2020-12-23 08:22:14,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11770 to 7810. [2020-12-23 08:22:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7810 states. [2020-12-23 08:22:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7810 states to 7810 states and 14585 transitions. [2020-12-23 08:22:14,910 INFO L78 Accepts]: Start accepts. Automaton has 7810 states and 14585 transitions. Word has length 77 [2020-12-23 08:22:14,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:14,910 INFO L481 AbstractCegarLoop]: Abstraction has 7810 states and 14585 transitions. [2020-12-23 08:22:14,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:22:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 7810 states and 14585 transitions. [2020-12-23 08:22:14,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 08:22:14,913 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:14,913 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] [2020-12-23 08:22:14,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 08:22:14,914 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:14,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:14,914 INFO L82 PathProgramCache]: Analyzing trace with hash -589554988, now seen corresponding path program 1 times [2020-12-23 08:22:14,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:14,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036431261] [2020-12-23 08:22:14,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:15,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:15,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036431261] [2020-12-23 08:22:15,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:15,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 08:22:15,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613480006] [2020-12-23 08:22:15,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 08:22:15,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:15,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 08:22:15,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-23 08:22:15,026 INFO L87 Difference]: Start difference. First operand 7810 states and 14585 transitions. Second operand 7 states. [2020-12-23 08:22:15,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:15,969 INFO L93 Difference]: Finished difference Result 16588 states and 30936 transitions. [2020-12-23 08:22:15,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 08:22:15,969 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2020-12-23 08:22:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:15,982 INFO L225 Difference]: With dead ends: 16588 [2020-12-23 08:22:15,982 INFO L226 Difference]: Without dead ends: 12001 [2020-12-23 08:22:15,988 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-23 08:22:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12001 states. [2020-12-23 08:22:16,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12001 to 7814. [2020-12-23 08:22:16,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7814 states. [2020-12-23 08:22:16,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7814 states to 7814 states and 14583 transitions. [2020-12-23 08:22:16,439 INFO L78 Accepts]: Start accepts. Automaton has 7814 states and 14583 transitions. Word has length 83 [2020-12-23 08:22:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:16,441 INFO L481 AbstractCegarLoop]: Abstraction has 7814 states and 14583 transitions. [2020-12-23 08:22:16,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 08:22:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 7814 states and 14583 transitions. [2020-12-23 08:22:16,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 08:22:16,444 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:16,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] [2020-12-23 08:22:16,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 08:22:16,445 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:16,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:16,445 INFO L82 PathProgramCache]: Analyzing trace with hash -370700270, now seen corresponding path program 1 times [2020-12-23 08:22:16,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:16,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084190089] [2020-12-23 08:22:16,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:16,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084190089] [2020-12-23 08:22:16,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:16,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:22:16,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57548486] [2020-12-23 08:22:16,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:22:16,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:16,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:22:16,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:16,533 INFO L87 Difference]: Start difference. First operand 7814 states and 14583 transitions. Second operand 5 states. [2020-12-23 08:22:17,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:17,323 INFO L93 Difference]: Finished difference Result 12221 states and 22806 transitions. [2020-12-23 08:22:17,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:22:17,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2020-12-23 08:22:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:17,337 INFO L225 Difference]: With dead ends: 12221 [2020-12-23 08:22:17,338 INFO L226 Difference]: Without dead ends: 7833 [2020-12-23 08:22:17,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:22:17,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7833 states. [2020-12-23 08:22:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7833 to 7814. [2020-12-23 08:22:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7814 states. [2020-12-23 08:22:17,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7814 states to 7814 states and 14568 transitions. [2020-12-23 08:22:17,861 INFO L78 Accepts]: Start accepts. Automaton has 7814 states and 14568 transitions. Word has length 83 [2020-12-23 08:22:17,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:17,861 INFO L481 AbstractCegarLoop]: Abstraction has 7814 states and 14568 transitions. [2020-12-23 08:22:17,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:22:17,861 INFO L276 IsEmpty]: Start isEmpty. Operand 7814 states and 14568 transitions. [2020-12-23 08:22:17,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 08:22:17,863 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:17,863 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] [2020-12-23 08:22:17,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 08:22:17,864 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:17,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:17,864 INFO L82 PathProgramCache]: Analyzing trace with hash -957506284, now seen corresponding path program 1 times [2020-12-23 08:22:17,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:17,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910093143] [2020-12-23 08:22:17,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:17,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:17,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910093143] [2020-12-23 08:22:17,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:17,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:22:17,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812221375] [2020-12-23 08:22:17,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:22:17,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:17,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:22:17,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:22:17,976 INFO L87 Difference]: Start difference. First operand 7814 states and 14568 transitions. Second operand 3 states. [2020-12-23 08:22:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:18,385 INFO L93 Difference]: Finished difference Result 14107 states and 26317 transitions. [2020-12-23 08:22:18,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:22:18,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2020-12-23 08:22:18,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:18,398 INFO L225 Difference]: With dead ends: 14107 [2020-12-23 08:22:18,399 INFO L226 Difference]: Without dead ends: 7792 [2020-12-23 08:22:18,410 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 [2020-12-23 08:22:18,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7792 states. [2020-12-23 08:22:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7792 to 7792. [2020-12-23 08:22:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7792 states. [2020-12-23 08:22:18,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7792 states to 7792 states and 14526 transitions. [2020-12-23 08:22:18,797 INFO L78 Accepts]: Start accepts. Automaton has 7792 states and 14526 transitions. Word has length 83 [2020-12-23 08:22:18,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:18,797 INFO L481 AbstractCegarLoop]: Abstraction has 7792 states and 14526 transitions. [2020-12-23 08:22:18,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:22:18,797 INFO L276 IsEmpty]: Start isEmpty. Operand 7792 states and 14526 transitions. [2020-12-23 08:22:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 08:22:18,799 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:18,800 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] [2020-12-23 08:22:18,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 08:22:18,800 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:18,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:18,801 INFO L82 PathProgramCache]: Analyzing trace with hash 81726334, now seen corresponding path program 1 times [2020-12-23 08:22:18,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:18,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447060555] [2020-12-23 08:22:18,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:18,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:18,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447060555] [2020-12-23 08:22:18,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:18,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:22:18,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963725230] [2020-12-23 08:22:18,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:22:18,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:18,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:22:18,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:18,872 INFO L87 Difference]: Start difference. First operand 7792 states and 14526 transitions. Second operand 5 states. [2020-12-23 08:22:20,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:20,326 INFO L93 Difference]: Finished difference Result 31374 states and 58093 transitions. [2020-12-23 08:22:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:22:20,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2020-12-23 08:22:20,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:20,363 INFO L225 Difference]: With dead ends: 31374 [2020-12-23 08:22:20,363 INFO L226 Difference]: Without dead ends: 27017 [2020-12-23 08:22:20,376 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 08:22:20,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27017 states. [2020-12-23 08:22:21,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27017 to 9514. [2020-12-23 08:22:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9514 states. [2020-12-23 08:22:21,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9514 states to 9514 states and 17504 transitions. [2020-12-23 08:22:21,357 INFO L78 Accepts]: Start accepts. Automaton has 9514 states and 17504 transitions. Word has length 85 [2020-12-23 08:22:21,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:21,357 INFO L481 AbstractCegarLoop]: Abstraction has 9514 states and 17504 transitions. [2020-12-23 08:22:21,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:22:21,357 INFO L276 IsEmpty]: Start isEmpty. Operand 9514 states and 17504 transitions. [2020-12-23 08:22:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 08:22:21,359 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:21,359 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] [2020-12-23 08:22:21,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 08:22:21,360 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:21,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:21,360 INFO L82 PathProgramCache]: Analyzing trace with hash -233581316, now seen corresponding path program 1 times [2020-12-23 08:22:21,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:21,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979076912] [2020-12-23 08:22:21,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:21,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979076912] [2020-12-23 08:22:21,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:21,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:22:21,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706190523] [2020-12-23 08:22:21,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:22:21,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:21,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:22:21,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:21,469 INFO L87 Difference]: Start difference. First operand 9514 states and 17504 transitions. Second operand 5 states. [2020-12-23 08:22:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:22,322 INFO L93 Difference]: Finished difference Result 15694 states and 28913 transitions. [2020-12-23 08:22:22,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:22:22,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2020-12-23 08:22:22,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:22,340 INFO L225 Difference]: With dead ends: 15694 [2020-12-23 08:22:22,341 INFO L226 Difference]: Without dead ends: 15681 [2020-12-23 08:22:22,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:22:22,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15681 states. [2020-12-23 08:22:22,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15681 to 9532. [2020-12-23 08:22:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9532 states. [2020-12-23 08:22:22,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9532 states to 9532 states and 17522 transitions. [2020-12-23 08:22:22,842 INFO L78 Accepts]: Start accepts. Automaton has 9532 states and 17522 transitions. Word has length 85 [2020-12-23 08:22:22,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:22,842 INFO L481 AbstractCegarLoop]: Abstraction has 9532 states and 17522 transitions. [2020-12-23 08:22:22,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:22:22,843 INFO L276 IsEmpty]: Start isEmpty. Operand 9532 states and 17522 transitions. [2020-12-23 08:22:22,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-23 08:22:22,846 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:22,846 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] [2020-12-23 08:22:22,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 08:22:22,846 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:22,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:22,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2017105313, now seen corresponding path program 1 times [2020-12-23 08:22:22,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:22,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989635778] [2020-12-23 08:22:22,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:22,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:22,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989635778] [2020-12-23 08:22:22,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:22,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 08:22:22,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219807836] [2020-12-23 08:22:22,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:22:22,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:22,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:22:22,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:22:22,928 INFO L87 Difference]: Start difference. First operand 9532 states and 17522 transitions. Second operand 6 states. [2020-12-23 08:22:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:23,419 INFO L93 Difference]: Finished difference Result 9551 states and 17540 transitions. [2020-12-23 08:22:23,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 08:22:23,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2020-12-23 08:22:23,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:23,430 INFO L225 Difference]: With dead ends: 9551 [2020-12-23 08:22:23,431 INFO L226 Difference]: Without dead ends: 9538 [2020-12-23 08:22:23,433 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-23 08:22:23,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9538 states. [2020-12-23 08:22:23,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9538 to 9532. [2020-12-23 08:22:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9532 states. [2020-12-23 08:22:23,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9532 states to 9532 states and 17512 transitions. [2020-12-23 08:22:23,995 INFO L78 Accepts]: Start accepts. Automaton has 9532 states and 17512 transitions. Word has length 87 [2020-12-23 08:22:23,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:23,996 INFO L481 AbstractCegarLoop]: Abstraction has 9532 states and 17512 transitions. [2020-12-23 08:22:23,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:22:23,996 INFO L276 IsEmpty]: Start isEmpty. Operand 9532 states and 17512 transitions. [2020-12-23 08:22:23,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-23 08:22:24,000 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:24,000 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] [2020-12-23 08:22:24,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 08:22:24,000 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:24,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:24,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2109417211, now seen corresponding path program 1 times [2020-12-23 08:22:24,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:24,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692581881] [2020-12-23 08:22:24,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:24,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692581881] [2020-12-23 08:22:24,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:24,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:22:24,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206231089] [2020-12-23 08:22:24,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:22:24,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:24,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:22:24,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:24,085 INFO L87 Difference]: Start difference. First operand 9532 states and 17512 transitions. Second operand 5 states. [2020-12-23 08:22:25,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:25,545 INFO L93 Difference]: Finished difference Result 22633 states and 41389 transitions. [2020-12-23 08:22:25,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:22:25,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2020-12-23 08:22:25,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:25,561 INFO L225 Difference]: With dead ends: 22633 [2020-12-23 08:22:25,561 INFO L226 Difference]: Without dead ends: 14862 [2020-12-23 08:22:25,569 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 08:22:25,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14862 states. [2020-12-23 08:22:26,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14862 to 9532. [2020-12-23 08:22:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9532 states. [2020-12-23 08:22:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9532 states to 9532 states and 17502 transitions. [2020-12-23 08:22:26,080 INFO L78 Accepts]: Start accepts. Automaton has 9532 states and 17502 transitions. Word has length 94 [2020-12-23 08:22:26,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:26,080 INFO L481 AbstractCegarLoop]: Abstraction has 9532 states and 17502 transitions. [2020-12-23 08:22:26,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:22:26,080 INFO L276 IsEmpty]: Start isEmpty. Operand 9532 states and 17502 transitions. [2020-12-23 08:22:26,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 08:22:26,084 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:26,084 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] [2020-12-23 08:22:26,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 08:22:26,085 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:26,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:26,085 INFO L82 PathProgramCache]: Analyzing trace with hash 431382755, now seen corresponding path program 1 times [2020-12-23 08:22:26,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:26,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415951435] [2020-12-23 08:22:26,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:26,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415951435] [2020-12-23 08:22:26,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:26,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:22:26,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547505615] [2020-12-23 08:22:26,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:22:26,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:26,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:22:26,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:26,160 INFO L87 Difference]: Start difference. First operand 9532 states and 17502 transitions. Second operand 5 states. [2020-12-23 08:22:27,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:27,795 INFO L93 Difference]: Finished difference Result 22530 states and 41243 transitions. [2020-12-23 08:22:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:22:27,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-12-23 08:22:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:27,812 INFO L225 Difference]: With dead ends: 22530 [2020-12-23 08:22:27,812 INFO L226 Difference]: Without dead ends: 14421 [2020-12-23 08:22:27,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:22:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14421 states. [2020-12-23 08:22:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14421 to 9532. [2020-12-23 08:22:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9532 states. [2020-12-23 08:22:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9532 states to 9532 states and 17306 transitions. [2020-12-23 08:22:28,381 INFO L78 Accepts]: Start accepts. Automaton has 9532 states and 17306 transitions. Word has length 98 [2020-12-23 08:22:28,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:28,381 INFO L481 AbstractCegarLoop]: Abstraction has 9532 states and 17306 transitions. [2020-12-23 08:22:28,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:22:28,381 INFO L276 IsEmpty]: Start isEmpty. Operand 9532 states and 17306 transitions. [2020-12-23 08:22:28,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 08:22:28,385 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:28,385 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] [2020-12-23 08:22:28,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 08:22:28,385 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:28,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:28,386 INFO L82 PathProgramCache]: Analyzing trace with hash -197943096, now seen corresponding path program 1 times [2020-12-23 08:22:28,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:28,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081885549] [2020-12-23 08:22:28,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:28,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:28,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081885549] [2020-12-23 08:22:28,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:28,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:22:28,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163067961] [2020-12-23 08:22:28,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:22:28,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:28,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:22:28,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:28,515 INFO L87 Difference]: Start difference. First operand 9532 states and 17306 transitions. Second operand 5 states. [2020-12-23 08:22:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:30,148 INFO L93 Difference]: Finished difference Result 27569 states and 50096 transitions. [2020-12-23 08:22:30,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:22:30,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2020-12-23 08:22:30,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:30,177 INFO L225 Difference]: With dead ends: 27569 [2020-12-23 08:22:30,177 INFO L226 Difference]: Without dead ends: 21422 [2020-12-23 08:22:30,186 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 08:22:30,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21422 states. [2020-12-23 08:22:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21422 to 9532. [2020-12-23 08:22:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9532 states. [2020-12-23 08:22:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9532 states to 9532 states and 17290 transitions. [2020-12-23 08:22:30,893 INFO L78 Accepts]: Start accepts. Automaton has 9532 states and 17290 transitions. Word has length 99 [2020-12-23 08:22:30,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:30,894 INFO L481 AbstractCegarLoop]: Abstraction has 9532 states and 17290 transitions. [2020-12-23 08:22:30,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:22:30,894 INFO L276 IsEmpty]: Start isEmpty. Operand 9532 states and 17290 transitions. [2020-12-23 08:22:30,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 08:22:30,897 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:30,898 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] [2020-12-23 08:22:30,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 08:22:30,898 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:30,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:30,898 INFO L82 PathProgramCache]: Analyzing trace with hash 2091485265, now seen corresponding path program 1 times [2020-12-23 08:22:30,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:30,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402158390] [2020-12-23 08:22:30,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:30,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402158390] [2020-12-23 08:22:30,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:30,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:22:30,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254523147] [2020-12-23 08:22:30,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:22:30,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:30,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:22:30,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:30,966 INFO L87 Difference]: Start difference. First operand 9532 states and 17290 transitions. Second operand 5 states. [2020-12-23 08:22:31,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:31,575 INFO L93 Difference]: Finished difference Result 15948 states and 28742 transitions. [2020-12-23 08:22:31,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:22:31,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2020-12-23 08:22:31,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:31,591 INFO L225 Difference]: With dead ends: 15948 [2020-12-23 08:22:31,592 INFO L226 Difference]: Without dead ends: 9545 [2020-12-23 08:22:31,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:22:31,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9545 states. [2020-12-23 08:22:32,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9545 to 9532. [2020-12-23 08:22:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9532 states. [2020-12-23 08:22:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9532 states to 9532 states and 17086 transitions. [2020-12-23 08:22:32,088 INFO L78 Accepts]: Start accepts. Automaton has 9532 states and 17086 transitions. Word has length 100 [2020-12-23 08:22:32,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:32,088 INFO L481 AbstractCegarLoop]: Abstraction has 9532 states and 17086 transitions. [2020-12-23 08:22:32,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:22:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 9532 states and 17086 transitions. [2020-12-23 08:22:32,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 08:22:32,092 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:32,092 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] [2020-12-23 08:22:32,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 08:22:32,092 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:32,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:32,093 INFO L82 PathProgramCache]: Analyzing trace with hash -859735748, now seen corresponding path program 1 times [2020-12-23 08:22:32,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:32,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15333756] [2020-12-23 08:22:32,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:32,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:32,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15333756] [2020-12-23 08:22:32,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:32,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:22:32,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868593846] [2020-12-23 08:22:32,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:22:32,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:32,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:22:32,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:32,202 INFO L87 Difference]: Start difference. First operand 9532 states and 17086 transitions. Second operand 5 states. [2020-12-23 08:22:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:33,056 INFO L93 Difference]: Finished difference Result 15212 states and 27376 transitions. [2020-12-23 08:22:33,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 08:22:33,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2020-12-23 08:22:33,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:33,075 INFO L225 Difference]: With dead ends: 15212 [2020-12-23 08:22:33,075 INFO L226 Difference]: Without dead ends: 15199 [2020-12-23 08:22:33,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 08:22:33,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15199 states. [2020-12-23 08:22:33,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15199 to 9547. [2020-12-23 08:22:33,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9547 states. [2020-12-23 08:22:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9547 states to 9547 states and 17096 transitions. [2020-12-23 08:22:33,608 INFO L78 Accepts]: Start accepts. Automaton has 9547 states and 17096 transitions. Word has length 101 [2020-12-23 08:22:33,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:33,608 INFO L481 AbstractCegarLoop]: Abstraction has 9547 states and 17096 transitions. [2020-12-23 08:22:33,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:22:33,608 INFO L276 IsEmpty]: Start isEmpty. Operand 9547 states and 17096 transitions. [2020-12-23 08:22:33,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 08:22:33,613 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:33,614 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] [2020-12-23 08:22:33,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 08:22:33,614 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:33,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:33,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1828741120, now seen corresponding path program 1 times [2020-12-23 08:22:33,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:33,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518680455] [2020-12-23 08:22:33,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:33,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:33,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518680455] [2020-12-23 08:22:33,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:33,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:22:33,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867002860] [2020-12-23 08:22:33,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:22:33,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:33,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:22:33,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:33,763 INFO L87 Difference]: Start difference. First operand 9547 states and 17096 transitions. Second operand 5 states. [2020-12-23 08:22:36,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:36,675 INFO L93 Difference]: Finished difference Result 48988 states and 88686 transitions. [2020-12-23 08:22:36,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:22:36,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2020-12-23 08:22:36,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:36,721 INFO L225 Difference]: With dead ends: 48988 [2020-12-23 08:22:36,721 INFO L226 Difference]: Without dead ends: 41202 [2020-12-23 08:22:36,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 08:22:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41202 states. [2020-12-23 08:22:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41202 to 19058. [2020-12-23 08:22:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19058 states. [2020-12-23 08:22:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19058 states to 19058 states and 34148 transitions. [2020-12-23 08:22:38,012 INFO L78 Accepts]: Start accepts. Automaton has 19058 states and 34148 transitions. Word has length 117 [2020-12-23 08:22:38,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:38,013 INFO L481 AbstractCegarLoop]: Abstraction has 19058 states and 34148 transitions. [2020-12-23 08:22:38,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:22:38,013 INFO L276 IsEmpty]: Start isEmpty. Operand 19058 states and 34148 transitions. [2020-12-23 08:22:38,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 08:22:38,021 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:38,021 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] [2020-12-23 08:22:38,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 08:22:38,021 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:38,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:38,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1801123160, now seen corresponding path program 1 times [2020-12-23 08:22:38,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:38,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147380323] [2020-12-23 08:22:38,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:38,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147380323] [2020-12-23 08:22:38,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:38,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:22:38,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304781816] [2020-12-23 08:22:38,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:22:38,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:38,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:22:38,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:22:38,089 INFO L87 Difference]: Start difference. First operand 19058 states and 34148 transitions. Second operand 3 states. [2020-12-23 08:22:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:40,481 INFO L93 Difference]: Finished difference Result 45079 states and 80275 transitions. [2020-12-23 08:22:40,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:22:40,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2020-12-23 08:22:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:40,517 INFO L225 Difference]: With dead ends: 45079 [2020-12-23 08:22:40,517 INFO L226 Difference]: Without dead ends: 28822 [2020-12-23 08:22:40,534 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 [2020-12-23 08:22:40,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28822 states. [2020-12-23 08:22:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28822 to 18614. [2020-12-23 08:22:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18614 states. [2020-12-23 08:22:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18614 states to 18614 states and 33207 transitions. [2020-12-23 08:22:41,762 INFO L78 Accepts]: Start accepts. Automaton has 18614 states and 33207 transitions. Word has length 118 [2020-12-23 08:22:41,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:41,763 INFO L481 AbstractCegarLoop]: Abstraction has 18614 states and 33207 transitions. [2020-12-23 08:22:41,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:22:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 18614 states and 33207 transitions. [2020-12-23 08:22:41,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 08:22:41,771 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:41,771 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] [2020-12-23 08:22:41,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 08:22:41,771 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:41,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:41,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1501041846, now seen corresponding path program 1 times [2020-12-23 08:22:41,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:41,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232845348] [2020-12-23 08:22:41,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:41,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232845348] [2020-12-23 08:22:41,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:41,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:22:41,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681497790] [2020-12-23 08:22:41,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:22:41,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:41,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:22:41,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:41,837 INFO L87 Difference]: Start difference. First operand 18614 states and 33207 transitions. Second operand 5 states. [2020-12-23 08:22:43,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:43,071 INFO L93 Difference]: Finished difference Result 27364 states and 48923 transitions. [2020-12-23 08:22:43,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 08:22:43,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2020-12-23 08:22:43,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:43,091 INFO L225 Difference]: With dead ends: 27364 [2020-12-23 08:22:43,091 INFO L226 Difference]: Without dead ends: 17994 [2020-12-23 08:22:43,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 08:22:43,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17994 states. [2020-12-23 08:22:44,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17994 to 17994. [2020-12-23 08:22:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17994 states. [2020-12-23 08:22:44,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17994 states to 17994 states and 32205 transitions. [2020-12-23 08:22:44,112 INFO L78 Accepts]: Start accepts. Automaton has 17994 states and 32205 transitions. Word has length 118 [2020-12-23 08:22:44,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:44,112 INFO L481 AbstractCegarLoop]: Abstraction has 17994 states and 32205 transitions. [2020-12-23 08:22:44,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:22:44,112 INFO L276 IsEmpty]: Start isEmpty. Operand 17994 states and 32205 transitions. [2020-12-23 08:22:44,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-12-23 08:22:44,120 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:44,120 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 08:22:44,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 08:22:44,120 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:44,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:44,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1355911847, now seen corresponding path program 1 times [2020-12-23 08:22:44,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:44,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971808647] [2020-12-23 08:22:44,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:44,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971808647] [2020-12-23 08:22:44,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:44,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:22:44,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994252760] [2020-12-23 08:22:44,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:22:44,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:44,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:22:44,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:44,368 INFO L87 Difference]: Start difference. First operand 17994 states and 32205 transitions. Second operand 5 states. [2020-12-23 08:22:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:48,026 INFO L93 Difference]: Finished difference Result 40519 states and 72270 transitions. [2020-12-23 08:22:48,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:22:48,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2020-12-23 08:22:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:48,059 INFO L225 Difference]: With dead ends: 40519 [2020-12-23 08:22:48,059 INFO L226 Difference]: Without dead ends: 29490 [2020-12-23 08:22:48,067 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:22:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29490 states. [2020-12-23 08:22:49,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29490 to 25426. [2020-12-23 08:22:49,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25426 states. [2020-12-23 08:22:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25426 states to 25426 states and 45842 transitions. [2020-12-23 08:22:49,703 INFO L78 Accepts]: Start accepts. Automaton has 25426 states and 45842 transitions. Word has length 132 [2020-12-23 08:22:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:49,703 INFO L481 AbstractCegarLoop]: Abstraction has 25426 states and 45842 transitions. [2020-12-23 08:22:49,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:22:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 25426 states and 45842 transitions. [2020-12-23 08:22:49,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 08:22:49,712 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:49,713 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 08:22:49,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 08:22:49,713 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:49,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:49,713 INFO L82 PathProgramCache]: Analyzing trace with hash 462922686, now seen corresponding path program 1 times [2020-12-23 08:22:49,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:49,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558003730] [2020-12-23 08:22:49,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:49,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:49,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558003730] [2020-12-23 08:22:49,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:49,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:22:49,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939300090] [2020-12-23 08:22:49,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:22:49,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:49,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:22:49,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:49,828 INFO L87 Difference]: Start difference. First operand 25426 states and 45842 transitions. Second operand 5 states. [2020-12-23 08:22:54,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:54,052 INFO L93 Difference]: Finished difference Result 64239 states and 115545 transitions. [2020-12-23 08:22:54,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:22:54,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2020-12-23 08:22:54,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:54,105 INFO L225 Difference]: With dead ends: 64239 [2020-12-23 08:22:54,105 INFO L226 Difference]: Without dead ends: 45810 [2020-12-23 08:22:54,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:22:54,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45810 states. [2020-12-23 08:22:57,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45810 to 40994. [2020-12-23 08:22:57,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40994 states. [2020-12-23 08:22:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40994 states to 40994 states and 74188 transitions. [2020-12-23 08:22:57,123 INFO L78 Accepts]: Start accepts. Automaton has 40994 states and 74188 transitions. Word has length 133 [2020-12-23 08:22:57,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:57,123 INFO L481 AbstractCegarLoop]: Abstraction has 40994 states and 74188 transitions. [2020-12-23 08:22:57,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:22:57,123 INFO L276 IsEmpty]: Start isEmpty. Operand 40994 states and 74188 transitions. [2020-12-23 08:22:57,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-23 08:22:57,135 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:57,135 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 08:22:57,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 08:22:57,135 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:22:57,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:57,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1316231682, now seen corresponding path program 1 times [2020-12-23 08:22:57,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:57,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395359503] [2020-12-23 08:22:57,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:22:57,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395359503] [2020-12-23 08:22:57,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:57,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:22:57,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559206283] [2020-12-23 08:22:57,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:22:57,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:57,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:22:57,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:57,380 INFO L87 Difference]: Start difference. First operand 40994 states and 74188 transitions. Second operand 5 states. [2020-12-23 08:23:02,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:23:02,095 INFO L93 Difference]: Finished difference Result 79639 states and 143187 transitions. [2020-12-23 08:23:02,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:23:02,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2020-12-23 08:23:02,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:23:02,159 INFO L225 Difference]: With dead ends: 79639 [2020-12-23 08:23:02,160 INFO L226 Difference]: Without dead ends: 45634 [2020-12-23 08:23:02,183 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:23:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45634 states. [2020-12-23 08:23:05,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45634 to 40994. [2020-12-23 08:23:05,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40994 states. [2020-12-23 08:23:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40994 states to 40994 states and 74164 transitions. [2020-12-23 08:23:05,166 INFO L78 Accepts]: Start accepts. Automaton has 40994 states and 74164 transitions. Word has length 134 [2020-12-23 08:23:05,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:23:05,166 INFO L481 AbstractCegarLoop]: Abstraction has 40994 states and 74164 transitions. [2020-12-23 08:23:05,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:23:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 40994 states and 74164 transitions. [2020-12-23 08:23:05,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-23 08:23:05,177 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:23:05,177 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 08:23:05,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-23 08:23:05,178 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:23:05,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:23:05,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2045049158, now seen corresponding path program 1 times [2020-12-23 08:23:05,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:23:05,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685703489] [2020-12-23 08:23:05,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:23:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:23:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:23:05,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685703489] [2020-12-23 08:23:05,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:23:05,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:23:05,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006871967] [2020-12-23 08:23:05,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:23:05,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:23:05,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:23:05,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:23:05,256 INFO L87 Difference]: Start difference. First operand 40994 states and 74164 transitions. Second operand 4 states. [2020-12-23 08:23:09,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:23:09,265 INFO L93 Difference]: Finished difference Result 107581 states and 196781 transitions. [2020-12-23 08:23:09,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:23:09,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2020-12-23 08:23:09,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:23:09,365 INFO L225 Difference]: With dead ends: 107581 [2020-12-23 08:23:09,365 INFO L226 Difference]: Without dead ends: 72331 [2020-12-23 08:23:09,394 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:23:09,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72331 states. [2020-12-23 08:23:12,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72331 to 41068. [2020-12-23 08:23:12,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41068 states. [2020-12-23 08:23:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41068 states to 41068 states and 74238 transitions. [2020-12-23 08:23:12,491 INFO L78 Accepts]: Start accepts. Automaton has 41068 states and 74238 transitions. Word has length 134 [2020-12-23 08:23:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:23:12,491 INFO L481 AbstractCegarLoop]: Abstraction has 41068 states and 74238 transitions. [2020-12-23 08:23:12,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:23:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 41068 states and 74238 transitions. [2020-12-23 08:23:12,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-12-23 08:23:12,500 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:23:12,500 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 08:23:12,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-23 08:23:12,501 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:23:12,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:23:12,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1921862013, now seen corresponding path program 1 times [2020-12-23 08:23:12,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:23:12,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997249524] [2020-12-23 08:23:12,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:23:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:23:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:23:12,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997249524] [2020-12-23 08:23:12,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:23:12,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:23:12,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040673327] [2020-12-23 08:23:12,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:23:12,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:23:12,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:23:12,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:23:12,615 INFO L87 Difference]: Start difference. First operand 41068 states and 74238 transitions. Second operand 5 states. [2020-12-23 08:23:16,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:23:16,355 INFO L93 Difference]: Finished difference Result 63256 states and 113630 transitions. [2020-12-23 08:23:16,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:23:16,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2020-12-23 08:23:16,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:23:16,388 INFO L225 Difference]: With dead ends: 63256 [2020-12-23 08:23:16,388 INFO L226 Difference]: Without dead ends: 29187 [2020-12-23 08:23:16,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:23:16,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29187 states. [2020-12-23 08:23:18,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29187 to 27060. [2020-12-23 08:23:18,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27060 states. [2020-12-23 08:23:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27060 states to 27060 states and 48515 transitions. [2020-12-23 08:23:18,397 INFO L78 Accepts]: Start accepts. Automaton has 27060 states and 48515 transitions. Word has length 135 [2020-12-23 08:23:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:23:18,397 INFO L481 AbstractCegarLoop]: Abstraction has 27060 states and 48515 transitions. [2020-12-23 08:23:18,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:23:18,397 INFO L276 IsEmpty]: Start isEmpty. Operand 27060 states and 48515 transitions. [2020-12-23 08:23:18,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-23 08:23:18,404 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:23:18,404 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 08:23:18,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-23 08:23:18,404 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:23:18,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:23:18,404 INFO L82 PathProgramCache]: Analyzing trace with hash -203295112, now seen corresponding path program 1 times [2020-12-23 08:23:18,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:23:18,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680378174] [2020-12-23 08:23:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:23:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:23:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:23:18,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680378174] [2020-12-23 08:23:18,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:23:18,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:23:18,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104732074] [2020-12-23 08:23:18,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:23:18,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:23:18,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:23:18,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:23:18,498 INFO L87 Difference]: Start difference. First operand 27060 states and 48515 transitions. Second operand 5 states. [2020-12-23 08:23:22,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:23:22,282 INFO L93 Difference]: Finished difference Result 57954 states and 103952 transitions. [2020-12-23 08:23:22,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 08:23:22,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2020-12-23 08:23:22,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:23:22,325 INFO L225 Difference]: With dead ends: 57954 [2020-12-23 08:23:22,325 INFO L226 Difference]: Without dead ends: 37901 [2020-12-23 08:23:22,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 08:23:22,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37901 states. [2020-12-23 08:23:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37901 to 27072. [2020-12-23 08:23:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27072 states. [2020-12-23 08:23:24,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27072 states to 27072 states and 48527 transitions. [2020-12-23 08:23:24,353 INFO L78 Accepts]: Start accepts. Automaton has 27072 states and 48527 transitions. Word has length 137 [2020-12-23 08:23:24,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:23:24,353 INFO L481 AbstractCegarLoop]: Abstraction has 27072 states and 48527 transitions. [2020-12-23 08:23:24,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:23:24,353 INFO L276 IsEmpty]: Start isEmpty. Operand 27072 states and 48527 transitions. [2020-12-23 08:23:24,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-12-23 08:23:24,360 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:23:24,360 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 08:23:24,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-23 08:23:24,360 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:23:24,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:23:24,360 INFO L82 PathProgramCache]: Analyzing trace with hash -494399575, now seen corresponding path program 1 times [2020-12-23 08:23:24,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:23:24,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631204877] [2020-12-23 08:23:24,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:23:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:23:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:23:24,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631204877] [2020-12-23 08:23:24,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:23:24,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:23:24,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428309872] [2020-12-23 08:23:24,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:23:24,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:23:24,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:23:24,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:23:24,475 INFO L87 Difference]: Start difference. First operand 27072 states and 48527 transitions. Second operand 5 states. [2020-12-23 08:23:28,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:23:28,504 INFO L93 Difference]: Finished difference Result 51021 states and 90759 transitions. [2020-12-23 08:23:28,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:23:28,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2020-12-23 08:23:28,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:23:28,540 INFO L225 Difference]: With dead ends: 51021 [2020-12-23 08:23:28,540 INFO L226 Difference]: Without dead ends: 30956 [2020-12-23 08:23:28,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:23:28,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30956 states. [2020-12-23 08:23:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30956 to 27048. [2020-12-23 08:23:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27048 states. [2020-12-23 08:23:30,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27048 states to 27048 states and 48475 transitions. [2020-12-23 08:23:30,533 INFO L78 Accepts]: Start accepts. Automaton has 27048 states and 48475 transitions. Word has length 138 [2020-12-23 08:23:30,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:23:30,534 INFO L481 AbstractCegarLoop]: Abstraction has 27048 states and 48475 transitions. [2020-12-23 08:23:30,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:23:30,534 INFO L276 IsEmpty]: Start isEmpty. Operand 27048 states and 48475 transitions. [2020-12-23 08:23:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-12-23 08:23:30,540 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:23:30,540 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 08:23:30,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-23 08:23:30,541 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:23:30,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:23:30,541 INFO L82 PathProgramCache]: Analyzing trace with hash -888766361, now seen corresponding path program 1 times [2020-12-23 08:23:30,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:23:30,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274753926] [2020-12-23 08:23:30,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:23:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:23:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:23:30,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274753926] [2020-12-23 08:23:30,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:23:30,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:23:30,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694325492] [2020-12-23 08:23:30,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:23:30,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:23:30,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:23:30,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:23:30,621 INFO L87 Difference]: Start difference. First operand 27048 states and 48475 transitions. Second operand 5 states. [2020-12-23 08:23:37,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:23:37,754 INFO L93 Difference]: Finished difference Result 91539 states and 163314 transitions. [2020-12-23 08:23:37,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:23:37,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2020-12-23 08:23:37,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:23:37,846 INFO L225 Difference]: With dead ends: 91539 [2020-12-23 08:23:37,847 INFO L226 Difference]: Without dead ends: 71498 [2020-12-23 08:23:37,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 08:23:37,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71498 states. [2020-12-23 08:23:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71498 to 33672. [2020-12-23 08:23:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33672 states. [2020-12-23 08:23:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33672 states to 33672 states and 60889 transitions. [2020-12-23 08:23:40,637 INFO L78 Accepts]: Start accepts. Automaton has 33672 states and 60889 transitions. Word has length 138 [2020-12-23 08:23:40,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:23:40,638 INFO L481 AbstractCegarLoop]: Abstraction has 33672 states and 60889 transitions. [2020-12-23 08:23:40,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:23:40,638 INFO L276 IsEmpty]: Start isEmpty. Operand 33672 states and 60889 transitions. [2020-12-23 08:23:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-12-23 08:23:40,644 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:23:40,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] [2020-12-23 08:23:40,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-23 08:23:40,645 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:23:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:23:40,645 INFO L82 PathProgramCache]: Analyzing trace with hash 663002631, now seen corresponding path program 1 times [2020-12-23 08:23:40,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:23:40,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806159574] [2020-12-23 08:23:40,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:23:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:23:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:23:40,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806159574] [2020-12-23 08:23:40,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:23:40,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:23:40,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924874728] [2020-12-23 08:23:40,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:23:40,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:23:40,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:23:40,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:23:40,711 INFO L87 Difference]: Start difference. First operand 33672 states and 60889 transitions. Second operand 4 states. [2020-12-23 08:23:43,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:23:43,179 INFO L93 Difference]: Finished difference Result 67620 states and 122188 transitions. [2020-12-23 08:23:43,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:23:43,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2020-12-23 08:23:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:23:43,218 INFO L225 Difference]: With dead ends: 67620 [2020-12-23 08:23:43,218 INFO L226 Difference]: Without dead ends: 34373 [2020-12-23 08:23:43,233 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:23:43,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34373 states. [2020-12-23 08:23:45,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34373 to 33608. [2020-12-23 08:23:45,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33608 states. [2020-12-23 08:23:45,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33608 states to 33608 states and 60772 transitions. [2020-12-23 08:23:45,639 INFO L78 Accepts]: Start accepts. Automaton has 33608 states and 60772 transitions. Word has length 139 [2020-12-23 08:23:45,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:23:45,639 INFO L481 AbstractCegarLoop]: Abstraction has 33608 states and 60772 transitions. [2020-12-23 08:23:45,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:23:45,639 INFO L276 IsEmpty]: Start isEmpty. Operand 33608 states and 60772 transitions. [2020-12-23 08:23:45,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-12-23 08:23:45,648 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:23:45,649 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 08:23:45,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-12-23 08:23:45,649 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:23:45,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:23:45,649 INFO L82 PathProgramCache]: Analyzing trace with hash -830965809, now seen corresponding path program 1 times [2020-12-23 08:23:45,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:23:45,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789405804] [2020-12-23 08:23:45,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:23:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:23:45,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:23:45,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789405804] [2020-12-23 08:23:45,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:23:45,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:23:45,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123565209] [2020-12-23 08:23:45,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:23:45,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:23:45,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:23:45,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:23:45,727 INFO L87 Difference]: Start difference. First operand 33608 states and 60772 transitions. Second operand 5 states. [2020-12-23 08:23:51,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:23:51,856 INFO L93 Difference]: Finished difference Result 93503 states and 168848 transitions. [2020-12-23 08:23:51,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:23:51,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2020-12-23 08:23:51,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:23:51,931 INFO L225 Difference]: With dead ends: 93503 [2020-12-23 08:23:51,931 INFO L226 Difference]: Without dead ends: 59961 [2020-12-23 08:23:51,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 08:23:51,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59961 states. [2020-12-23 08:23:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59961 to 43696. [2020-12-23 08:23:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43696 states. [2020-12-23 08:23:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43696 states to 43696 states and 79606 transitions. [2020-12-23 08:23:55,192 INFO L78 Accepts]: Start accepts. Automaton has 43696 states and 79606 transitions. Word has length 139 [2020-12-23 08:23:55,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:23:55,193 INFO L481 AbstractCegarLoop]: Abstraction has 43696 states and 79606 transitions. [2020-12-23 08:23:55,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:23:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 43696 states and 79606 transitions. [2020-12-23 08:23:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 08:23:55,202 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:23:55,202 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 08:23:55,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-23 08:23:55,202 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:23:55,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:23:55,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1367598740, now seen corresponding path program 1 times [2020-12-23 08:23:55,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:23:55,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360320091] [2020-12-23 08:23:55,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:23:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:23:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:23:55,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360320091] [2020-12-23 08:23:55,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:23:55,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:23:55,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218389766] [2020-12-23 08:23:55,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:23:55,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:23:55,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:23:55,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:23:55,297 INFO L87 Difference]: Start difference. First operand 43696 states and 79606 transitions. Second operand 5 states. [2020-12-23 08:24:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:24:03,376 INFO L93 Difference]: Finished difference Result 126689 states and 229691 transitions. [2020-12-23 08:24:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:24:03,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2020-12-23 08:24:03,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:24:03,479 INFO L225 Difference]: With dead ends: 126689 [2020-12-23 08:24:03,480 INFO L226 Difference]: Without dead ends: 83059 [2020-12-23 08:24:03,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 08:24:03,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83059 states. [2020-12-23 08:24:07,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83059 to 50280. [2020-12-23 08:24:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50280 states. [2020-12-23 08:24:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50280 states to 50280 states and 91923 transitions. [2020-12-23 08:24:07,427 INFO L78 Accepts]: Start accepts. Automaton has 50280 states and 91923 transitions. Word has length 140 [2020-12-23 08:24:07,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:24:07,428 INFO L481 AbstractCegarLoop]: Abstraction has 50280 states and 91923 transitions. [2020-12-23 08:24:07,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:24:07,428 INFO L276 IsEmpty]: Start isEmpty. Operand 50280 states and 91923 transitions. [2020-12-23 08:24:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-12-23 08:24:07,437 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:24:07,437 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 08:24:07,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-23 08:24:07,438 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:24:07,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:24:07,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1143166836, now seen corresponding path program 1 times [2020-12-23 08:24:07,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:24:07,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574765809] [2020-12-23 08:24:07,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:24:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:24:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:24:07,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574765809] [2020-12-23 08:24:07,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:24:07,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:24:07,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543395731] [2020-12-23 08:24:07,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:24:07,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:24:07,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:24:07,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:24:07,516 INFO L87 Difference]: Start difference. First operand 50280 states and 91923 transitions. Second operand 5 states. [2020-12-23 08:24:16,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:24:16,623 INFO L93 Difference]: Finished difference Result 146257 states and 266396 transitions. [2020-12-23 08:24:16,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:24:16,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2020-12-23 08:24:16,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:24:16,766 INFO L225 Difference]: With dead ends: 146257 [2020-12-23 08:24:16,766 INFO L226 Difference]: Without dead ends: 96043 [2020-12-23 08:24:16,801 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 08:24:16,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96043 states. [2020-12-23 08:24:21,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96043 to 56872. [2020-12-23 08:24:21,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56872 states. [2020-12-23 08:24:21,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56872 states to 56872 states and 104216 transitions. [2020-12-23 08:24:21,200 INFO L78 Accepts]: Start accepts. Automaton has 56872 states and 104216 transitions. Word has length 141 [2020-12-23 08:24:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:24:21,200 INFO L481 AbstractCegarLoop]: Abstraction has 56872 states and 104216 transitions. [2020-12-23 08:24:21,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:24:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 56872 states and 104216 transitions. [2020-12-23 08:24:21,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-23 08:24:21,210 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:24:21,210 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 08:24:21,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-23 08:24:21,211 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:24:21,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:24:21,211 INFO L82 PathProgramCache]: Analyzing trace with hash -660961679, now seen corresponding path program 1 times [2020-12-23 08:24:21,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:24:21,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600393085] [2020-12-23 08:24:21,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:24:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:24:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:24:21,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600393085] [2020-12-23 08:24:21,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:24:21,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:24:21,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602938417] [2020-12-23 08:24:21,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:24:21,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:24:21,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:24:21,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:24:21,460 INFO L87 Difference]: Start difference. First operand 56872 states and 104216 transitions. Second operand 5 states. [2020-12-23 08:24:29,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:24:29,973 INFO L93 Difference]: Finished difference Result 139227 states and 253385 transitions. [2020-12-23 08:24:29,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:24:29,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2020-12-23 08:24:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:24:30,075 INFO L225 Difference]: With dead ends: 139227 [2020-12-23 08:24:30,075 INFO L226 Difference]: Without dead ends: 82421 [2020-12-23 08:24:30,108 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 08:24:30,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82421 states. [2020-12-23 08:24:33,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82421 to 40546. [2020-12-23 08:24:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40546 states. [2020-12-23 08:24:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40546 states to 40546 states and 73731 transitions. [2020-12-23 08:24:33,611 INFO L78 Accepts]: Start accepts. Automaton has 40546 states and 73731 transitions. Word has length 142 [2020-12-23 08:24:33,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:24:33,611 INFO L481 AbstractCegarLoop]: Abstraction has 40546 states and 73731 transitions. [2020-12-23 08:24:33,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:24:33,611 INFO L276 IsEmpty]: Start isEmpty. Operand 40546 states and 73731 transitions. [2020-12-23 08:24:33,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-23 08:24:33,614 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:24:33,614 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 08:24:33,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-23 08:24:33,615 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:24:33,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:24:33,615 INFO L82 PathProgramCache]: Analyzing trace with hash -733348237, now seen corresponding path program 1 times [2020-12-23 08:24:33,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:24:33,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073041903] [2020-12-23 08:24:33,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:24:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:24:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:24:33,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073041903] [2020-12-23 08:24:33,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:24:33,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:24:33,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409989504] [2020-12-23 08:24:33,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:24:33,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:24:33,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:24:33,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:24:33,711 INFO L87 Difference]: Start difference. First operand 40546 states and 73731 transitions. Second operand 4 states. [2020-12-23 08:24:38,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:24:38,779 INFO L93 Difference]: Finished difference Result 99864 states and 182165 transitions. [2020-12-23 08:24:38,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:24:38,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2020-12-23 08:24:38,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:24:38,853 INFO L225 Difference]: With dead ends: 99864 [2020-12-23 08:24:38,853 INFO L226 Difference]: Without dead ends: 59739 [2020-12-23 08:24:38,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:24:38,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59739 states. [2020-12-23 08:24:43,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59739 to 59446. [2020-12-23 08:24:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59446 states. [2020-12-23 08:24:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59446 states to 59446 states and 108070 transitions. [2020-12-23 08:24:43,646 INFO L78 Accepts]: Start accepts. Automaton has 59446 states and 108070 transitions. Word has length 142 [2020-12-23 08:24:43,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:24:43,646 INFO L481 AbstractCegarLoop]: Abstraction has 59446 states and 108070 transitions. [2020-12-23 08:24:43,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:24:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 59446 states and 108070 transitions. [2020-12-23 08:24:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-12-23 08:24:43,649 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:24:43,650 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 08:24:43,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-12-23 08:24:43,650 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:24:43,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:24:43,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1001730300, now seen corresponding path program 1 times [2020-12-23 08:24:43,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:24:43,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873206559] [2020-12-23 08:24:43,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:24:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:24:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:24:43,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873206559] [2020-12-23 08:24:43,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:24:43,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 08:24:43,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193963629] [2020-12-23 08:24:43,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:24:43,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:24:43,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:24:43,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:24:43,745 INFO L87 Difference]: Start difference. First operand 59446 states and 108070 transitions. Second operand 6 states. [2020-12-23 08:24:51,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:24:51,572 INFO L93 Difference]: Finished difference Result 168376 states and 308370 transitions. [2020-12-23 08:24:51,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 08:24:51,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2020-12-23 08:24:51,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:24:51,734 INFO L225 Difference]: With dead ends: 168376 [2020-12-23 08:24:51,734 INFO L226 Difference]: Without dead ends: 109351 [2020-12-23 08:24:51,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-23 08:24:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109351 states. [2020-12-23 08:24:56,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109351 to 57670. [2020-12-23 08:24:56,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57670 states. [2020-12-23 08:24:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57670 states to 57670 states and 105138 transitions. [2020-12-23 08:24:56,968 INFO L78 Accepts]: Start accepts. Automaton has 57670 states and 105138 transitions. Word has length 143 [2020-12-23 08:24:56,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:24:56,968 INFO L481 AbstractCegarLoop]: Abstraction has 57670 states and 105138 transitions. [2020-12-23 08:24:56,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:24:56,968 INFO L276 IsEmpty]: Start isEmpty. Operand 57670 states and 105138 transitions. [2020-12-23 08:24:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-23 08:24:56,971 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:24:56,971 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 08:24:56,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-12-23 08:24:56,972 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:24:56,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:24:56,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1724475040, now seen corresponding path program 1 times [2020-12-23 08:24:56,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:24:56,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636368258] [2020-12-23 08:24:56,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:24:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:24:57,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:24:57,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636368258] [2020-12-23 08:24:57,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:24:57,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:24:57,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344749060] [2020-12-23 08:24:57,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:24:57,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:24:57,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:24:57,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:24:57,066 INFO L87 Difference]: Start difference. First operand 57670 states and 105138 transitions. Second operand 4 states. [2020-12-23 08:25:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:03,617 INFO L93 Difference]: Finished difference Result 133536 states and 244035 transitions. [2020-12-23 08:25:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:25:03,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2020-12-23 08:25:03,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:03,721 INFO L225 Difference]: With dead ends: 133536 [2020-12-23 08:25:03,721 INFO L226 Difference]: Without dead ends: 76287 [2020-12-23 08:25:03,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:25:03,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76287 states. [2020-12-23 08:25:09,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76287 to 75962. [2020-12-23 08:25:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75962 states. [2020-12-23 08:25:10,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75962 states to 75962 states and 138925 transitions. [2020-12-23 08:25:10,043 INFO L78 Accepts]: Start accepts. Automaton has 75962 states and 138925 transitions. Word has length 144 [2020-12-23 08:25:10,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:10,043 INFO L481 AbstractCegarLoop]: Abstraction has 75962 states and 138925 transitions. [2020-12-23 08:25:10,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:25:10,043 INFO L276 IsEmpty]: Start isEmpty. Operand 75962 states and 138925 transitions. [2020-12-23 08:25:10,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-23 08:25:10,047 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:10,047 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 08:25:10,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-23 08:25:10,048 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 08:25:10,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:10,048 INFO L82 PathProgramCache]: Analyzing trace with hash 2000373724, now seen corresponding path program 1 times [2020-12-23 08:25:10,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:10,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220772231] [2020-12-23 08:25:10,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:10,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220772231] [2020-12-23 08:25:10,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:10,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 08:25:10,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637191900] [2020-12-23 08:25:10,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:25:10,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:10,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:25:10,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:25:10,143 INFO L87 Difference]: Start difference. First operand 75962 states and 138925 transitions. Second operand 6 states. [2020-12-23 08:25:28,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:28,860 INFO L93 Difference]: Finished difference Result 357788 states and 659955 transitions. [2020-12-23 08:25:28,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 08:25:28,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2020-12-23 08:25:28,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:29,613 INFO L225 Difference]: With dead ends: 357788 [2020-12-23 08:25:29,614 INFO L226 Difference]: Without dead ends: 282023 [2020-12-23 08:25:29,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-23 08:25:29,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282023 states.