/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_spec14_product03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 08:19:15,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 08:19:15,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 08:19:15,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 08:19:15,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 08:19:15,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 08:19:15,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 08:19:15,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 08:19:15,446 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 08:19:15,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 08:19:15,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 08:19:15,460 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 08:19:15,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 08:19:15,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 08:19:15,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 08:19:15,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 08:19:15,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 08:19:15,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 08:19:15,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 08:19:15,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 08:19:15,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 08:19:15,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 08:19:15,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 08:19:15,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 08:19:15,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 08:19:15,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 08:19:15,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 08:19:15,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 08:19:15,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 08:19:15,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 08:19:15,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 08:19:15,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 08:19:15,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 08:19:15,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 08:19:15,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 08:19:15,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 08:19:15,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 08:19:15,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 08:19:15,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 08:19:15,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 08:19:15,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 08:19:15,514 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:19:15,573 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 08:19:15,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 08:19:15,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 08:19:15,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 08:19:15,580 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 08:19:15,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 08:19:15,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 08:19:15,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 08:19:15,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 08:19:15,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 08:19:15,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 08:19:15,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 08:19:15,583 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 08:19:15,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 08:19:15,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 08:19:15,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 08:19:15,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 08:19:15,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 08:19:15,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 08:19:15,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 08:19:15,586 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 08:19:15,587 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 08:19:15,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 08:19:15,587 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 08:19:15,587 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 08:19:15,587 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:19:15,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 08:19:15,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 08:19:16,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 08:19:16,002 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 08:19:16,007 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 08:19:16,008 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec14_product03.cil.c [2020-12-23 08:19:16,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cee5f57e4/1ec9932beb9a4c7fba9fc97e5c5bd91e/FLAGf92770829 [2020-12-23 08:19:16,890 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 08:19:16,891 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product03.cil.c [2020-12-23 08:19:16,937 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cee5f57e4/1ec9932beb9a4c7fba9fc97e5c5bd91e/FLAGf92770829 [2020-12-23 08:19:17,037 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cee5f57e4/1ec9932beb9a4c7fba9fc97e5c5bd91e [2020-12-23 08:19:17,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 08:19:17,052 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 08:19:17,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 08:19:17,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 08:19:17,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 08:19:17,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 08:19:17" (1/1) ... [2020-12-23 08:19:17,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@190b378f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:19:17, skipping insertion in model container [2020-12-23 08:19:17,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 08:19:17" (1/1) ... [2020-12-23 08:19:17,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 08:19:17,167 INFO L178 MainTranslator]: Built tables and reachable declarations 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[~retValue_acc~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[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] 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~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] 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[~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~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] 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~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~nd~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] 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~4,] left hand side expression in assignment: lhs: VariableLHS[~action~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~origin~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~excep~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] 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~13,] 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~14,] 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~8,] 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~8,] left hand side expression in assignment: lhs: VariableLHS[~mem_24~0,] 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[~__cil_tmp4~1,] 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~9,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~2,] 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~10,] 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[~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~13,] 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[~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~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] 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[~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[~retValue_acc~17,] 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[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] 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[~tmp___2~2,] 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[~tmp___1~4,] 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[~tmp___0~5,] 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[~tmp~15,] 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[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] 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___3~1,] 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___2~3,] 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___1~5,] 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~6,] 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[~retValue_acc~21,] 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[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] 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___8~0,] 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___7~0,] 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___6~0,] 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___5~0,] 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[~retValue_acc~21,] 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~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] 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[~retValue_acc~22,] 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[~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~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] 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[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] 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~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] 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~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] 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~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] 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~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~6,] 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~24,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] 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~4,] 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~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] 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~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] 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~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~29,] [2020-12-23 08:19:17,927 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_spec14_product03.cil.c[68634,68647] [2020-12-23 08:19:17,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 08:19:17,957 INFO L203 MainTranslator]: Completed pre-run 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[~retValue_acc~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[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] 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~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] 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[~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~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] 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~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~nd~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] 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~4,] left hand side expression in assignment: lhs: VariableLHS[~action~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~origin~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~excep~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] 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~13,] 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~14,] 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~8,] 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~8,] left hand side expression in assignment: lhs: VariableLHS[~mem_24~0,] 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[~__cil_tmp4~1,] 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~9,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~2,] 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~10,] 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[~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~13,] 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[~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~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] 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[~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[~retValue_acc~17,] 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[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] 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[~tmp___2~2,] 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[~tmp___1~4,] 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[~tmp___0~5,] 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[~tmp~15,] 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[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] 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___3~1,] 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___2~3,] 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___1~5,] 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~6,] 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[~retValue_acc~21,] 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[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] 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___8~0,] 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___7~0,] 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___6~0,] 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___5~0,] 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[~retValue_acc~21,] 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~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] 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[~retValue_acc~22,] 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[~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~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] 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[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] 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~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] 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~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] 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~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] 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~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~6,] 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~24,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] 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~4,] 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~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] 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~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] 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~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~29,] [2020-12-23 08:19:18,194 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_spec14_product03.cil.c[68634,68647] [2020-12-23 08:19:18,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 08:19:18,278 INFO L208 MainTranslator]: Completed translation [2020-12-23 08:19:18,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:19:18 WrapperNode [2020-12-23 08:19:18,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 08:19:18,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 08:19:18,280 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 08:19:18,280 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 08:19:18,289 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:19:18" (1/1) ... [2020-12-23 08:19:18,322 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:19:18" (1/1) ... [2020-12-23 08:19:18,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 08:19:18,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 08:19:18,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 08:19:18,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 08:19:18,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:19:18" (1/1) ... [2020-12-23 08:19:18,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:19:18" (1/1) ... [2020-12-23 08:19:18,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:19:18" (1/1) ... [2020-12-23 08:19:18,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:19:18" (1/1) ... [2020-12-23 08:19:19,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:19:18" (1/1) ... [2020-12-23 08:19:19,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:19:18" (1/1) ... [2020-12-23 08:19:19,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:19:18" (1/1) ... [2020-12-23 08:19:19,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 08:19:19,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 08:19:19,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 08:19:19,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 08:19:19,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:19:18" (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:19:19,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 08:19:19,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 08:19:19,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 08:19:19,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 08:19:30,126 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 08:19:30,127 INFO L299 CfgBuilder]: Removed 1143 assume(true) statements. [2020-12-23 08:19:30,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 08:19:30 BoogieIcfgContainer [2020-12-23 08:19:30,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 08:19:30,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 08:19:30,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 08:19:30,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 08:19:30,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 08:19:17" (1/3) ... [2020-12-23 08:19:30,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d879cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 08:19:30, skipping insertion in model container [2020-12-23 08:19:30,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:19:18" (2/3) ... [2020-12-23 08:19:30,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d879cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 08:19:30, skipping insertion in model container [2020-12-23 08:19:30,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 08:19:30" (3/3) ... [2020-12-23 08:19:30,145 INFO L111 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product03.cil.c [2020-12-23 08:19:30,152 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 08:19:30,160 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-12-23 08:19:30,181 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-23 08:19:30,232 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 08:19:30,232 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 08:19:30,232 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 08:19:30,232 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 08:19:30,232 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 08:19:30,233 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 08:19:30,233 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 08:19:30,233 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 08:19:30,327 INFO L276 IsEmpty]: Start isEmpty. Operand 5427 states. [2020-12-23 08:19:30,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 08:19:30,348 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:19:30,349 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] [2020-12-23 08:19:30,350 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:19:30,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:19:30,357 INFO L82 PathProgramCache]: Analyzing trace with hash 770856702, now seen corresponding path program 1 times [2020-12-23 08:19:30,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:19:30,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70349383] [2020-12-23 08:19:30,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:19:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:19:30,791 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:19:30,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70349383] [2020-12-23 08:19:30,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:19:30,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:19:30,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614198142] [2020-12-23 08:19:30,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:19:30,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:19:30,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:19:30,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:19:30,830 INFO L87 Difference]: Start difference. First operand 5427 states. Second operand 3 states. [2020-12-23 08:19:31,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:19:31,383 INFO L93 Difference]: Finished difference Result 13046 states and 24746 transitions. [2020-12-23 08:19:31,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:19:31,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-12-23 08:19:31,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:19:31,482 INFO L225 Difference]: With dead ends: 13046 [2020-12-23 08:19:31,482 INFO L226 Difference]: Without dead ends: 7623 [2020-12-23 08:19:31,505 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:19:31,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7623 states. [2020-12-23 08:19:31,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7623 to 5423. [2020-12-23 08:19:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5423 states. [2020-12-23 08:19:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5423 states to 5423 states and 10274 transitions. [2020-12-23 08:19:31,796 INFO L78 Accepts]: Start accepts. Automaton has 5423 states and 10274 transitions. Word has length 44 [2020-12-23 08:19:31,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:19:31,797 INFO L481 AbstractCegarLoop]: Abstraction has 5423 states and 10274 transitions. [2020-12-23 08:19:31,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:19:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 5423 states and 10274 transitions. [2020-12-23 08:19:31,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-23 08:19:31,801 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:19:31,801 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] [2020-12-23 08:19:31,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 08:19:31,802 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:19:31,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:19:31,803 INFO L82 PathProgramCache]: Analyzing trace with hash 190982898, now seen corresponding path program 1 times [2020-12-23 08:19:31,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:19:31,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137013128] [2020-12-23 08:19:31,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:19:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:19:31,978 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:19:31,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137013128] [2020-12-23 08:19:31,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:19:31,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 08:19:31,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251318939] [2020-12-23 08:19:31,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:19:31,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:19:31,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:19:31,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:19:31,985 INFO L87 Difference]: Start difference. First operand 5423 states and 10274 transitions. Second operand 6 states. [2020-12-23 08:19:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:19:32,822 INFO L93 Difference]: Finished difference Result 15156 states and 28716 transitions. [2020-12-23 08:19:32,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 08:19:32,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-12-23 08:19:32,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:19:32,882 INFO L225 Difference]: With dead ends: 15156 [2020-12-23 08:19:32,883 INFO L226 Difference]: Without dead ends: 9775 [2020-12-23 08:19:32,895 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-23 08:19:32,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9775 states. [2020-12-23 08:19:33,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9775 to 5419. [2020-12-23 08:19:33,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5419 states. [2020-12-23 08:19:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5419 states to 5419 states and 10263 transitions. [2020-12-23 08:19:33,152 INFO L78 Accepts]: Start accepts. Automaton has 5419 states and 10263 transitions. Word has length 49 [2020-12-23 08:19:33,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:19:33,152 INFO L481 AbstractCegarLoop]: Abstraction has 5419 states and 10263 transitions. [2020-12-23 08:19:33,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:19:33,152 INFO L276 IsEmpty]: Start isEmpty. Operand 5419 states and 10263 transitions. [2020-12-23 08:19:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-23 08:19:33,156 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:19:33,158 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] [2020-12-23 08:19:33,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 08:19:33,158 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:19:33,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:19:33,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1439760622, now seen corresponding path program 1 times [2020-12-23 08:19:33,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:19:33,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883255547] [2020-12-23 08:19:33,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:19:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:19:33,256 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:19:33,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883255547] [2020-12-23 08:19:33,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:19:33,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:19:33,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364387778] [2020-12-23 08:19:33,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:19:33,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:19:33,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:19:33,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:19:33,259 INFO L87 Difference]: Start difference. First operand 5419 states and 10263 transitions. Second operand 4 states. [2020-12-23 08:19:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:19:34,132 INFO L93 Difference]: Finished difference Result 17318 states and 32802 transitions. [2020-12-23 08:19:34,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:19:34,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-12-23 08:19:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:19:34,208 INFO L225 Difference]: With dead ends: 17318 [2020-12-23 08:19:34,208 INFO L226 Difference]: Without dead ends: 11941 [2020-12-23 08:19:34,222 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:19:34,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11941 states. [2020-12-23 08:19:34,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11941 to 5419. [2020-12-23 08:19:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5419 states. [2020-12-23 08:19:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5419 states to 5419 states and 10259 transitions. [2020-12-23 08:19:34,490 INFO L78 Accepts]: Start accepts. Automaton has 5419 states and 10259 transitions. Word has length 50 [2020-12-23 08:19:34,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:19:34,496 INFO L481 AbstractCegarLoop]: Abstraction has 5419 states and 10259 transitions. [2020-12-23 08:19:34,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:19:34,496 INFO L276 IsEmpty]: Start isEmpty. Operand 5419 states and 10259 transitions. [2020-12-23 08:19:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-23 08:19:34,501 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:19:34,501 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] [2020-12-23 08:19:34,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 08:19:34,501 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:19:34,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:19:34,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1257133717, now seen corresponding path program 1 times [2020-12-23 08:19:34,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:19:34,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468293283] [2020-12-23 08:19:34,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:19:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:19:34,643 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:19:34,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468293283] [2020-12-23 08:19:34,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:19:34,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:19:34,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526998795] [2020-12-23 08:19:34,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:19:34,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:19:34,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:19:34,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:19:34,647 INFO L87 Difference]: Start difference. First operand 5419 states and 10259 transitions. Second operand 4 states. [2020-12-23 08:19:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:19:35,194 INFO L93 Difference]: Finished difference Result 12990 states and 24606 transitions. [2020-12-23 08:19:35,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:19:35,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-12-23 08:19:35,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:19:35,220 INFO L225 Difference]: With dead ends: 12990 [2020-12-23 08:19:35,220 INFO L226 Difference]: Without dead ends: 7613 [2020-12-23 08:19:35,235 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:19:35,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7613 states. [2020-12-23 08:19:35,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7613 to 5419. [2020-12-23 08:19:35,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5419 states. [2020-12-23 08:19:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5419 states to 5419 states and 10250 transitions. [2020-12-23 08:19:35,466 INFO L78 Accepts]: Start accepts. Automaton has 5419 states and 10250 transitions. Word has length 51 [2020-12-23 08:19:35,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:19:35,466 INFO L481 AbstractCegarLoop]: Abstraction has 5419 states and 10250 transitions. [2020-12-23 08:19:35,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:19:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 5419 states and 10250 transitions. [2020-12-23 08:19:35,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 08:19:35,469 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:19:35,469 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] [2020-12-23 08:19:35,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 08:19:35,469 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:19:35,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:19:35,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1001017801, now seen corresponding path program 1 times [2020-12-23 08:19:35,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:19:35,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455452659] [2020-12-23 08:19:35,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:19:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:19:35,590 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:19:35,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455452659] [2020-12-23 08:19:35,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:19:35,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:19:35,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555545471] [2020-12-23 08:19:35,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:19:35,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:19:35,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:19:35,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:19:35,594 INFO L87 Difference]: Start difference. First operand 5419 states and 10250 transitions. Second operand 4 states. [2020-12-23 08:19:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:19:36,268 INFO L93 Difference]: Finished difference Result 12990 states and 24588 transitions. [2020-12-23 08:19:36,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:19:36,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-12-23 08:19:36,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:19:36,289 INFO L225 Difference]: With dead ends: 12990 [2020-12-23 08:19:36,289 INFO L226 Difference]: Without dead ends: 7613 [2020-12-23 08:19:36,298 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:19:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7613 states. [2020-12-23 08:19:36,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7613 to 5419. [2020-12-23 08:19:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5419 states. [2020-12-23 08:19:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5419 states to 5419 states and 10241 transitions. [2020-12-23 08:19:36,501 INFO L78 Accepts]: Start accepts. Automaton has 5419 states and 10241 transitions. Word has length 52 [2020-12-23 08:19:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:19:36,502 INFO L481 AbstractCegarLoop]: Abstraction has 5419 states and 10241 transitions. [2020-12-23 08:19:36,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:19:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 5419 states and 10241 transitions. [2020-12-23 08:19:36,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 08:19:36,506 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:19:36,506 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] [2020-12-23 08:19:36,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 08:19:36,507 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:19:36,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:19:36,507 INFO L82 PathProgramCache]: Analyzing trace with hash -909735241, now seen corresponding path program 1 times [2020-12-23 08:19:36,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:19:36,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918508916] [2020-12-23 08:19:36,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:19:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:19:36,615 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:19:36,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918508916] [2020-12-23 08:19:36,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:19:36,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:19:36,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57359654] [2020-12-23 08:19:36,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:19:36,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:19:36,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:19:36,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:19:36,619 INFO L87 Difference]: Start difference. First operand 5419 states and 10241 transitions. Second operand 4 states. [2020-12-23 08:19:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:19:37,082 INFO L93 Difference]: Finished difference Result 15133 states and 28630 transitions. [2020-12-23 08:19:37,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:19:37,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-12-23 08:19:37,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:19:37,109 INFO L225 Difference]: With dead ends: 15133 [2020-12-23 08:19:37,110 INFO L226 Difference]: Without dead ends: 9735 [2020-12-23 08:19:37,122 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:19:37,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9735 states. [2020-12-23 08:19:37,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9735 to 5401. [2020-12-23 08:19:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5401 states. [2020-12-23 08:19:37,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 10210 transitions. [2020-12-23 08:19:37,346 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 10210 transitions. Word has length 52 [2020-12-23 08:19:37,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:19:37,346 INFO L481 AbstractCegarLoop]: Abstraction has 5401 states and 10210 transitions. [2020-12-23 08:19:37,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:19:37,347 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 10210 transitions. [2020-12-23 08:19:37,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-23 08:19:37,349 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:19:37,349 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] [2020-12-23 08:19:37,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 08:19:37,351 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:19:37,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:19:37,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2048199066, now seen corresponding path program 1 times [2020-12-23 08:19:37,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:19:37,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879916402] [2020-12-23 08:19:37,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:19:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:19:37,428 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:19:37,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879916402] [2020-12-23 08:19:37,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:19:37,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:19:37,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146866228] [2020-12-23 08:19:37,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:19:37,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:19:37,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:19:37,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:19:37,432 INFO L87 Difference]: Start difference. First operand 5401 states and 10210 transitions. Second operand 4 states. [2020-12-23 08:19:37,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:19:37,890 INFO L93 Difference]: Finished difference Result 12954 states and 24505 transitions. [2020-12-23 08:19:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:19:37,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-12-23 08:19:37,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:19:37,912 INFO L225 Difference]: With dead ends: 12954 [2020-12-23 08:19:37,912 INFO L226 Difference]: Without dead ends: 7574 [2020-12-23 08:19:37,925 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:19:37,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7574 states. [2020-12-23 08:19:38,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7574 to 5401. [2020-12-23 08:19:38,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5401 states. [2020-12-23 08:19:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 10204 transitions. [2020-12-23 08:19:38,135 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 10204 transitions. Word has length 53 [2020-12-23 08:19:38,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:19:38,135 INFO L481 AbstractCegarLoop]: Abstraction has 5401 states and 10204 transitions. [2020-12-23 08:19:38,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:19:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 10204 transitions. [2020-12-23 08:19:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-23 08:19:38,137 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:19:38,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:19:38,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 08:19:38,138 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:19:38,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:19:38,138 INFO L82 PathProgramCache]: Analyzing trace with hash 2122111324, now seen corresponding path program 1 times [2020-12-23 08:19:38,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:19:38,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755289390] [2020-12-23 08:19:38,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:19:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:19:38,197 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:19:38,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755289390] [2020-12-23 08:19:38,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:19:38,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:19:38,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972600561] [2020-12-23 08:19:38,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:19:38,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:19:38,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:19:38,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:19:38,199 INFO L87 Difference]: Start difference. First operand 5401 states and 10204 transitions. Second operand 4 states. [2020-12-23 08:19:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:19:38,784 INFO L93 Difference]: Finished difference Result 12954 states and 24493 transitions. [2020-12-23 08:19:38,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:19:38,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-12-23 08:19:38,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:19:38,806 INFO L225 Difference]: With dead ends: 12954 [2020-12-23 08:19:38,806 INFO L226 Difference]: Without dead ends: 7574 [2020-12-23 08:19:38,816 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:19:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7574 states. [2020-12-23 08:19:39,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7574 to 5401. [2020-12-23 08:19:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5401 states. [2020-12-23 08:19:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 10198 transitions. [2020-12-23 08:19:39,059 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 10198 transitions. Word has length 54 [2020-12-23 08:19:39,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:19:39,059 INFO L481 AbstractCegarLoop]: Abstraction has 5401 states and 10198 transitions. [2020-12-23 08:19:39,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:19:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 10198 transitions. [2020-12-23 08:19:39,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-23 08:19:39,062 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:19:39,062 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:19:39,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 08:19:39,063 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:19:39,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:19:39,063 INFO L82 PathProgramCache]: Analyzing trace with hash -688111583, now seen corresponding path program 1 times [2020-12-23 08:19:39,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:19:39,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040639131] [2020-12-23 08:19:39,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:19:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:19:39,122 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:19:39,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040639131] [2020-12-23 08:19:39,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:19:39,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:19:39,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378843392] [2020-12-23 08:19:39,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:19:39,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:19:39,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:19:39,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:19:39,125 INFO L87 Difference]: Start difference. First operand 5401 states and 10198 transitions. Second operand 3 states. [2020-12-23 08:19:39,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:19:39,542 INFO L93 Difference]: Finished difference Result 12945 states and 24470 transitions. [2020-12-23 08:19:39,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:19:39,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-12-23 08:19:39,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:19:39,567 INFO L225 Difference]: With dead ends: 12945 [2020-12-23 08:19:39,567 INFO L226 Difference]: Without dead ends: 7565 [2020-12-23 08:19:39,577 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:19:39,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7565 states. [2020-12-23 08:19:39,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7565 to 5401. [2020-12-23 08:19:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5401 states. [2020-12-23 08:19:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 10197 transitions. [2020-12-23 08:19:39,836 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 10197 transitions. Word has length 55 [2020-12-23 08:19:39,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:19:39,836 INFO L481 AbstractCegarLoop]: Abstraction has 5401 states and 10197 transitions. [2020-12-23 08:19:39,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:19:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 10197 transitions. [2020-12-23 08:19:39,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-23 08:19:39,839 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:19:39,839 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:19:39,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 08:19:39,840 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:19:39,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:19:39,840 INFO L82 PathProgramCache]: Analyzing trace with hash 155893919, now seen corresponding path program 1 times [2020-12-23 08:19:39,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:19:39,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991459154] [2020-12-23 08:19:39,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:19:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:19:39,957 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:19:39,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991459154] [2020-12-23 08:19:39,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:19:39,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 08:19:39,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899368605] [2020-12-23 08:19:39,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 08:19:39,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:19:39,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 08:19:39,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 08:19:39,960 INFO L87 Difference]: Start difference. First operand 5401 states and 10197 transitions. Second operand 7 states. [2020-12-23 08:19:41,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:19:41,025 INFO L93 Difference]: Finished difference Result 17289 states and 32679 transitions. [2020-12-23 08:19:41,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:19:41,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2020-12-23 08:19:41,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:19:41,062 INFO L225 Difference]: With dead ends: 17289 [2020-12-23 08:19:41,062 INFO L226 Difference]: Without dead ends: 11915 [2020-12-23 08:19:41,074 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2020-12-23 08:19:41,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11915 states. [2020-12-23 08:19:41,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11915 to 5403. [2020-12-23 08:19:41,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5403 states. [2020-12-23 08:19:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5403 states to 5403 states and 10198 transitions. [2020-12-23 08:19:41,380 INFO L78 Accepts]: Start accepts. Automaton has 5403 states and 10198 transitions. Word has length 55 [2020-12-23 08:19:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:19:41,380 INFO L481 AbstractCegarLoop]: Abstraction has 5403 states and 10198 transitions. [2020-12-23 08:19:41,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 08:19:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 5403 states and 10198 transitions. [2020-12-23 08:19:41,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-23 08:19:41,383 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:19:41,383 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] [2020-12-23 08:19:41,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 08:19:41,383 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:19:41,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:19:41,384 INFO L82 PathProgramCache]: Analyzing trace with hash -907086511, now seen corresponding path program 1 times [2020-12-23 08:19:41,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:19:41,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680413726] [2020-12-23 08:19:41,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:19:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:19:41,496 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:19:41,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680413726] [2020-12-23 08:19:41,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:19:41,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:19:41,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812647264] [2020-12-23 08:19:41,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:19:41,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:19:41,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:19:41,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:19:41,499 INFO L87 Difference]: Start difference. First operand 5403 states and 10198 transitions. Second operand 4 states. [2020-12-23 08:19:44,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:19:44,111 INFO L93 Difference]: Finished difference Result 14893 states and 28284 transitions. [2020-12-23 08:19:44,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:19:44,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2020-12-23 08:19:44,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:19:44,135 INFO L225 Difference]: With dead ends: 14893 [2020-12-23 08:19:44,135 INFO L226 Difference]: Without dead ends: 9523 [2020-12-23 08:19:44,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:19:44,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9523 states. [2020-12-23 08:19:44,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9523 to 5403. [2020-12-23 08:19:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5403 states. [2020-12-23 08:19:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5403 states to 5403 states and 10178 transitions. [2020-12-23 08:19:44,379 INFO L78 Accepts]: Start accepts. Automaton has 5403 states and 10178 transitions. Word has length 56 [2020-12-23 08:19:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:19:44,379 INFO L481 AbstractCegarLoop]: Abstraction has 5403 states and 10178 transitions. [2020-12-23 08:19:44,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:19:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 5403 states and 10178 transitions. [2020-12-23 08:19:44,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 08:19:44,382 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:19:44,382 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:19:44,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 08:19:44,386 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:19:44,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:19:44,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2054879961, now seen corresponding path program 1 times [2020-12-23 08:19:44,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:19:44,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926724742] [2020-12-23 08:19:44,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:19:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:19:44,469 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:19:44,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926724742] [2020-12-23 08:19:44,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:19:44,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:19:44,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155597808] [2020-12-23 08:19:44,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:19:44,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:19:44,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:19:44,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:19:44,471 INFO L87 Difference]: Start difference. First operand 5403 states and 10178 transitions. Second operand 4 states. [2020-12-23 08:19:46,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:19:46,979 INFO L93 Difference]: Finished difference Result 14893 states and 28245 transitions. [2020-12-23 08:19:46,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:19:46,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-23 08:19:46,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:19:46,999 INFO L225 Difference]: With dead ends: 14893 [2020-12-23 08:19:46,999 INFO L226 Difference]: Without dead ends: 9523 [2020-12-23 08:19:47,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:19:47,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9523 states. [2020-12-23 08:19:47,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9523 to 5403. [2020-12-23 08:19:47,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5403 states. [2020-12-23 08:19:47,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5403 states to 5403 states and 10158 transitions. [2020-12-23 08:19:47,256 INFO L78 Accepts]: Start accepts. Automaton has 5403 states and 10158 transitions. Word has length 59 [2020-12-23 08:19:47,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:19:47,256 INFO L481 AbstractCegarLoop]: Abstraction has 5403 states and 10158 transitions. [2020-12-23 08:19:47,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:19:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand 5403 states and 10158 transitions. [2020-12-23 08:19:47,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 08:19:47,259 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:19:47,259 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:19:47,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 08:19:47,259 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:19:47,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:19:47,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1459234742, now seen corresponding path program 1 times [2020-12-23 08:19:47,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:19:47,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643583599] [2020-12-23 08:19:47,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:19:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:19:47,375 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:19:47,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643583599] [2020-12-23 08:19:47,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:19:47,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:19:47,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820919530] [2020-12-23 08:19:47,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:19:47,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:19:47,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:19:47,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:19:47,378 INFO L87 Difference]: Start difference. First operand 5403 states and 10158 transitions. Second operand 4 states. [2020-12-23 08:19:50,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:19:50,026 INFO L93 Difference]: Finished difference Result 14893 states and 28206 transitions. [2020-12-23 08:19:50,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:19:50,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-12-23 08:19:50,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:19:50,039 INFO L225 Difference]: With dead ends: 14893 [2020-12-23 08:19:50,039 INFO L226 Difference]: Without dead ends: 9523 [2020-12-23 08:19:50,047 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:19:50,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9523 states. [2020-12-23 08:19:50,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9523 to 5403. [2020-12-23 08:19:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5403 states. [2020-12-23 08:19:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5403 states to 5403 states and 10138 transitions. [2020-12-23 08:19:50,305 INFO L78 Accepts]: Start accepts. Automaton has 5403 states and 10138 transitions. Word has length 62 [2020-12-23 08:19:50,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:19:50,305 INFO L481 AbstractCegarLoop]: Abstraction has 5403 states and 10138 transitions. [2020-12-23 08:19:50,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:19:50,306 INFO L276 IsEmpty]: Start isEmpty. Operand 5403 states and 10138 transitions. [2020-12-23 08:19:50,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-23 08:19:50,308 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:19:50,308 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:19:50,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 08:19:50,309 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:19:50,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:19:50,309 INFO L82 PathProgramCache]: Analyzing trace with hash -746834622, now seen corresponding path program 1 times [2020-12-23 08:19:50,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:19:50,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258581001] [2020-12-23 08:19:50,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:19:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:19:50,392 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:19:50,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258581001] [2020-12-23 08:19:50,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:19:50,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:19:50,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447039559] [2020-12-23 08:19:50,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:19:50,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:19:50,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:19:50,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:19:50,394 INFO L87 Difference]: Start difference. First operand 5403 states and 10138 transitions. Second operand 4 states. [2020-12-23 08:19:52,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:19:52,938 INFO L93 Difference]: Finished difference Result 14893 states and 28167 transitions. [2020-12-23 08:19:52,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:19:52,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-12-23 08:19:52,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:19:52,952 INFO L225 Difference]: With dead ends: 14893 [2020-12-23 08:19:52,952 INFO L226 Difference]: Without dead ends: 9523 [2020-12-23 08:19:52,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:19:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9523 states. [2020-12-23 08:19:53,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9523 to 5403. [2020-12-23 08:19:53,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5403 states. [2020-12-23 08:19:53,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5403 states to 5403 states and 10118 transitions. [2020-12-23 08:19:53,210 INFO L78 Accepts]: Start accepts. Automaton has 5403 states and 10118 transitions. Word has length 65 [2020-12-23 08:19:53,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:19:53,210 INFO L481 AbstractCegarLoop]: Abstraction has 5403 states and 10118 transitions. [2020-12-23 08:19:53,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:19:53,210 INFO L276 IsEmpty]: Start isEmpty. Operand 5403 states and 10118 transitions. [2020-12-23 08:19:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-23 08:19:53,213 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:19:53,213 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] [2020-12-23 08:19:53,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 08:19:53,213 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:19:53,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:19:53,214 INFO L82 PathProgramCache]: Analyzing trace with hash -17617253, now seen corresponding path program 1 times [2020-12-23 08:19:53,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:19:53,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338224439] [2020-12-23 08:19:53,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:19:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:19:53,288 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:19:53,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338224439] [2020-12-23 08:19:53,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:19:53,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:19:53,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237365952] [2020-12-23 08:19:53,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:19:53,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:19:53,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:19:53,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:19:53,290 INFO L87 Difference]: Start difference. First operand 5403 states and 10118 transitions. Second operand 6 states. [2020-12-23 08:20:03,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:20:03,027 INFO L93 Difference]: Finished difference Result 57204 states and 108151 transitions. [2020-12-23 08:20:03,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 08:20:03,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2020-12-23 08:20:03,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:20:03,106 INFO L225 Difference]: With dead ends: 57204 [2020-12-23 08:20:03,106 INFO L226 Difference]: Without dead ends: 51852 [2020-12-23 08:20:03,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2020-12-23 08:20:03,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51852 states. [2020-12-23 08:20:03,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51852 to 10699. [2020-12-23 08:20:03,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10699 states. [2020-12-23 08:20:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10699 states to 10699 states and 20060 transitions. [2020-12-23 08:20:03,985 INFO L78 Accepts]: Start accepts. Automaton has 10699 states and 20060 transitions. Word has length 68 [2020-12-23 08:20:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:20:03,986 INFO L481 AbstractCegarLoop]: Abstraction has 10699 states and 20060 transitions. [2020-12-23 08:20:03,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:20:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 10699 states and 20060 transitions. [2020-12-23 08:20:03,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-23 08:20:03,990 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:20:03,990 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:20:03,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 08:20:03,990 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:20:03,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:20:03,991 INFO L82 PathProgramCache]: Analyzing trace with hash 712103995, now seen corresponding path program 1 times [2020-12-23 08:20:03,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:20:03,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279137761] [2020-12-23 08:20:03,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:20:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:20:04,057 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:20:04,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279137761] [2020-12-23 08:20:04,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:20:04,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:20:04,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131028578] [2020-12-23 08:20:04,058 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:20:04,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:20:04,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:20:04,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:20:04,059 INFO L87 Difference]: Start difference. First operand 10699 states and 20060 transitions. Second operand 5 states. [2020-12-23 08:20:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:20:10,667 INFO L93 Difference]: Finished difference Result 56158 states and 105054 transitions. [2020-12-23 08:20:10,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:20:10,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2020-12-23 08:20:10,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:20:10,723 INFO L225 Difference]: With dead ends: 56158 [2020-12-23 08:20:10,724 INFO L226 Difference]: Without dead ends: 45551 [2020-12-23 08:20:10,737 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:20:10,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45551 states. [2020-12-23 08:20:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45551 to 15021. [2020-12-23 08:20:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15021 states. [2020-12-23 08:20:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15021 states to 15021 states and 28148 transitions. [2020-12-23 08:20:11,418 INFO L78 Accepts]: Start accepts. Automaton has 15021 states and 28148 transitions. Word has length 70 [2020-12-23 08:20:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:20:11,419 INFO L481 AbstractCegarLoop]: Abstraction has 15021 states and 28148 transitions. [2020-12-23 08:20:11,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:20:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 15021 states and 28148 transitions. [2020-12-23 08:20:11,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-23 08:20:11,423 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:20:11,423 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:20:11,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 08:20:11,424 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:20:11,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:20:11,424 INFO L82 PathProgramCache]: Analyzing trace with hash 372239342, now seen corresponding path program 1 times [2020-12-23 08:20:11,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:20:11,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037037829] [2020-12-23 08:20:11,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:20:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:20:11,483 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:20:11,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037037829] [2020-12-23 08:20:11,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:20:11,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:20:11,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214406315] [2020-12-23 08:20:11,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:20:11,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:20:11,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:20:11,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:20:11,485 INFO L87 Difference]: Start difference. First operand 15021 states and 28148 transitions. Second operand 4 states. [2020-12-23 08:20:18,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:20:18,039 INFO L93 Difference]: Finished difference Result 60937 states and 114724 transitions. [2020-12-23 08:20:18,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:20:18,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2020-12-23 08:20:18,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:20:18,093 INFO L225 Difference]: With dead ends: 60937 [2020-12-23 08:20:18,094 INFO L226 Difference]: Without dead ends: 45969 [2020-12-23 08:20:18,111 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:20:18,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45969 states. [2020-12-23 08:20:19,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45969 to 25519. [2020-12-23 08:20:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25519 states. [2020-12-23 08:20:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25519 states to 25519 states and 47320 transitions. [2020-12-23 08:20:19,268 INFO L78 Accepts]: Start accepts. Automaton has 25519 states and 47320 transitions. Word has length 71 [2020-12-23 08:20:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:20:19,268 INFO L481 AbstractCegarLoop]: Abstraction has 25519 states and 47320 transitions. [2020-12-23 08:20:19,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:20:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 25519 states and 47320 transitions. [2020-12-23 08:20:19,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-23 08:20:19,271 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:20:19,271 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:20:19,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 08:20:19,272 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:20:19,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:20:19,272 INFO L82 PathProgramCache]: Analyzing trace with hash -728367501, now seen corresponding path program 1 times [2020-12-23 08:20:19,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:20:19,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561285968] [2020-12-23 08:20:19,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:20:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:20:19,337 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:20:19,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561285968] [2020-12-23 08:20:19,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:20:19,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:20:19,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775761852] [2020-12-23 08:20:19,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:20:19,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:20:19,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:20:19,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:20:19,339 INFO L87 Difference]: Start difference. First operand 25519 states and 47320 transitions. Second operand 5 states. [2020-12-23 08:20:21,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:20:21,063 INFO L93 Difference]: Finished difference Result 53852 states and 99956 transitions. [2020-12-23 08:20:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 08:20:21,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2020-12-23 08:20:21,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:20:21,164 INFO L225 Difference]: With dead ends: 53852 [2020-12-23 08:20:21,164 INFO L226 Difference]: Without dead ends: 28357 [2020-12-23 08:20:21,185 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:20:21,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28357 states. [2020-12-23 08:20:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28357 to 16633. [2020-12-23 08:20:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16633 states. [2020-12-23 08:20:21,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16633 states to 16633 states and 30860 transitions. [2020-12-23 08:20:21,874 INFO L78 Accepts]: Start accepts. Automaton has 16633 states and 30860 transitions. Word has length 71 [2020-12-23 08:20:21,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:20:21,874 INFO L481 AbstractCegarLoop]: Abstraction has 16633 states and 30860 transitions. [2020-12-23 08:20:21,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:20:21,875 INFO L276 IsEmpty]: Start isEmpty. Operand 16633 states and 30860 transitions. [2020-12-23 08:20:21,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-23 08:20:21,876 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:20:21,876 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:20:21,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 08:20:21,877 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:20:21,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:20:21,877 INFO L82 PathProgramCache]: Analyzing trace with hash 341611366, now seen corresponding path program 1 times [2020-12-23 08:20:21,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:20:21,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909484243] [2020-12-23 08:20:21,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:20:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:20:21,961 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:20:21,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909484243] [2020-12-23 08:20:21,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:20:21,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:20:21,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40943992] [2020-12-23 08:20:21,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:20:21,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:20:21,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:20:21,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:20:21,964 INFO L87 Difference]: Start difference. First operand 16633 states and 30860 transitions. Second operand 5 states. [2020-12-23 08:20:27,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:20:27,351 INFO L93 Difference]: Finished difference Result 135002 states and 250927 transitions. [2020-12-23 08:20:27,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:20:27,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2020-12-23 08:20:27,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:20:27,556 INFO L225 Difference]: With dead ends: 135002 [2020-12-23 08:20:27,557 INFO L226 Difference]: Without dead ends: 118412 [2020-12-23 08:20:27,598 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:20:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118412 states. [2020-12-23 08:20:29,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118412 to 32269. [2020-12-23 08:20:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32269 states. [2020-12-23 08:20:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32269 states to 32269 states and 59839 transitions. [2020-12-23 08:20:29,739 INFO L78 Accepts]: Start accepts. Automaton has 32269 states and 59839 transitions. Word has length 73 [2020-12-23 08:20:29,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:20:29,739 INFO L481 AbstractCegarLoop]: Abstraction has 32269 states and 59839 transitions. [2020-12-23 08:20:29,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:20:29,739 INFO L276 IsEmpty]: Start isEmpty. Operand 32269 states and 59839 transitions. [2020-12-23 08:20:29,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-23 08:20:29,742 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:20:29,742 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:20:29,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 08:20:29,742 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:20:29,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:20:29,743 INFO L82 PathProgramCache]: Analyzing trace with hash -502394136, now seen corresponding path program 1 times [2020-12-23 08:20:29,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:20:29,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589690471] [2020-12-23 08:20:29,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:20:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:20:29,808 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:20:29,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589690471] [2020-12-23 08:20:29,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:20:29,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 08:20:29,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774139269] [2020-12-23 08:20:29,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:20:29,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:20:29,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:20:29,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:20:29,810 INFO L87 Difference]: Start difference. First operand 32269 states and 59839 transitions. Second operand 3 states. [2020-12-23 08:20:31,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:20:31,394 INFO L93 Difference]: Finished difference Result 52076 states and 95715 transitions. [2020-12-23 08:20:31,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:20:31,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-12-23 08:20:31,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:20:31,432 INFO L225 Difference]: With dead ends: 52076 [2020-12-23 08:20:31,432 INFO L226 Difference]: Without dead ends: 33331 [2020-12-23 08:20:31,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:20:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33331 states. [2020-12-23 08:20:33,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33331 to 33321. [2020-12-23 08:20:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33321 states. [2020-12-23 08:20:33,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33321 states to 33321 states and 61335 transitions. [2020-12-23 08:20:33,111 INFO L78 Accepts]: Start accepts. Automaton has 33321 states and 61335 transitions. Word has length 73 [2020-12-23 08:20:33,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:20:33,111 INFO L481 AbstractCegarLoop]: Abstraction has 33321 states and 61335 transitions. [2020-12-23 08:20:33,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:20:33,111 INFO L276 IsEmpty]: Start isEmpty. Operand 33321 states and 61335 transitions. [2020-12-23 08:20:33,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-23 08:20:33,113 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:20:33,113 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:20:33,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 08:20:33,113 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:20:33,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:20:33,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1203994010, now seen corresponding path program 1 times [2020-12-23 08:20:33,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:20:33,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432870783] [2020-12-23 08:20:33,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:20:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:20:33,188 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:20:33,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432870783] [2020-12-23 08:20:33,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:20:33,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:20:33,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302529966] [2020-12-23 08:20:33,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:20:33,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:20:33,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:20:33,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:20:33,190 INFO L87 Difference]: Start difference. First operand 33321 states and 61335 transitions. Second operand 6 states. [2020-12-23 08:20:40,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:20:40,008 INFO L93 Difference]: Finished difference Result 96949 states and 179713 transitions. [2020-12-23 08:20:40,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 08:20:40,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2020-12-23 08:20:40,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:20:40,127 INFO L225 Difference]: With dead ends: 96949 [2020-12-23 08:20:40,127 INFO L226 Difference]: Without dead ends: 78225 [2020-12-23 08:20:40,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2020-12-23 08:20:40,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78225 states. [2020-12-23 08:20:42,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78225 to 33321. [2020-12-23 08:20:42,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33321 states. [2020-12-23 08:20:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33321 states to 33321 states and 61287 transitions. [2020-12-23 08:20:42,101 INFO L78 Accepts]: Start accepts. Automaton has 33321 states and 61287 transitions. Word has length 73 [2020-12-23 08:20:42,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:20:42,101 INFO L481 AbstractCegarLoop]: Abstraction has 33321 states and 61287 transitions. [2020-12-23 08:20:42,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:20:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 33321 states and 61287 transitions. [2020-12-23 08:20:42,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 08:20:42,103 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:20:42,103 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:20:42,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 08:20:42,103 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:20:42,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:20:42,103 INFO L82 PathProgramCache]: Analyzing trace with hash -739112864, now seen corresponding path program 1 times [2020-12-23 08:20:42,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:20:42,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883114357] [2020-12-23 08:20:42,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:20:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:20:42,170 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:20:42,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883114357] [2020-12-23 08:20:42,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:20:42,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:20:42,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256019574] [2020-12-23 08:20:42,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:20:42,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:20:42,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:20:42,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:20:42,172 INFO L87 Difference]: Start difference. First operand 33321 states and 61287 transitions. Second operand 5 states. [2020-12-23 08:20:45,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:20:45,054 INFO L93 Difference]: Finished difference Result 70265 states and 128240 transitions. [2020-12-23 08:20:45,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 08:20:45,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2020-12-23 08:20:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:20:45,127 INFO L225 Difference]: With dead ends: 70265 [2020-12-23 08:20:45,127 INFO L226 Difference]: Without dead ends: 51719 [2020-12-23 08:20:45,145 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:20:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51719 states. [2020-12-23 08:20:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51719 to 33417. [2020-12-23 08:20:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33417 states. [2020-12-23 08:20:46,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33417 states to 33417 states and 61383 transitions. [2020-12-23 08:20:46,957 INFO L78 Accepts]: Start accepts. Automaton has 33417 states and 61383 transitions. Word has length 75 [2020-12-23 08:20:46,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:20:46,957 INFO L481 AbstractCegarLoop]: Abstraction has 33417 states and 61383 transitions. [2020-12-23 08:20:46,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:20:46,957 INFO L276 IsEmpty]: Start isEmpty. Operand 33417 states and 61383 transitions. [2020-12-23 08:20:46,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 08:20:46,959 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:20:46,959 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:20:46,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 08:20:46,960 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:20:46,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:20:46,960 INFO L82 PathProgramCache]: Analyzing trace with hash -4668339, now seen corresponding path program 1 times [2020-12-23 08:20:46,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:20:46,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260566970] [2020-12-23 08:20:46,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:20:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:20:47,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:20:47,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260566970] [2020-12-23 08:20:47,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:20:47,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:20:47,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243184437] [2020-12-23 08:20:47,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:20:47,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:20:47,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:20:47,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:20:47,205 INFO L87 Difference]: Start difference. First operand 33417 states and 61383 transitions. Second operand 5 states. [2020-12-23 08:20:50,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:20:50,974 INFO L93 Difference]: Finished difference Result 76129 states and 140804 transitions. [2020-12-23 08:20:50,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:20:50,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2020-12-23 08:20:50,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:20:51,162 INFO L225 Difference]: With dead ends: 76129 [2020-12-23 08:20:51,163 INFO L226 Difference]: Without dead ends: 51830 [2020-12-23 08:20:51,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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:20:51,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51830 states. [2020-12-23 08:20:52,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51830 to 33417. [2020-12-23 08:20:52,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33417 states. [2020-12-23 08:20:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33417 states to 33417 states and 60971 transitions. [2020-12-23 08:20:52,981 INFO L78 Accepts]: Start accepts. Automaton has 33417 states and 60971 transitions. Word has length 83 [2020-12-23 08:20:52,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:20:52,981 INFO L481 AbstractCegarLoop]: Abstraction has 33417 states and 60971 transitions. [2020-12-23 08:20:52,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:20:52,982 INFO L276 IsEmpty]: Start isEmpty. Operand 33417 states and 60971 transitions. [2020-12-23 08:20:52,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 08:20:52,984 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:20:52,984 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:20:52,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 08:20:52,985 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:20:52,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:20:52,985 INFO L82 PathProgramCache]: Analyzing trace with hash 97641130, now seen corresponding path program 1 times [2020-12-23 08:20:52,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:20:52,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410225004] [2020-12-23 08:20:52,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:20:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:20:53,252 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:20:53,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410225004] [2020-12-23 08:20:53,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:20:53,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 08:20:53,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231983310] [2020-12-23 08:20:53,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:20:53,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:20:53,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:20:53,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:20:53,254 INFO L87 Difference]: Start difference. First operand 33417 states and 60971 transitions. Second operand 6 states. [2020-12-23 08:20:55,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:20:55,388 INFO L93 Difference]: Finished difference Result 56514 states and 102469 transitions. [2020-12-23 08:20:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:20:55,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2020-12-23 08:20:55,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:20:55,436 INFO L225 Difference]: With dead ends: 56514 [2020-12-23 08:20:55,436 INFO L226 Difference]: Without dead ends: 37045 [2020-12-23 08:20:55,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 08:20:55,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37045 states. [2020-12-23 08:20:57,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37045 to 33417. [2020-12-23 08:20:57,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33417 states. [2020-12-23 08:20:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33417 states to 33417 states and 60535 transitions. [2020-12-23 08:20:57,336 INFO L78 Accepts]: Start accepts. Automaton has 33417 states and 60535 transitions. Word has length 83 [2020-12-23 08:20:57,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:20:57,337 INFO L481 AbstractCegarLoop]: Abstraction has 33417 states and 60535 transitions. [2020-12-23 08:20:57,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:20:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 33417 states and 60535 transitions. [2020-12-23 08:20:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 08:20:57,339 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:20:57,339 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] [2020-12-23 08:20:57,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 08:20:57,339 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:20:57,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:20:57,340 INFO L82 PathProgramCache]: Analyzing trace with hash -407359886, now seen corresponding path program 1 times [2020-12-23 08:20:57,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:20:57,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367056156] [2020-12-23 08:20:57,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:20:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:20:57,418 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:20:57,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367056156] [2020-12-23 08:20:57,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:20:57,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:20:57,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695341421] [2020-12-23 08:20:57,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:20:57,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:20:57,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:20:57,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:20:57,425 INFO L87 Difference]: Start difference. First operand 33417 states and 60535 transitions. Second operand 5 states. [2020-12-23 08:21:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:21:02,896 INFO L93 Difference]: Finished difference Result 117813 states and 213780 transitions. [2020-12-23 08:21:02,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:21:02,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2020-12-23 08:21:02,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:21:03,033 INFO L225 Difference]: With dead ends: 117813 [2020-12-23 08:21:03,033 INFO L226 Difference]: Without dead ends: 99062 [2020-12-23 08:21:03,067 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:21:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99062 states. [2020-12-23 08:21:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99062 to 49918. [2020-12-23 08:21:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49918 states. [2020-12-23 08:21:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49918 states to 49918 states and 90033 transitions. [2020-12-23 08:21:06,192 INFO L78 Accepts]: Start accepts. Automaton has 49918 states and 90033 transitions. Word has length 84 [2020-12-23 08:21:06,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:21:06,192 INFO L481 AbstractCegarLoop]: Abstraction has 49918 states and 90033 transitions. [2020-12-23 08:21:06,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:21:06,192 INFO L276 IsEmpty]: Start isEmpty. Operand 49918 states and 90033 transitions. [2020-12-23 08:21:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 08:21:06,195 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:21:06,195 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:21:06,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 08:21:06,195 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:21:06,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:21:06,196 INFO L82 PathProgramCache]: Analyzing trace with hash -479437977, now seen corresponding path program 1 times [2020-12-23 08:21:06,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:21:06,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121290660] [2020-12-23 08:21:06,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:21:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:21:06,312 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:06,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121290660] [2020-12-23 08:21:06,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:21:06,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:21:06,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158634100] [2020-12-23 08:21:06,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:21:06,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:21:06,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:21:06,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:21:06,314 INFO L87 Difference]: Start difference. First operand 49918 states and 90033 transitions. Second operand 5 states. [2020-12-23 08:21:09,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:21:09,513 INFO L93 Difference]: Finished difference Result 84910 states and 152369 transitions. [2020-12-23 08:21:09,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:21:09,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2020-12-23 08:21:09,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:21:09,579 INFO L225 Difference]: With dead ends: 84910 [2020-12-23 08:21:09,579 INFO L226 Difference]: Without dead ends: 52944 [2020-12-23 08:21:09,597 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 08:21:09,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52944 states. [2020-12-23 08:21:12,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52944 to 52829. [2020-12-23 08:21:12,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52829 states. [2020-12-23 08:21:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52829 states to 52829 states and 94763 transitions. [2020-12-23 08:21:12,489 INFO L78 Accepts]: Start accepts. Automaton has 52829 states and 94763 transitions. Word has length 85 [2020-12-23 08:21:12,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:21:12,489 INFO L481 AbstractCegarLoop]: Abstraction has 52829 states and 94763 transitions. [2020-12-23 08:21:12,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:21:12,489 INFO L276 IsEmpty]: Start isEmpty. Operand 52829 states and 94763 transitions. [2020-12-23 08:21:12,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 08:21:12,491 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:21:12,491 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:21:12,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 08:21:12,491 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:21:12,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:21:12,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1500506331, now seen corresponding path program 1 times [2020-12-23 08:21:12,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:21:12,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840482485] [2020-12-23 08:21:12,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:21:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:21:12,578 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:12,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840482485] [2020-12-23 08:21:12,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:21:12,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:21:12,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132403225] [2020-12-23 08:21:12,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:21:12,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:21:12,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:21:12,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:21:12,580 INFO L87 Difference]: Start difference. First operand 52829 states and 94763 transitions. Second operand 6 states. [2020-12-23 08:21:23,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:21:23,125 INFO L93 Difference]: Finished difference Result 195527 states and 356091 transitions. [2020-12-23 08:21:23,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 08:21:23,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2020-12-23 08:21:23,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:21:23,258 INFO L225 Difference]: With dead ends: 195527 [2020-12-23 08:21:23,258 INFO L226 Difference]: Without dead ends: 81695 [2020-12-23 08:21:23,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2020-12-23 08:21:23,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81695 states. [2020-12-23 08:21:25,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81695 to 26775. [2020-12-23 08:21:25,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26775 states. [2020-12-23 08:21:25,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26775 states to 26775 states and 47874 transitions. [2020-12-23 08:21:25,421 INFO L78 Accepts]: Start accepts. Automaton has 26775 states and 47874 transitions. Word has length 85 [2020-12-23 08:21:25,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:21:25,421 INFO L481 AbstractCegarLoop]: Abstraction has 26775 states and 47874 transitions. [2020-12-23 08:21:25,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:21:25,421 INFO L276 IsEmpty]: Start isEmpty. Operand 26775 states and 47874 transitions. [2020-12-23 08:21:25,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-12-23 08:21:25,443 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:21:25,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 08:21:25,443 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:21:25,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:21:25,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1551597897, now seen corresponding path program 1 times [2020-12-23 08:21:25,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:21:25,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738952211] [2020-12-23 08:21:25,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:21:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:21:25,606 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:25,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738952211] [2020-12-23 08:21:25,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:21:25,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 08:21:25,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436227082] [2020-12-23 08:21:25,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 08:21:25,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:21:25,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 08:21:25,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 08:21:25,609 INFO L87 Difference]: Start difference. First operand 26775 states and 47874 transitions. Second operand 7 states. [2020-12-23 08:21:28,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:21:28,797 INFO L93 Difference]: Finished difference Result 77619 states and 139981 transitions. [2020-12-23 08:21:28,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:21:28,798 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 232 [2020-12-23 08:21:28,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:21:28,866 INFO L225 Difference]: With dead ends: 77619 [2020-12-23 08:21:28,866 INFO L226 Difference]: Without dead ends: 58265 [2020-12-23 08:21:28,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2020-12-23 08:21:28,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58265 states. [2020-12-23 08:21:30,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58265 to 26856. [2020-12-23 08:21:30,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26856 states. [2020-12-23 08:21:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26856 states to 26856 states and 47955 transitions. [2020-12-23 08:21:30,578 INFO L78 Accepts]: Start accepts. Automaton has 26856 states and 47955 transitions. Word has length 232 [2020-12-23 08:21:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:21:30,578 INFO L481 AbstractCegarLoop]: Abstraction has 26856 states and 47955 transitions. [2020-12-23 08:21:30,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 08:21:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 26856 states and 47955 transitions. [2020-12-23 08:21:30,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-12-23 08:21:30,599 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:21:30,599 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 08:21:30,599 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:21:30,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:21:30,600 INFO L82 PathProgramCache]: Analyzing trace with hash -2031212003, now seen corresponding path program 1 times [2020-12-23 08:21:30,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:21:30,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422690500] [2020-12-23 08:21:30,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:21:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:21:30,957 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:30,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422690500] [2020-12-23 08:21:30,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:21:30,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:21:30,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182918429] [2020-12-23 08:21:30,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:21:30,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:21:30,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:21:30,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:21:30,959 INFO L87 Difference]: Start difference. First operand 26856 states and 47955 transitions. Second operand 5 states. [2020-12-23 08:21:32,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:21:32,561 INFO L93 Difference]: Finished difference Result 41897 states and 74268 transitions. [2020-12-23 08:21:32,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:21:32,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 236 [2020-12-23 08:21:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:21:32,596 INFO L225 Difference]: With dead ends: 41897 [2020-12-23 08:21:32,596 INFO L226 Difference]: Without dead ends: 26904 [2020-12-23 08:21:32,605 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 08:21:32,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26904 states. [2020-12-23 08:21:34,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26904 to 26856. [2020-12-23 08:21:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26856 states. [2020-12-23 08:21:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26856 states to 26856 states and 47941 transitions. [2020-12-23 08:21:34,078 INFO L78 Accepts]: Start accepts. Automaton has 26856 states and 47941 transitions. Word has length 236 [2020-12-23 08:21:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:21:34,079 INFO L481 AbstractCegarLoop]: Abstraction has 26856 states and 47941 transitions. [2020-12-23 08:21:34,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:21:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 26856 states and 47941 transitions. [2020-12-23 08:21:34,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-12-23 08:21:34,102 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:21:34,103 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 08:21:34,103 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:21:34,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:21:34,103 INFO L82 PathProgramCache]: Analyzing trace with hash 406751779, now seen corresponding path program 1 times [2020-12-23 08:21:34,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:21:34,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240096259] [2020-12-23 08:21:34,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:21:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:21:34,272 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:34,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240096259] [2020-12-23 08:21:34,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:21:34,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:21:34,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819995271] [2020-12-23 08:21:34,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:21:34,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:21:34,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:21:34,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:21:34,274 INFO L87 Difference]: Start difference. First operand 26856 states and 47941 transitions. Second operand 4 states. [2020-12-23 08:21:38,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:21:38,600 INFO L93 Difference]: Finished difference Result 48746 states and 86448 transitions. [2020-12-23 08:21:38,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:21:38,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2020-12-23 08:21:38,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:21:38,638 INFO L225 Difference]: With dead ends: 48746 [2020-12-23 08:21:38,638 INFO L226 Difference]: Without dead ends: 33831 [2020-12-23 08:21:38,649 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:21:38,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33831 states. [2020-12-23 08:21:40,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33831 to 33704. [2020-12-23 08:21:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33704 states. [2020-12-23 08:21:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33704 states to 33704 states and 59483 transitions. [2020-12-23 08:21:40,643 INFO L78 Accepts]: Start accepts. Automaton has 33704 states and 59483 transitions. Word has length 236 [2020-12-23 08:21:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:21:40,643 INFO L481 AbstractCegarLoop]: Abstraction has 33704 states and 59483 transitions. [2020-12-23 08:21:40,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:21:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 33704 states and 59483 transitions. [2020-12-23 08:21:40,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2020-12-23 08:21:40,670 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:21:40,670 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 08:21:40,671 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:21:40,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:21:40,671 INFO L82 PathProgramCache]: Analyzing trace with hash -344315925, now seen corresponding path program 1 times [2020-12-23 08:21:40,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:21:40,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273225424] [2020-12-23 08:21:40,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:21:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:21:40,791 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:40,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273225424] [2020-12-23 08:21:40,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:21:40,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:21:40,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828904734] [2020-12-23 08:21:40,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:21:40,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:21:40,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:21:40,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:21:40,793 INFO L87 Difference]: Start difference. First operand 33704 states and 59483 transitions. Second operand 3 states. [2020-12-23 08:21:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:21:44,589 INFO L93 Difference]: Finished difference Result 61806 states and 108623 transitions. [2020-12-23 08:21:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:21:44,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2020-12-23 08:21:44,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:21:44,634 INFO L225 Difference]: With dead ends: 61806 [2020-12-23 08:21:44,635 INFO L226 Difference]: Without dead ends: 40699 [2020-12-23 08:21:44,649 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:44,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40699 states. [2020-12-23 08:21:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40699 to 40674. [2020-12-23 08:21:47,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40674 states. [2020-12-23 08:21:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40674 states to 40674 states and 71669 transitions. [2020-12-23 08:21:47,189 INFO L78 Accepts]: Start accepts. Automaton has 40674 states and 71669 transitions. Word has length 239 [2020-12-23 08:21:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:21:47,190 INFO L481 AbstractCegarLoop]: Abstraction has 40674 states and 71669 transitions. [2020-12-23 08:21:47,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:21:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 40674 states and 71669 transitions. [2020-12-23 08:21:47,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2020-12-23 08:21:47,212 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:21:47,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 08:21:47,212 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:21:47,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:21:47,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1633404307, now seen corresponding path program 1 times [2020-12-23 08:21:47,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:21:47,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653040358] [2020-12-23 08:21:47,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:21:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:21:47,366 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:47,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653040358] [2020-12-23 08:21:47,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:21:47,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:21:47,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522759130] [2020-12-23 08:21:47,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:21:47,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:21:47,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:21:47,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:21:47,369 INFO L87 Difference]: Start difference. First operand 40674 states and 71669 transitions. Second operand 4 states. [2020-12-23 08:21:52,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:21:52,295 INFO L93 Difference]: Finished difference Result 73854 states and 129745 transitions. [2020-12-23 08:21:52,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:21:52,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2020-12-23 08:21:52,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:21:52,348 INFO L225 Difference]: With dead ends: 73854 [2020-12-23 08:21:52,349 INFO L226 Difference]: Without dead ends: 45581 [2020-12-23 08:21:52,381 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:21:52,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45581 states. [2020-12-23 08:21:54,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45581 to 40142. [2020-12-23 08:21:54,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40142 states. [2020-12-23 08:21:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40142 states to 40142 states and 70822 transitions. [2020-12-23 08:21:54,872 INFO L78 Accepts]: Start accepts. Automaton has 40142 states and 70822 transitions. Word has length 240 [2020-12-23 08:21:54,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:21:54,873 INFO L481 AbstractCegarLoop]: Abstraction has 40142 states and 70822 transitions. [2020-12-23 08:21:54,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:21:54,873 INFO L276 IsEmpty]: Start isEmpty. Operand 40142 states and 70822 transitions. [2020-12-23 08:21:54,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2020-12-23 08:21:54,899 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:21:54,899 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 08:21:54,899 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:21:54,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:21:54,900 INFO L82 PathProgramCache]: Analyzing trace with hash -731635109, now seen corresponding path program 1 times [2020-12-23 08:21:54,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:21:54,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748963147] [2020-12-23 08:21:54,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:21:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:21:55,012 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:55,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748963147] [2020-12-23 08:21:55,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:21:55,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:21:55,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198267691] [2020-12-23 08:21:55,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:21:55,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:21:55,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:21:55,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:21:55,014 INFO L87 Difference]: Start difference. First operand 40142 states and 70822 transitions. Second operand 3 states. [2020-12-23 08:21:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:21:59,204 INFO L93 Difference]: Finished difference Result 70286 states and 123357 transitions. [2020-12-23 08:21:59,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:21:59,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2020-12-23 08:21:59,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:21:59,262 INFO L225 Difference]: With dead ends: 70286 [2020-12-23 08:21:59,262 INFO L226 Difference]: Without dead ends: 46934 [2020-12-23 08:21:59,279 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:59,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46934 states. [2020-12-23 08:22:02,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46934 to 46882. [2020-12-23 08:22:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46882 states. [2020-12-23 08:22:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46882 states to 46882 states and 82516 transitions. [2020-12-23 08:22:02,326 INFO L78 Accepts]: Start accepts. Automaton has 46882 states and 82516 transitions. Word has length 241 [2020-12-23 08:22:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:02,326 INFO L481 AbstractCegarLoop]: Abstraction has 46882 states and 82516 transitions. [2020-12-23 08:22:02,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:22:02,327 INFO L276 IsEmpty]: Start isEmpty. Operand 46882 states and 82516 transitions. [2020-12-23 08:22:02,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2020-12-23 08:22:02,348 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:02,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 08:22:02,349 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:02,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:02,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1427909383, now seen corresponding path program 1 times [2020-12-23 08:22:02,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:02,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359777960] [2020-12-23 08:22:02,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:02,626 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,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359777960] [2020-12-23 08:22:02,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:02,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:22:02,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177509394] [2020-12-23 08:22:02,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:22:02,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:02,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:22:02,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:22:02,628 INFO L87 Difference]: Start difference. First operand 46882 states and 82516 transitions. Second operand 3 states. [2020-12-23 08:22:08,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:08,379 INFO L93 Difference]: Finished difference Result 116041 states and 205867 transitions. [2020-12-23 08:22:08,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:22:08,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2020-12-23 08:22:08,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:08,467 INFO L225 Difference]: With dead ends: 116041 [2020-12-23 08:22:08,467 INFO L226 Difference]: Without dead ends: 75255 [2020-12-23 08:22:08,497 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:08,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75255 states. [2020-12-23 08:22:11,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75255 to 46600. [2020-12-23 08:22:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46600 states. [2020-12-23 08:22:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46600 states to 46600 states and 81670 transitions. [2020-12-23 08:22:11,758 INFO L78 Accepts]: Start accepts. Automaton has 46600 states and 81670 transitions. Word has length 243 [2020-12-23 08:22:11,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:11,758 INFO L481 AbstractCegarLoop]: Abstraction has 46600 states and 81670 transitions. [2020-12-23 08:22:11,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:22:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 46600 states and 81670 transitions. [2020-12-23 08:22:11,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2020-12-23 08:22:11,779 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:11,779 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 08:22:11,779 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:11,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:11,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1367350635, now seen corresponding path program 1 times [2020-12-23 08:22:11,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:11,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092868164] [2020-12-23 08:22:11,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:11,945 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:11,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092868164] [2020-12-23 08:22:11,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:11,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:22:11,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15262789] [2020-12-23 08:22:11,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:22:11,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:11,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:22:11,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:22:11,949 INFO L87 Difference]: Start difference. First operand 46600 states and 81670 transitions. Second operand 4 states. [2020-12-23 08:22:17,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:17,870 INFO L93 Difference]: Finished difference Result 80808 states and 141186 transitions. [2020-12-23 08:22:17,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:22:17,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2020-12-23 08:22:17,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:17,953 INFO L225 Difference]: With dead ends: 80808 [2020-12-23 08:22:17,954 INFO L226 Difference]: Without dead ends: 53215 [2020-12-23 08:22:17,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:22:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53215 states. [2020-12-23 08:22:21,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53215 to 53160. [2020-12-23 08:22:21,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53160 states. [2020-12-23 08:22:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53160 states to 53160 states and 92720 transitions. [2020-12-23 08:22:21,559 INFO L78 Accepts]: Start accepts. Automaton has 53160 states and 92720 transitions. Word has length 243 [2020-12-23 08:22:21,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:21,560 INFO L481 AbstractCegarLoop]: Abstraction has 53160 states and 92720 transitions. [2020-12-23 08:22:21,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:22:21,560 INFO L276 IsEmpty]: Start isEmpty. Operand 53160 states and 92720 transitions. [2020-12-23 08:22:21,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2020-12-23 08:22:21,579 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:21,579 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 08:22:21,579 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:21,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:21,580 INFO L82 PathProgramCache]: Analyzing trace with hash -799857507, now seen corresponding path program 1 times [2020-12-23 08:22:21,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:21,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137633149] [2020-12-23 08:22:21,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:21,724 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,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137633149] [2020-12-23 08:22:21,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:21,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:22:21,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402976892] [2020-12-23 08:22:21,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:22:21,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:21,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:22:21,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:22:21,726 INFO L87 Difference]: Start difference. First operand 53160 states and 92720 transitions. Second operand 5 states. [2020-12-23 08:22:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:22:32,512 INFO L93 Difference]: Finished difference Result 196889 states and 347932 transitions. [2020-12-23 08:22:32,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:22:32,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2020-12-23 08:22:32,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:22:32,728 INFO L225 Difference]: With dead ends: 196889 [2020-12-23 08:22:32,729 INFO L226 Difference]: Without dead ends: 151771 [2020-12-23 08:22:32,773 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:33,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151771 states. [2020-12-23 08:22:37,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151771 to 53160. [2020-12-23 08:22:37,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53160 states. [2020-12-23 08:22:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53160 states to 53160 states and 92612 transitions. [2020-12-23 08:22:37,154 INFO L78 Accepts]: Start accepts. Automaton has 53160 states and 92612 transitions. Word has length 244 [2020-12-23 08:22:37,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:22:37,155 INFO L481 AbstractCegarLoop]: Abstraction has 53160 states and 92612 transitions. [2020-12-23 08:22:37,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:22:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 53160 states and 92612 transitions. [2020-12-23 08:22:37,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2020-12-23 08:22:37,176 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:22:37,176 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 08:22:37,176 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:37,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:22:37,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1479927937, now seen corresponding path program 1 times [2020-12-23 08:22:37,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:22:37,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619604803] [2020-12-23 08:22:37,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:22:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:22:37,315 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:37,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619604803] [2020-12-23 08:22:37,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:22:37,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 08:22:37,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744468827] [2020-12-23 08:22:37,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:22:37,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:22:37,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:22:37,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:22:37,319 INFO L87 Difference]: Start difference. First operand 53160 states and 92612 transitions. Second operand 3 states.