/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/eca-rers2012/Problem14_label51.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 14:16:27,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 14:16:27,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 14:16:27,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 14:16:27,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 14:16:27,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 14:16:27,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 14:16:27,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 14:16:27,942 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 14:16:27,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 14:16:27,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 14:16:27,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 14:16:27,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 14:16:27,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 14:16:27,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 14:16:27,959 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 14:16:27,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 14:16:27,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 14:16:27,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 14:16:27,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 14:16:27,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 14:16:27,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 14:16:27,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 14:16:27,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 14:16:27,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 14:16:27,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 14:16:27,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 14:16:27,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 14:16:27,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 14:16:27,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 14:16:27,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 14:16:27,977 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 14:16:27,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 14:16:27,979 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 14:16:27,981 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 14:16:27,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 14:16:27,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 14:16:27,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 14:16:27,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 14:16:27,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 14:16:27,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 14:16:27,985 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 14:16:28,015 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 14:16:28,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 14:16:28,017 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 14:16:28,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 14:16:28,018 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 14:16:28,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 14:16:28,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 14:16:28,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 14:16:28,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 14:16:28,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 14:16:28,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 14:16:28,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 14:16:28,020 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 14:16:28,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 14:16:28,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 14:16:28,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 14:16:28,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 14:16:28,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 14:16:28,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 14:16:28,021 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 14:16:28,022 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 14:16:28,022 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 14:16:28,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 14:16:28,022 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 14:16:28,023 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 14:16:28,023 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 14:16:28,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 14:16:28,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 14:16:28,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 14:16:28,435 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 14:16:28,436 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 14:16:28,437 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label51.c [2021-01-06 14:16:28,525 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3a245babb/3e64175feb14457c838df07030c461e1/FLAGf4f059496 [2021-01-06 14:16:29,334 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 14:16:29,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label51.c [2021-01-06 14:16:29,367 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3a245babb/3e64175feb14457c838df07030c461e1/FLAGf4f059496 [2021-01-06 14:16:29,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3a245babb/3e64175feb14457c838df07030c461e1 [2021-01-06 14:16:29,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 14:16:29,547 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 14:16:29,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 14:16:29,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 14:16:29,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 14:16:29,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 02:16:29" (1/1) ... [2021-01-06 14:16:29,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba255e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:29, skipping insertion in model container [2021-01-06 14:16:29,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 02:16:29" (1/1) ... [2021-01-06 14:16:29,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 14:16:29,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 14:16:29,831 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/eca-rers2012/Problem14_label51.c[3722,3735] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2021-01-06 14:16:30,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 14:16:30,162 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 14:16:30,203 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/eca-rers2012/Problem14_label51.c[3722,3735] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2021-01-06 14:16:30,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 14:16:30,366 INFO L208 MainTranslator]: Completed translation [2021-01-06 14:16:30,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:30 WrapperNode [2021-01-06 14:16:30,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 14:16:30,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 14:16:30,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 14:16:30,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 14:16:30,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:30" (1/1) ... [2021-01-06 14:16:30,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:30" (1/1) ... [2021-01-06 14:16:30,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 14:16:30,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 14:16:30,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 14:16:30,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 14:16:30,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:30" (1/1) ... [2021-01-06 14:16:30,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:30" (1/1) ... [2021-01-06 14:16:30,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:30" (1/1) ... [2021-01-06 14:16:30,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:30" (1/1) ... [2021-01-06 14:16:30,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:30" (1/1) ... [2021-01-06 14:16:30,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:30" (1/1) ... [2021-01-06 14:16:30,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:30" (1/1) ... [2021-01-06 14:16:30,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 14:16:30,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 14:16:30,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 14:16:30,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 14:16:30,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:30" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 14:16:30,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 14:16:30,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 14:16:30,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 14:16:30,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 14:16:32,522 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 14:16:32,523 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 14:16:32,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 02:16:32 BoogieIcfgContainer [2021-01-06 14:16:32,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 14:16:32,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 14:16:32,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 14:16:32,530 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 14:16:32,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 02:16:29" (1/3) ... [2021-01-06 14:16:32,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a603b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 02:16:32, skipping insertion in model container [2021-01-06 14:16:32,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:30" (2/3) ... [2021-01-06 14:16:32,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a603b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 02:16:32, skipping insertion in model container [2021-01-06 14:16:32,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 02:16:32" (3/3) ... [2021-01-06 14:16:32,534 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label51.c [2021-01-06 14:16:32,540 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 14:16:32,546 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 14:16:32,565 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 14:16:32,592 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 14:16:32,592 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 14:16:32,592 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 14:16:32,592 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 14:16:32,592 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 14:16:32,593 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 14:16:32,593 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 14:16:32,593 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 14:16:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2021-01-06 14:16:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 14:16:32,622 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:32,622 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] [2021-01-06 14:16:32,623 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:32,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:32,629 INFO L82 PathProgramCache]: Analyzing trace with hash -596708735, now seen corresponding path program 1 times [2021-01-06 14:16:32,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:32,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239074268] [2021-01-06 14:16:32,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:32,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:16:32,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239074268] [2021-01-06 14:16:32,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:32,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 14:16:32,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268801232] [2021-01-06 14:16:32,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:32,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:32,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:32,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:32,908 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 3 states. [2021-01-06 14:16:34,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:34,303 INFO L93 Difference]: Finished difference Result 685 states and 1216 transitions. [2021-01-06 14:16:34,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:34,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2021-01-06 14:16:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:34,326 INFO L225 Difference]: With dead ends: 685 [2021-01-06 14:16:34,326 INFO L226 Difference]: Without dead ends: 360 [2021-01-06 14:16:34,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:34,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-01-06 14:16:34,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2021-01-06 14:16:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2021-01-06 14:16:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 510 transitions. [2021-01-06 14:16:34,432 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 510 transitions. Word has length 35 [2021-01-06 14:16:34,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:34,433 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 510 transitions. [2021-01-06 14:16:34,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 510 transitions. [2021-01-06 14:16:34,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-01-06 14:16:34,438 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:34,438 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:34,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 14:16:34,439 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:34,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:34,440 INFO L82 PathProgramCache]: Analyzing trace with hash 183125839, now seen corresponding path program 1 times [2021-01-06 14:16:34,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:34,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942285214] [2021-01-06 14:16:34,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:16:34,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942285214] [2021-01-06 14:16:34,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:34,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:34,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447502405] [2021-01-06 14:16:34,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:16:34,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:34,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:16:34,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:16:34,784 INFO L87 Difference]: Start difference. First operand 360 states and 510 transitions. Second operand 4 states. [2021-01-06 14:16:36,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:36,199 INFO L93 Difference]: Finished difference Result 1074 states and 1446 transitions. [2021-01-06 14:16:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:16:36,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2021-01-06 14:16:36,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:36,207 INFO L225 Difference]: With dead ends: 1074 [2021-01-06 14:16:36,207 INFO L226 Difference]: Without dead ends: 716 [2021-01-06 14:16:36,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:16:36,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-01-06 14:16:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2021-01-06 14:16:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2021-01-06 14:16:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 902 transitions. [2021-01-06 14:16:36,252 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 902 transitions. Word has length 114 [2021-01-06 14:16:36,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:36,253 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 902 transitions. [2021-01-06 14:16:36,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:16:36,253 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 902 transitions. [2021-01-06 14:16:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-06 14:16:36,260 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:36,260 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:36,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 14:16:36,260 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:36,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:36,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1801900176, now seen corresponding path program 1 times [2021-01-06 14:16:36,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:36,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770120069] [2021-01-06 14:16:36,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:16:36,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770120069] [2021-01-06 14:16:36,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:36,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:36,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679608530] [2021-01-06 14:16:36,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:36,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:36,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:36,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:36,484 INFO L87 Difference]: Start difference. First operand 716 states and 902 transitions. Second operand 3 states. [2021-01-06 14:16:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:37,457 INFO L93 Difference]: Finished difference Result 1964 states and 2499 transitions. [2021-01-06 14:16:37,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:37,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2021-01-06 14:16:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:37,466 INFO L225 Difference]: With dead ends: 1964 [2021-01-06 14:16:37,466 INFO L226 Difference]: Without dead ends: 1250 [2021-01-06 14:16:37,468 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:37,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2021-01-06 14:16:37,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2021-01-06 14:16:37,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2021-01-06 14:16:37,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1544 transitions. [2021-01-06 14:16:37,504 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1544 transitions. Word has length 140 [2021-01-06 14:16:37,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:37,505 INFO L481 AbstractCegarLoop]: Abstraction has 1250 states and 1544 transitions. [2021-01-06 14:16:37,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:37,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1544 transitions. [2021-01-06 14:16:37,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-01-06 14:16:37,513 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:37,513 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:37,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 14:16:37,514 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:37,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:37,515 INFO L82 PathProgramCache]: Analyzing trace with hash 689274588, now seen corresponding path program 1 times [2021-01-06 14:16:37,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:37,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278756715] [2021-01-06 14:16:37,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 14:16:37,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278756715] [2021-01-06 14:16:37,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:37,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:37,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415600458] [2021-01-06 14:16:37,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:16:37,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:37,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:16:37,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:16:37,787 INFO L87 Difference]: Start difference. First operand 1250 states and 1544 transitions. Second operand 4 states. [2021-01-06 14:16:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:38,898 INFO L93 Difference]: Finished difference Result 2705 states and 3353 transitions. [2021-01-06 14:16:38,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:16:38,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2021-01-06 14:16:38,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:38,908 INFO L225 Difference]: With dead ends: 2705 [2021-01-06 14:16:38,908 INFO L226 Difference]: Without dead ends: 1606 [2021-01-06 14:16:38,911 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 [2021-01-06 14:16:38,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2021-01-06 14:16:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2021-01-06 14:16:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2021-01-06 14:16:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1801 transitions. [2021-01-06 14:16:38,955 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1801 transitions. Word has length 194 [2021-01-06 14:16:38,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:38,957 INFO L481 AbstractCegarLoop]: Abstraction has 1606 states and 1801 transitions. [2021-01-06 14:16:38,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:16:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1801 transitions. [2021-01-06 14:16:38,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2021-01-06 14:16:38,966 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:38,966 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:38,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 14:16:38,967 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:38,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:38,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1212960330, now seen corresponding path program 1 times [2021-01-06 14:16:38,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:38,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383916650] [2021-01-06 14:16:38,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 146 proven. 130 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 14:16:39,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383916650] [2021-01-06 14:16:39,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116066858] [2021-01-06 14:16:39,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:39,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:16:39,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-01-06 14:16:40,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:40,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:16:40,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699338370] [2021-01-06 14:16:40,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:40,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:40,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:40,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:16:40,351 INFO L87 Difference]: Start difference. First operand 1606 states and 1801 transitions. Second operand 3 states. [2021-01-06 14:16:41,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:41,251 INFO L93 Difference]: Finished difference Result 3388 states and 3901 transitions. [2021-01-06 14:16:41,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:41,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2021-01-06 14:16:41,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:41,270 INFO L225 Difference]: With dead ends: 3388 [2021-01-06 14:16:41,270 INFO L226 Difference]: Without dead ends: 1962 [2021-01-06 14:16:41,273 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:16:41,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2021-01-06 14:16:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2021-01-06 14:16:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2021-01-06 14:16:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2220 transitions. [2021-01-06 14:16:41,318 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2220 transitions. Word has length 321 [2021-01-06 14:16:41,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:41,319 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 2220 transitions. [2021-01-06 14:16:41,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:41,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2220 transitions. [2021-01-06 14:16:41,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2021-01-06 14:16:41,325 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:41,325 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:41,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:41,541 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:41,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:41,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1895165588, now seen corresponding path program 1 times [2021-01-06 14:16:41,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:41,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165442139] [2021-01-06 14:16:41,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-01-06 14:16:41,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165442139] [2021-01-06 14:16:41,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:41,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:41,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858371208] [2021-01-06 14:16:41,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:41,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:41,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:41,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:41,876 INFO L87 Difference]: Start difference. First operand 1962 states and 2220 transitions. Second operand 3 states. [2021-01-06 14:16:42,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:42,776 INFO L93 Difference]: Finished difference Result 4100 states and 4689 transitions. [2021-01-06 14:16:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:42,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2021-01-06 14:16:42,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:42,790 INFO L225 Difference]: With dead ends: 4100 [2021-01-06 14:16:42,791 INFO L226 Difference]: Without dead ends: 2318 [2021-01-06 14:16:42,794 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:42,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2021-01-06 14:16:42,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2021-01-06 14:16:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2021-01-06 14:16:42,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2613 transitions. [2021-01-06 14:16:42,853 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2613 transitions. Word has length 325 [2021-01-06 14:16:42,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:42,853 INFO L481 AbstractCegarLoop]: Abstraction has 2318 states and 2613 transitions. [2021-01-06 14:16:42,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:42,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2613 transitions. [2021-01-06 14:16:42,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2021-01-06 14:16:42,863 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:42,863 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:42,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 14:16:42,864 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:42,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:42,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1863836660, now seen corresponding path program 1 times [2021-01-06 14:16:42,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:42,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88810651] [2021-01-06 14:16:42,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 153 proven. 130 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-01-06 14:16:43,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88810651] [2021-01-06 14:16:43,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197783216] [2021-01-06 14:16:43,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:43,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:16:43,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2021-01-06 14:16:44,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:44,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2021-01-06 14:16:44,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801220909] [2021-01-06 14:16:44,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:44,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:44,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:44,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:16:44,008 INFO L87 Difference]: Start difference. First operand 2318 states and 2613 transitions. Second operand 3 states. [2021-01-06 14:16:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:44,708 INFO L93 Difference]: Finished difference Result 4990 states and 5718 transitions. [2021-01-06 14:16:44,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:44,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2021-01-06 14:16:44,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:44,722 INFO L225 Difference]: With dead ends: 4990 [2021-01-06 14:16:44,723 INFO L226 Difference]: Without dead ends: 2852 [2021-01-06 14:16:44,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:16:44,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2021-01-06 14:16:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2021-01-06 14:16:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2021-01-06 14:16:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2974 transitions. [2021-01-06 14:16:44,802 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2974 transitions. Word has length 328 [2021-01-06 14:16:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:44,803 INFO L481 AbstractCegarLoop]: Abstraction has 2674 states and 2974 transitions. [2021-01-06 14:16:44,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2974 transitions. [2021-01-06 14:16:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2021-01-06 14:16:44,809 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:44,810 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2021-01-06 14:16:45,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:45,024 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:45,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:45,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1586740272, now seen corresponding path program 1 times [2021-01-06 14:16:45,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:45,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627830855] [2021-01-06 14:16:45,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2021-01-06 14:16:45,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627830855] [2021-01-06 14:16:45,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:45,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:45,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631134130] [2021-01-06 14:16:45,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:45,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:45,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:45,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:45,269 INFO L87 Difference]: Start difference. First operand 2674 states and 2974 transitions. Second operand 3 states. [2021-01-06 14:16:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:46,033 INFO L93 Difference]: Finished difference Result 5702 states and 6438 transitions. [2021-01-06 14:16:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:46,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2021-01-06 14:16:46,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:46,051 INFO L225 Difference]: With dead ends: 5702 [2021-01-06 14:16:46,052 INFO L226 Difference]: Without dead ends: 3208 [2021-01-06 14:16:46,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:46,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2021-01-06 14:16:46,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 2852. [2021-01-06 14:16:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 14:16:46,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3183 transitions. [2021-01-06 14:16:46,124 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3183 transitions. Word has length 352 [2021-01-06 14:16:46,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:46,125 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 3183 transitions. [2021-01-06 14:16:46,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:46,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3183 transitions. [2021-01-06 14:16:46,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2021-01-06 14:16:46,131 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:46,131 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:46,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 14:16:46,132 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:46,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:46,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1378867977, now seen corresponding path program 1 times [2021-01-06 14:16:46,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:46,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980222056] [2021-01-06 14:16:46,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2021-01-06 14:16:46,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980222056] [2021-01-06 14:16:46,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:46,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:46,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482310786] [2021-01-06 14:16:46,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:46,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:46,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:46,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:46,373 INFO L87 Difference]: Start difference. First operand 2852 states and 3183 transitions. Second operand 3 states. [2021-01-06 14:16:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:47,246 INFO L93 Difference]: Finished difference Result 6236 states and 7044 transitions. [2021-01-06 14:16:47,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:47,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 359 [2021-01-06 14:16:47,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:47,267 INFO L225 Difference]: With dead ends: 6236 [2021-01-06 14:16:47,268 INFO L226 Difference]: Without dead ends: 3564 [2021-01-06 14:16:47,273 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:47,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2021-01-06 14:16:47,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3564. [2021-01-06 14:16:47,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2021-01-06 14:16:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3992 transitions. [2021-01-06 14:16:47,352 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3992 transitions. Word has length 359 [2021-01-06 14:16:47,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:47,353 INFO L481 AbstractCegarLoop]: Abstraction has 3564 states and 3992 transitions. [2021-01-06 14:16:47,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3992 transitions. [2021-01-06 14:16:47,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2021-01-06 14:16:47,367 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:47,367 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:47,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 14:16:47,368 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:47,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:47,369 INFO L82 PathProgramCache]: Analyzing trace with hash -845400379, now seen corresponding path program 1 times [2021-01-06 14:16:47,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:47,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915621224] [2021-01-06 14:16:47,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2021-01-06 14:16:48,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915621224] [2021-01-06 14:16:48,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976942525] [2021-01-06 14:16:48,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:48,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:16:48,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:48,862 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2021-01-06 14:16:48,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:48,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2021-01-06 14:16:48,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870669733] [2021-01-06 14:16:48,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:48,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:48,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:48,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:16:48,865 INFO L87 Difference]: Start difference. First operand 3564 states and 3992 transitions. Second operand 3 states. [2021-01-06 14:16:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:49,667 INFO L93 Difference]: Finished difference Result 4634 states and 5186 transitions. [2021-01-06 14:16:49,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:49,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 514 [2021-01-06 14:16:49,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:49,692 INFO L225 Difference]: With dead ends: 4634 [2021-01-06 14:16:49,692 INFO L226 Difference]: Without dead ends: 4632 [2021-01-06 14:16:49,694 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:16:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2021-01-06 14:16:49,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 3742. [2021-01-06 14:16:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2021-01-06 14:16:49,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4206 transitions. [2021-01-06 14:16:49,787 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4206 transitions. Word has length 514 [2021-01-06 14:16:49,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:49,788 INFO L481 AbstractCegarLoop]: Abstraction has 3742 states and 4206 transitions. [2021-01-06 14:16:49,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4206 transitions. [2021-01-06 14:16:49,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2021-01-06 14:16:49,802 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:49,802 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:50,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-06 14:16:50,018 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:50,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:50,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1470466272, now seen corresponding path program 1 times [2021-01-06 14:16:50,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:50,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485357408] [2021-01-06 14:16:50,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1042 backedges. 689 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2021-01-06 14:16:50,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485357408] [2021-01-06 14:16:50,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:50,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:50,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944189116] [2021-01-06 14:16:50,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:16:50,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:50,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:16:50,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:16:50,544 INFO L87 Difference]: Start difference. First operand 3742 states and 4206 transitions. Second operand 4 states. [2021-01-06 14:16:51,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:51,565 INFO L93 Difference]: Finished difference Result 7511 states and 8456 transitions. [2021-01-06 14:16:51,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:16:51,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 516 [2021-01-06 14:16:51,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:51,583 INFO L225 Difference]: With dead ends: 7511 [2021-01-06 14:16:51,583 INFO L226 Difference]: Without dead ends: 3920 [2021-01-06 14:16:51,588 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 [2021-01-06 14:16:51,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2021-01-06 14:16:51,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2021-01-06 14:16:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2021-01-06 14:16:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4058 transitions. [2021-01-06 14:16:51,658 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4058 transitions. Word has length 516 [2021-01-06 14:16:51,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:51,659 INFO L481 AbstractCegarLoop]: Abstraction has 3742 states and 4058 transitions. [2021-01-06 14:16:51,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:16:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4058 transitions. [2021-01-06 14:16:51,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2021-01-06 14:16:51,665 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:51,666 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:51,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 14:16:51,666 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:51,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:51,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2099920225, now seen corresponding path program 1 times [2021-01-06 14:16:51,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:51,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260576197] [2021-01-06 14:16:51,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 763 proven. 11 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2021-01-06 14:16:52,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260576197] [2021-01-06 14:16:52,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714763216] [2021-01-06 14:16:52,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:52,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:16:52,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 957 trivial. 0 not checked. [2021-01-06 14:16:53,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:53,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:16:53,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225045183] [2021-01-06 14:16:53,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:53,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:53,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:53,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:16:53,513 INFO L87 Difference]: Start difference. First operand 3742 states and 4058 transitions. Second operand 3 states. [2021-01-06 14:16:54,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:54,177 INFO L93 Difference]: Finished difference Result 8550 states and 9311 transitions. [2021-01-06 14:16:54,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:54,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 542 [2021-01-06 14:16:54,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:54,203 INFO L225 Difference]: With dead ends: 8550 [2021-01-06 14:16:54,203 INFO L226 Difference]: Without dead ends: 4988 [2021-01-06 14:16:54,209 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:16:54,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2021-01-06 14:16:54,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4810. [2021-01-06 14:16:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2021-01-06 14:16:54,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5196 transitions. [2021-01-06 14:16:54,292 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5196 transitions. Word has length 542 [2021-01-06 14:16:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:54,293 INFO L481 AbstractCegarLoop]: Abstraction has 4810 states and 5196 transitions. [2021-01-06 14:16:54,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5196 transitions. [2021-01-06 14:16:54,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2021-01-06 14:16:54,300 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:54,300 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:54,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:54,515 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:54,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1352323170, now seen corresponding path program 1 times [2021-01-06 14:16:54,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:54,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403320792] [2021-01-06 14:16:54,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:55,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 839 proven. 11 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2021-01-06 14:16:55,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403320792] [2021-01-06 14:16:55,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778799120] [2021-01-06 14:16:55,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:55,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:16:55,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 534 proven. 0 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2021-01-06 14:16:56,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:56,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2021-01-06 14:16:56,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714133738] [2021-01-06 14:16:56,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:56,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:56,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:56,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:16:56,683 INFO L87 Difference]: Start difference. First operand 4810 states and 5196 transitions. Second operand 3 states. [2021-01-06 14:16:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:57,299 INFO L93 Difference]: Finished difference Result 9618 states and 10400 transitions. [2021-01-06 14:16:57,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:57,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 561 [2021-01-06 14:16:57,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:57,311 INFO L225 Difference]: With dead ends: 9618 [2021-01-06 14:16:57,312 INFO L226 Difference]: Without dead ends: 4988 [2021-01-06 14:16:57,318 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 560 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:16:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2021-01-06 14:16:57,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4988. [2021-01-06 14:16:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2021-01-06 14:16:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5313 transitions. [2021-01-06 14:16:57,400 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5313 transitions. Word has length 561 [2021-01-06 14:16:57,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:57,401 INFO L481 AbstractCegarLoop]: Abstraction has 4988 states and 5313 transitions. [2021-01-06 14:16:57,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:57,402 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5313 transitions. [2021-01-06 14:16:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2021-01-06 14:16:57,412 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:57,413 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:57,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-06 14:16:57,628 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:57,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:57,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1991278311, now seen corresponding path program 1 times [2021-01-06 14:16:57,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:57,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227740777] [2021-01-06 14:16:57,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1761 backedges. 1259 proven. 155 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2021-01-06 14:16:58,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227740777] [2021-01-06 14:16:58,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854786232] [2021-01-06 14:16:58,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:58,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:16:58,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1761 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2021-01-06 14:16:59,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:59,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 14:16:59,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752345755] [2021-01-06 14:16:59,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:59,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:59,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:59,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:16:59,494 INFO L87 Difference]: Start difference. First operand 4988 states and 5313 transitions. Second operand 3 states. [2021-01-06 14:17:00,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:00,196 INFO L93 Difference]: Finished difference Result 11220 states and 11937 transitions. [2021-01-06 14:17:00,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:17:00,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 779 [2021-01-06 14:17:00,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:00,208 INFO L225 Difference]: With dead ends: 11220 [2021-01-06 14:17:00,208 INFO L226 Difference]: Without dead ends: 4098 [2021-01-06 14:17:00,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 779 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:17:00,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2021-01-06 14:17:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3208. [2021-01-06 14:17:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2021-01-06 14:17:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3339 transitions. [2021-01-06 14:17:00,277 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3339 transitions. Word has length 779 [2021-01-06 14:17:00,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:00,278 INFO L481 AbstractCegarLoop]: Abstraction has 3208 states and 3339 transitions. [2021-01-06 14:17:00,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:17:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3339 transitions. [2021-01-06 14:17:00,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2021-01-06 14:17:00,289 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:00,290 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:00,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:17:00,504 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:00,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:00,505 INFO L82 PathProgramCache]: Analyzing trace with hash -362013204, now seen corresponding path program 1 times [2021-01-06 14:17:00,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:00,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127700798] [2021-01-06 14:17:00,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1816 backedges. 1314 proven. 155 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2021-01-06 14:17:01,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127700798] [2021-01-06 14:17:01,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428701735] [2021-01-06 14:17:01,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:17:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:01,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:17:01,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:17:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1816 backedges. 701 proven. 0 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2021-01-06 14:17:02,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:17:02,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 14:17:02,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809871044] [2021-01-06 14:17:02,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:17:02,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:02,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:17:02,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:17:02,112 INFO L87 Difference]: Start difference. First operand 3208 states and 3339 transitions. Second operand 3 states. [2021-01-06 14:17:02,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:02,672 INFO L93 Difference]: Finished difference Result 7126 states and 7421 transitions. [2021-01-06 14:17:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:17:02,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 790 [2021-01-06 14:17:02,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:02,677 INFO L225 Difference]: With dead ends: 7126 [2021-01-06 14:17:02,678 INFO L226 Difference]: Without dead ends: 3920 [2021-01-06 14:17:02,681 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 793 GetRequests, 790 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:17:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2021-01-06 14:17:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2021-01-06 14:17:02,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2021-01-06 14:17:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3882 transitions. [2021-01-06 14:17:02,734 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3882 transitions. Word has length 790 [2021-01-06 14:17:02,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:02,735 INFO L481 AbstractCegarLoop]: Abstraction has 3742 states and 3882 transitions. [2021-01-06 14:17:02,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:17:02,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3882 transitions. [2021-01-06 14:17:02,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 861 [2021-01-06 14:17:02,746 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:02,746 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:02,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-06 14:17:02,961 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:02,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:02,962 INFO L82 PathProgramCache]: Analyzing trace with hash -758893509, now seen corresponding path program 1 times [2021-01-06 14:17:02,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:02,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947647509] [2021-01-06 14:17:02,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1961 backedges. 1459 proven. 155 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2021-01-06 14:17:03,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947647509] [2021-01-06 14:17:03,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110403910] [2021-01-06 14:17:03,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:17:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:03,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:17:03,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:17:04,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1961 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2021-01-06 14:17:04,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:17:04,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 14:17:04,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251627275] [2021-01-06 14:17:04,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:17:04,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:04,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:17:04,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:17:04,820 INFO L87 Difference]: Start difference. First operand 3742 states and 3882 transitions. Second operand 3 states. [2021-01-06 14:17:05,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:05,367 INFO L93 Difference]: Finished difference Result 7660 states and 7941 transitions. [2021-01-06 14:17:05,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:17:05,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 860 [2021-01-06 14:17:05,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:05,381 INFO L225 Difference]: With dead ends: 7660 [2021-01-06 14:17:05,381 INFO L226 Difference]: Without dead ends: 3920 [2021-01-06 14:17:05,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 863 GetRequests, 860 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:17:05,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2021-01-06 14:17:05,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3564. [2021-01-06 14:17:05,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2021-01-06 14:17:05,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3688 transitions. [2021-01-06 14:17:05,439 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3688 transitions. Word has length 860 [2021-01-06 14:17:05,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:05,439 INFO L481 AbstractCegarLoop]: Abstraction has 3564 states and 3688 transitions. [2021-01-06 14:17:05,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:17:05,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3688 transitions. [2021-01-06 14:17:05,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 866 [2021-01-06 14:17:05,450 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:05,451 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:05,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-06 14:17:05,666 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:05,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:05,667 INFO L82 PathProgramCache]: Analyzing trace with hash -710833124, now seen corresponding path program 1 times [2021-01-06 14:17:05,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:05,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249457969] [2021-01-06 14:17:05,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2298 backedges. 1688 proven. 155 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2021-01-06 14:17:06,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249457969] [2021-01-06 14:17:06,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639228752] [2021-01-06 14:17:06,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:17:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:06,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 1094 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:17:06,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:17:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2298 backedges. 1688 proven. 155 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2021-01-06 14:17:07,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 14:17:07,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 14:17:07,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145506439] [2021-01-06 14:17:07,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:17:07,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:07,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:17:07,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:17:07,481 INFO L87 Difference]: Start difference. First operand 3564 states and 3688 transitions. Second operand 4 states. [2021-01-06 14:17:08,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:08,296 INFO L93 Difference]: Finished difference Result 7838 states and 8117 transitions. [2021-01-06 14:17:08,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:17:08,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 865 [2021-01-06 14:17:08,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:08,307 INFO L225 Difference]: With dead ends: 7838 [2021-01-06 14:17:08,307 INFO L226 Difference]: Without dead ends: 4276 [2021-01-06 14:17:08,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 868 GetRequests, 866 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:17:08,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2021-01-06 14:17:08,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 3920. [2021-01-06 14:17:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2021-01-06 14:17:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4065 transitions. [2021-01-06 14:17:08,409 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4065 transitions. Word has length 865 [2021-01-06 14:17:08,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:08,410 INFO L481 AbstractCegarLoop]: Abstraction has 3920 states and 4065 transitions. [2021-01-06 14:17:08,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:17:08,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4065 transitions. [2021-01-06 14:17:08,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2021-01-06 14:17:08,426 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:08,426 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:08,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-06 14:17:08,641 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:08,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:08,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2093710832, now seen corresponding path program 1 times [2021-01-06 14:17:08,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:08,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760642811] [2021-01-06 14:17:08,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 1846 proven. 93 refuted. 0 times theorem prover too weak. 913 trivial. 0 not checked. [2021-01-06 14:17:10,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760642811] [2021-01-06 14:17:10,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554395948] [2021-01-06 14:17:10,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:17:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:10,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 1206 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:17:10,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:17:11,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 1939 proven. 0 refuted. 0 times theorem prover too weak. 913 trivial. 0 not checked. [2021-01-06 14:17:11,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:17:11,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:17:11,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608261259] [2021-01-06 14:17:11,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:17:11,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:11,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:17:11,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:17:11,416 INFO L87 Difference]: Start difference. First operand 3920 states and 4065 transitions. Second operand 3 states. [2021-01-06 14:17:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:11,950 INFO L93 Difference]: Finished difference Result 8016 states and 8308 transitions. [2021-01-06 14:17:11,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:17:11,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 955 [2021-01-06 14:17:11,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:11,957 INFO L225 Difference]: With dead ends: 8016 [2021-01-06 14:17:11,957 INFO L226 Difference]: Without dead ends: 4098 [2021-01-06 14:17:11,962 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 958 GetRequests, 954 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:17:11,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2021-01-06 14:17:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3742. [2021-01-06 14:17:12,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2021-01-06 14:17:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3882 transitions. [2021-01-06 14:17:12,016 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3882 transitions. Word has length 955 [2021-01-06 14:17:12,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:12,017 INFO L481 AbstractCegarLoop]: Abstraction has 3742 states and 3882 transitions. [2021-01-06 14:17:12,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:17:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3882 transitions. [2021-01-06 14:17:12,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2021-01-06 14:17:12,031 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:12,032 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:12,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-06 14:17:12,248 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:12,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:12,249 INFO L82 PathProgramCache]: Analyzing trace with hash 538441961, now seen corresponding path program 1 times [2021-01-06 14:17:12,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:12,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852617347] [2021-01-06 14:17:12,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:13,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3493 backedges. 2444 proven. 72 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2021-01-06 14:17:13,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852617347] [2021-01-06 14:17:13,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915210302] [2021-01-06 14:17:13,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:17:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:13,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 14:17:13,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:17:14,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3493 backedges. 2157 proven. 0 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2021-01-06 14:17:14,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:17:14,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2021-01-06 14:17:14,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12009989] [2021-01-06 14:17:14,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:17:14,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:14,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:17:14,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:17:14,832 INFO L87 Difference]: Start difference. First operand 3742 states and 3882 transitions. Second operand 4 states. [2021-01-06 14:17:15,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:15,754 INFO L93 Difference]: Finished difference Result 8550 states and 8863 transitions. [2021-01-06 14:17:15,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:17:15,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1032 [2021-01-06 14:17:15,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:15,767 INFO L225 Difference]: With dead ends: 8550 [2021-01-06 14:17:15,768 INFO L226 Difference]: Without dead ends: 4810 [2021-01-06 14:17:15,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1036 GetRequests, 1031 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:17:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2021-01-06 14:17:15,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4098. [2021-01-06 14:17:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2021-01-06 14:17:15,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4247 transitions. [2021-01-06 14:17:15,833 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4247 transitions. Word has length 1032 [2021-01-06 14:17:15,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:15,834 INFO L481 AbstractCegarLoop]: Abstraction has 4098 states and 4247 transitions. [2021-01-06 14:17:15,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:17:15,834 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4247 transitions. [2021-01-06 14:17:15,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1066 [2021-01-06 14:17:15,847 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:15,848 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:16,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:17:16,062 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:16,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:16,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1881927302, now seen corresponding path program 1 times [2021-01-06 14:17:16,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:16,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472804321] [2021-01-06 14:17:16,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:17,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3681 backedges. 1700 proven. 0 refuted. 0 times theorem prover too weak. 1981 trivial. 0 not checked. [2021-01-06 14:17:17,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472804321] [2021-01-06 14:17:17,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:17:17,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:17:17,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665289908] [2021-01-06 14:17:17,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:17:17,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:17,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:17:17,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:17:17,105 INFO L87 Difference]: Start difference. First operand 4098 states and 4247 transitions. Second operand 3 states. [2021-01-06 14:17:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:17,698 INFO L93 Difference]: Finished difference Result 8372 states and 8671 transitions. [2021-01-06 14:17:17,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:17:17,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1065 [2021-01-06 14:17:17,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:17,706 INFO L225 Difference]: With dead ends: 8372 [2021-01-06 14:17:17,706 INFO L226 Difference]: Without dead ends: 4276 [2021-01-06 14:17:17,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:17:17,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2021-01-06 14:17:17,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4098. [2021-01-06 14:17:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2021-01-06 14:17:17,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4204 transitions. [2021-01-06 14:17:17,772 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4204 transitions. Word has length 1065 [2021-01-06 14:17:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:17,773 INFO L481 AbstractCegarLoop]: Abstraction has 4098 states and 4204 transitions. [2021-01-06 14:17:17,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:17:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4204 transitions. [2021-01-06 14:17:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1180 [2021-01-06 14:17:17,790 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:17,791 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:17,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 14:17:17,791 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:17,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:17,792 INFO L82 PathProgramCache]: Analyzing trace with hash 2044517406, now seen corresponding path program 1 times [2021-01-06 14:17:17,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:17,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185169361] [2021-01-06 14:17:17,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:19,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4623 backedges. 1942 proven. 0 refuted. 0 times theorem prover too weak. 2681 trivial. 0 not checked. [2021-01-06 14:17:19,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185169361] [2021-01-06 14:17:19,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:17:19,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:17:19,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581171177] [2021-01-06 14:17:19,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:17:19,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:19,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:17:19,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:17:19,079 INFO L87 Difference]: Start difference. First operand 4098 states and 4204 transitions. Second operand 3 states. [2021-01-06 14:17:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:19,657 INFO L93 Difference]: Finished difference Result 8194 states and 8406 transitions. [2021-01-06 14:17:19,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:17:19,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1179 [2021-01-06 14:17:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:19,664 INFO L225 Difference]: With dead ends: 8194 [2021-01-06 14:17:19,665 INFO L226 Difference]: Without dead ends: 4098 [2021-01-06 14:17:19,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:17:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2021-01-06 14:17:19,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 4098. [2021-01-06 14:17:19,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2021-01-06 14:17:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4200 transitions. [2021-01-06 14:17:19,729 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4200 transitions. Word has length 1179 [2021-01-06 14:17:19,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:19,730 INFO L481 AbstractCegarLoop]: Abstraction has 4098 states and 4200 transitions. [2021-01-06 14:17:19,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:17:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4200 transitions. [2021-01-06 14:17:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1494 [2021-01-06 14:17:19,753 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:19,754 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:19,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 14:17:19,754 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:19,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:19,755 INFO L82 PathProgramCache]: Analyzing trace with hash 56811543, now seen corresponding path program 1 times [2021-01-06 14:17:19,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:19,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741820349] [2021-01-06 14:17:19,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7035 backedges. 4438 proven. 252 refuted. 0 times theorem prover too weak. 2345 trivial. 0 not checked. [2021-01-06 14:17:23,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741820349] [2021-01-06 14:17:23,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068596635] [2021-01-06 14:17:23,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:17:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:23,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 1834 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:17:23,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:17:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7035 backedges. 2426 proven. 0 refuted. 0 times theorem prover too weak. 4609 trivial. 0 not checked. [2021-01-06 14:17:25,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:17:25,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 14:17:25,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546818773] [2021-01-06 14:17:25,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:17:25,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:25,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:17:25,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:17:25,308 INFO L87 Difference]: Start difference. First operand 4098 states and 4200 transitions. Second operand 3 states. [2021-01-06 14:17:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:25,886 INFO L93 Difference]: Finished difference Result 8550 states and 8758 transitions. [2021-01-06 14:17:25,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:17:25,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1493 [2021-01-06 14:17:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:25,895 INFO L225 Difference]: With dead ends: 8550 [2021-01-06 14:17:25,895 INFO L226 Difference]: Without dead ends: 4454 [2021-01-06 14:17:25,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1497 GetRequests, 1492 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:17:25,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2021-01-06 14:17:25,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2021-01-06 14:17:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2021-01-06 14:17:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4550 transitions. [2021-01-06 14:17:25,957 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4550 transitions. Word has length 1493 [2021-01-06 14:17:25,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:25,958 INFO L481 AbstractCegarLoop]: Abstraction has 4454 states and 4550 transitions. [2021-01-06 14:17:25,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:17:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4550 transitions. [2021-01-06 14:17:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1693 [2021-01-06 14:17:25,991 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:25,992 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:26,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:17:26,208 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:26,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:26,209 INFO L82 PathProgramCache]: Analyzing trace with hash -2049595045, now seen corresponding path program 1 times [2021-01-06 14:17:26,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:26,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097097963] [2021-01-06 14:17:26,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9366 backedges. 2557 proven. 0 refuted. 0 times theorem prover too weak. 6809 trivial. 0 not checked. [2021-01-06 14:17:28,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097097963] [2021-01-06 14:17:28,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:17:28,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:17:28,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437773533] [2021-01-06 14:17:28,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:17:28,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:28,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:17:28,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:17:28,311 INFO L87 Difference]: Start difference. First operand 4454 states and 4550 transitions. Second operand 3 states. [2021-01-06 14:17:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:28,913 INFO L93 Difference]: Finished difference Result 9262 states and 9456 transitions. [2021-01-06 14:17:28,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:17:28,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1692 [2021-01-06 14:17:28,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:28,921 INFO L225 Difference]: With dead ends: 9262 [2021-01-06 14:17:28,922 INFO L226 Difference]: Without dead ends: 4632 [2021-01-06 14:17:28,927 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:17:28,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2021-01-06 14:17:28,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4276. [2021-01-06 14:17:28,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2021-01-06 14:17:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4360 transitions. [2021-01-06 14:17:28,995 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4360 transitions. Word has length 1692 [2021-01-06 14:17:28,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:28,997 INFO L481 AbstractCegarLoop]: Abstraction has 4276 states and 4360 transitions. [2021-01-06 14:17:28,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:17:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4360 transitions. [2021-01-06 14:17:29,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1726 [2021-01-06 14:17:29,029 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:29,030 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:29,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 14:17:29,031 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:29,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:29,032 INFO L82 PathProgramCache]: Analyzing trace with hash -2062969772, now seen corresponding path program 1 times [2021-01-06 14:17:29,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:29,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077848069] [2021-01-06 14:17:29,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:31,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9719 backedges. 6578 proven. 0 refuted. 0 times theorem prover too weak. 3141 trivial. 0 not checked. [2021-01-06 14:17:31,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077848069] [2021-01-06 14:17:31,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:17:31,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 14:17:31,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973080877] [2021-01-06 14:17:31,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:17:31,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:31,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:17:31,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:17:31,613 INFO L87 Difference]: Start difference. First operand 4276 states and 4360 transitions. Second operand 4 states. [2021-01-06 14:17:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:32,646 INFO L93 Difference]: Finished difference Result 8550 states and 8724 transitions. [2021-01-06 14:17:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:17:32,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1725 [2021-01-06 14:17:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:32,651 INFO L225 Difference]: With dead ends: 8550 [2021-01-06 14:17:32,652 INFO L226 Difference]: Without dead ends: 4454 [2021-01-06 14:17:32,654 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 [2021-01-06 14:17:32,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2021-01-06 14:17:32,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4276. [2021-01-06 14:17:32,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2021-01-06 14:17:32,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4349 transitions. [2021-01-06 14:17:32,697 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4349 transitions. Word has length 1725 [2021-01-06 14:17:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:32,698 INFO L481 AbstractCegarLoop]: Abstraction has 4276 states and 4349 transitions. [2021-01-06 14:17:32,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:17:32,698 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4349 transitions. [2021-01-06 14:17:32,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1743 [2021-01-06 14:17:32,726 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:32,727 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:32,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 14:17:32,727 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:32,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:32,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1952577186, now seen corresponding path program 1 times [2021-01-06 14:17:32,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:32,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336980666] [2021-01-06 14:17:32,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9519 backedges. 2756 proven. 1045 refuted. 0 times theorem prover too weak. 5718 trivial. 0 not checked. [2021-01-06 14:17:35,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336980666] [2021-01-06 14:17:35,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935568684] [2021-01-06 14:17:35,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:17:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:36,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 2133 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:17:36,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:17:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9519 backedges. 3801 proven. 0 refuted. 0 times theorem prover too weak. 5718 trivial. 0 not checked. [2021-01-06 14:17:38,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:17:38,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:17:38,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673822163] [2021-01-06 14:17:38,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:17:38,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:38,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:17:38,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:17:38,643 INFO L87 Difference]: Start difference. First operand 4276 states and 4349 transitions. Second operand 3 states. [2021-01-06 14:17:39,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:39,234 INFO L93 Difference]: Finished difference Result 8372 states and 8510 transitions. [2021-01-06 14:17:39,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:17:39,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1742 [2021-01-06 14:17:39,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:39,239 INFO L225 Difference]: With dead ends: 8372 [2021-01-06 14:17:39,239 INFO L226 Difference]: Without dead ends: 3386 [2021-01-06 14:17:39,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1745 GetRequests, 1741 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:17:39,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2021-01-06 14:17:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3386. [2021-01-06 14:17:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2021-01-06 14:17:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3426 transitions. [2021-01-06 14:17:39,273 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3426 transitions. Word has length 1742 [2021-01-06 14:17:39,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:39,275 INFO L481 AbstractCegarLoop]: Abstraction has 3386 states and 3426 transitions. [2021-01-06 14:17:39,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:17:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3426 transitions. [2021-01-06 14:17:39,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1814 [2021-01-06 14:17:39,299 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:39,300 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:39,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-01-06 14:17:39,513 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:39,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:39,514 INFO L82 PathProgramCache]: Analyzing trace with hash -354861792, now seen corresponding path program 1 times [2021-01-06 14:17:39,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:39,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284273918] [2021-01-06 14:17:39,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 10875 backedges. 2724 proven. 0 refuted. 0 times theorem prover too weak. 8151 trivial. 0 not checked. [2021-01-06 14:17:41,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284273918] [2021-01-06 14:17:41,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:17:41,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 14:17:41,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074624455] [2021-01-06 14:17:41,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:17:41,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:41,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:17:41,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:17:41,599 INFO L87 Difference]: Start difference. First operand 3386 states and 3426 transitions. Second operand 4 states. [2021-01-06 14:17:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:42,522 INFO L93 Difference]: Finished difference Result 4278 states and 4333 transitions. [2021-01-06 14:17:42,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:17:42,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1813 [2021-01-06 14:17:42,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:42,527 INFO L225 Difference]: With dead ends: 4278 [2021-01-06 14:17:42,527 INFO L226 Difference]: Without dead ends: 4098 [2021-01-06 14:17:42,528 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 [2021-01-06 14:17:42,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2021-01-06 14:17:42,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3742. [2021-01-06 14:17:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2021-01-06 14:17:42,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3791 transitions. [2021-01-06 14:17:42,563 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3791 transitions. Word has length 1813 [2021-01-06 14:17:42,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:42,565 INFO L481 AbstractCegarLoop]: Abstraction has 3742 states and 3791 transitions. [2021-01-06 14:17:42,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:17:42,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3791 transitions. [2021-01-06 14:17:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2015 [2021-01-06 14:17:42,592 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:42,593 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:42,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 14:17:42,593 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:42,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:42,594 INFO L82 PathProgramCache]: Analyzing trace with hash 891606446, now seen corresponding path program 1 times [2021-01-06 14:17:42,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:42,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456146760] [2021-01-06 14:17:42,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 13756 backedges. 9287 proven. 184 refuted. 0 times theorem prover too weak. 4285 trivial. 0 not checked. [2021-01-06 14:17:48,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456146760] [2021-01-06 14:17:48,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102351625] [2021-01-06 14:17:48,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:17:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:48,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 2467 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:17:48,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:17:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 13756 backedges. 4568 proven. 0 refuted. 0 times theorem prover too weak. 9188 trivial. 0 not checked. [2021-01-06 14:17:52,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:17:52,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 14:17:52,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701877070] [2021-01-06 14:17:52,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:17:52,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:52,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:17:52,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-01-06 14:17:52,786 INFO L87 Difference]: Start difference. First operand 3742 states and 3791 transitions. Second operand 4 states. [2021-01-06 14:17:53,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:53,605 INFO L93 Difference]: Finished difference Result 4990 states and 5065 transitions. [2021-01-06 14:17:53,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:17:53,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2014 [2021-01-06 14:17:53,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:53,613 INFO L225 Difference]: With dead ends: 4990 [2021-01-06 14:17:53,613 INFO L226 Difference]: Without dead ends: 3742 [2021-01-06 14:17:53,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2018 GetRequests, 2012 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-01-06 14:17:53,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2021-01-06 14:17:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3742. [2021-01-06 14:17:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2021-01-06 14:17:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3785 transitions. [2021-01-06 14:17:53,646 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3785 transitions. Word has length 2014 [2021-01-06 14:17:53,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:53,647 INFO L481 AbstractCegarLoop]: Abstraction has 3742 states and 3785 transitions. [2021-01-06 14:17:53,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:17:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3785 transitions. [2021-01-06 14:17:53,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2116 [2021-01-06 14:17:53,678 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:53,679 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:53,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:17:53,880 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:53,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:53,881 INFO L82 PathProgramCache]: Analyzing trace with hash 58677289, now seen corresponding path program 1 times [2021-01-06 14:17:53,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:53,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140234395] [2021-01-06 14:17:53,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 14461 backedges. 3142 proven. 0 refuted. 0 times theorem prover too weak. 11319 trivial. 0 not checked. [2021-01-06 14:17:56,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140234395] [2021-01-06 14:17:56,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:17:56,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 14:17:56,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288636391] [2021-01-06 14:17:56,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:17:56,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:56,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:17:56,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:17:56,551 INFO L87 Difference]: Start difference. First operand 3742 states and 3785 transitions. Second operand 4 states. [2021-01-06 14:17:57,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:57,143 INFO L93 Difference]: Finished difference Result 3742 states and 3785 transitions. [2021-01-06 14:17:57,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:17:57,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2115 [2021-01-06 14:17:57,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:57,145 INFO L225 Difference]: With dead ends: 3742 [2021-01-06 14:17:57,145 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 14:17:57,147 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 [2021-01-06 14:17:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 14:17:57,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 14:17:57,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 14:17:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 14:17:57,148 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2115 [2021-01-06 14:17:57,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:57,148 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 14:17:57,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:17:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 14:17:57,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 14:17:57,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 14:17:57,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 14:17:57,332 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 142 [2021-01-06 14:17:57,473 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 142 [2021-01-06 14:17:58,451 WARN L197 SmtUtils]: Spent 973.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 74 [2021-01-06 14:17:59,544 WARN L197 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 131 DAG size of output: 74 [2021-01-06 14:17:59,549 INFO L189 CegarLoopUtils]: For program point L762(lines 762 880) no Hoare annotation was computed. [2021-01-06 14:17:59,549 INFO L189 CegarLoopUtils]: For program point L895(line 895) no Hoare annotation was computed. [2021-01-06 14:17:59,549 INFO L189 CegarLoopUtils]: For program point L829(lines 829 880) no Hoare annotation was computed. [2021-01-06 14:17:59,549 INFO L189 CegarLoopUtils]: For program point L631(lines 631 880) no Hoare annotation was computed. [2021-01-06 14:17:59,549 INFO L189 CegarLoopUtils]: For program point L565(lines 565 880) no Hoare annotation was computed. [2021-01-06 14:17:59,549 INFO L189 CegarLoopUtils]: For program point L169-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,550 INFO L189 CegarLoopUtils]: For program point L103-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,550 INFO L189 CegarLoopUtils]: For program point L37-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,550 INFO L189 CegarLoopUtils]: For program point L698(lines 698 880) no Hoare annotation was computed. [2021-01-06 14:17:59,550 INFO L189 CegarLoopUtils]: For program point L500(lines 500 880) no Hoare annotation was computed. [2021-01-06 14:17:59,550 INFO L189 CegarLoopUtils]: For program point L170(line 170) no Hoare annotation was computed. [2021-01-06 14:17:59,550 INFO L189 CegarLoopUtils]: For program point L104(line 104) no Hoare annotation was computed. [2021-01-06 14:17:59,550 INFO L189 CegarLoopUtils]: For program point L38(line 38) no Hoare annotation was computed. [2021-01-06 14:17:59,550 INFO L189 CegarLoopUtils]: For program point L369(lines 369 880) no Hoare annotation was computed. [2021-01-06 14:17:59,551 INFO L189 CegarLoopUtils]: For program point L303(lines 303 880) no Hoare annotation was computed. [2021-01-06 14:17:59,551 INFO L189 CegarLoopUtils]: For program point L436(lines 436 880) no Hoare annotation was computed. [2021-01-06 14:17:59,551 INFO L189 CegarLoopUtils]: For program point L172-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,551 INFO L189 CegarLoopUtils]: For program point L106-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,551 INFO L189 CegarLoopUtils]: For program point L40-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,551 INFO L189 CegarLoopUtils]: For program point L239(lines 239 880) no Hoare annotation was computed. [2021-01-06 14:17:59,551 INFO L189 CegarLoopUtils]: For program point L173(line 173) no Hoare annotation was computed. [2021-01-06 14:17:59,551 INFO L189 CegarLoopUtils]: For program point L107(line 107) no Hoare annotation was computed. [2021-01-06 14:17:59,551 INFO L189 CegarLoopUtils]: For program point L41(line 41) no Hoare annotation was computed. [2021-01-06 14:17:59,551 INFO L189 CegarLoopUtils]: For program point L768(lines 768 880) no Hoare annotation was computed. [2021-01-06 14:17:59,551 INFO L189 CegarLoopUtils]: For program point L636(lines 636 880) no Hoare annotation was computed. [2021-01-06 14:17:59,551 INFO L189 CegarLoopUtils]: For program point L835(lines 835 880) no Hoare annotation was computed. [2021-01-06 14:17:59,551 INFO L189 CegarLoopUtils]: For program point L571(lines 571 880) no Hoare annotation was computed. [2021-01-06 14:17:59,552 INFO L189 CegarLoopUtils]: For program point L505(lines 505 880) no Hoare annotation was computed. [2021-01-06 14:17:59,552 INFO L189 CegarLoopUtils]: For program point L175-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,552 INFO L189 CegarLoopUtils]: For program point L109-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,552 INFO L189 CegarLoopUtils]: For program point L43-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,552 INFO L189 CegarLoopUtils]: For program point L704(lines 704 880) no Hoare annotation was computed. [2021-01-06 14:17:59,552 INFO L189 CegarLoopUtils]: For program point L176(line 176) no Hoare annotation was computed. [2021-01-06 14:17:59,552 INFO L189 CegarLoopUtils]: For program point L110(line 110) no Hoare annotation was computed. [2021-01-06 14:17:59,552 INFO L189 CegarLoopUtils]: For program point L44(line 44) no Hoare annotation was computed. [2021-01-06 14:17:59,552 INFO L189 CegarLoopUtils]: For program point L309(lines 309 880) no Hoare annotation was computed. [2021-01-06 14:17:59,552 INFO L189 CegarLoopUtils]: For program point L442(lines 442 880) no Hoare annotation was computed. [2021-01-06 14:17:59,552 INFO L189 CegarLoopUtils]: For program point L376(lines 376 880) no Hoare annotation was computed. [2021-01-06 14:17:59,552 INFO L189 CegarLoopUtils]: For program point L178-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,553 INFO L189 CegarLoopUtils]: For program point L112-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,553 INFO L189 CegarLoopUtils]: For program point L46-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,553 INFO L189 CegarLoopUtils]: For program point L245(lines 245 880) no Hoare annotation was computed. [2021-01-06 14:17:59,553 INFO L189 CegarLoopUtils]: For program point L179(line 179) no Hoare annotation was computed. [2021-01-06 14:17:59,553 INFO L189 CegarLoopUtils]: For program point L113(line 113) no Hoare annotation was computed. [2021-01-06 14:17:59,553 INFO L189 CegarLoopUtils]: For program point L47(line 47) no Hoare annotation was computed. [2021-01-06 14:17:59,553 INFO L189 CegarLoopUtils]: For program point L774(lines 774 880) no Hoare annotation was computed. [2021-01-06 14:17:59,553 INFO L189 CegarLoopUtils]: For program point L642(lines 642 880) no Hoare annotation was computed. [2021-01-06 14:17:59,553 INFO L189 CegarLoopUtils]: For program point L510(lines 510 880) no Hoare annotation was computed. [2021-01-06 14:17:59,553 INFO L189 CegarLoopUtils]: For program point L841(lines 841 880) no Hoare annotation was computed. [2021-01-06 14:17:59,554 INFO L189 CegarLoopUtils]: For program point L181-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,554 INFO L189 CegarLoopUtils]: For program point L115-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,554 INFO L189 CegarLoopUtils]: For program point L49-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,554 INFO L189 CegarLoopUtils]: For program point L710(lines 710 880) no Hoare annotation was computed. [2021-01-06 14:17:59,554 INFO L189 CegarLoopUtils]: For program point L578(lines 578 880) no Hoare annotation was computed. [2021-01-06 14:17:59,554 INFO L189 CegarLoopUtils]: For program point L182(line 182) no Hoare annotation was computed. [2021-01-06 14:17:59,554 INFO L189 CegarLoopUtils]: For program point L116(line 116) no Hoare annotation was computed. [2021-01-06 14:17:59,554 INFO L189 CegarLoopUtils]: For program point L50(line 50) no Hoare annotation was computed. [2021-01-06 14:17:59,554 INFO L189 CegarLoopUtils]: For program point L315(lines 315 880) no Hoare annotation was computed. [2021-01-06 14:17:59,554 INFO L189 CegarLoopUtils]: For program point L448(lines 448 880) no Hoare annotation was computed. [2021-01-06 14:17:59,554 INFO L189 CegarLoopUtils]: For program point L382(lines 382 880) no Hoare annotation was computed. [2021-01-06 14:17:59,555 INFO L189 CegarLoopUtils]: For program point L184-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,555 INFO L189 CegarLoopUtils]: For program point L118-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,555 INFO L189 CegarLoopUtils]: For program point L52-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,555 INFO L189 CegarLoopUtils]: For program point L251(lines 251 880) no Hoare annotation was computed. [2021-01-06 14:17:59,555 INFO L189 CegarLoopUtils]: For program point L185(line 185) no Hoare annotation was computed. [2021-01-06 14:17:59,555 INFO L189 CegarLoopUtils]: For program point L119(line 119) no Hoare annotation was computed. [2021-01-06 14:17:59,555 INFO L189 CegarLoopUtils]: For program point L53(line 53) no Hoare annotation was computed. [2021-01-06 14:17:59,555 INFO L189 CegarLoopUtils]: For program point L648(lines 648 880) no Hoare annotation was computed. [2021-01-06 14:17:59,555 INFO L189 CegarLoopUtils]: For program point L516(lines 516 880) no Hoare annotation was computed. [2021-01-06 14:17:59,555 INFO L189 CegarLoopUtils]: For program point L847(lines 847 880) no Hoare annotation was computed. [2021-01-06 14:17:59,555 INFO L189 CegarLoopUtils]: For program point L781(lines 781 880) no Hoare annotation was computed. [2021-01-06 14:17:59,555 INFO L189 CegarLoopUtils]: For program point L583(lines 583 880) no Hoare annotation was computed. [2021-01-06 14:17:59,556 INFO L189 CegarLoopUtils]: For program point L187-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,556 INFO L189 CegarLoopUtils]: For program point L121-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,556 INFO L189 CegarLoopUtils]: For program point L55-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,556 INFO L189 CegarLoopUtils]: For program point L716(lines 716 880) no Hoare annotation was computed. [2021-01-06 14:17:59,556 INFO L189 CegarLoopUtils]: For program point L188(line 188) no Hoare annotation was computed. [2021-01-06 14:17:59,556 INFO L189 CegarLoopUtils]: For program point L122(line 122) no Hoare annotation was computed. [2021-01-06 14:17:59,556 INFO L189 CegarLoopUtils]: For program point L56(line 56) no Hoare annotation was computed. [2021-01-06 14:17:59,556 INFO L189 CegarLoopUtils]: For program point L321(lines 321 880) no Hoare annotation was computed. [2021-01-06 14:17:59,556 INFO L189 CegarLoopUtils]: For program point L454(lines 454 880) no Hoare annotation was computed. [2021-01-06 14:17:59,556 INFO L189 CegarLoopUtils]: For program point L388(lines 388 880) no Hoare annotation was computed. [2021-01-06 14:17:59,556 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 14:17:59,556 INFO L189 CegarLoopUtils]: For program point L190-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,557 INFO L189 CegarLoopUtils]: For program point L124-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,557 INFO L189 CegarLoopUtils]: For program point L58-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,557 INFO L189 CegarLoopUtils]: For program point L257(lines 257 880) no Hoare annotation was computed. [2021-01-06 14:17:59,557 INFO L189 CegarLoopUtils]: For program point L191(line 191) no Hoare annotation was computed. [2021-01-06 14:17:59,557 INFO L189 CegarLoopUtils]: For program point L125(line 125) no Hoare annotation was computed. [2021-01-06 14:17:59,557 INFO L189 CegarLoopUtils]: For program point L59(line 59) no Hoare annotation was computed. [2021-01-06 14:17:59,557 INFO L189 CegarLoopUtils]: For program point L852(lines 852 880) no Hoare annotation was computed. [2021-01-06 14:17:59,557 INFO L189 CegarLoopUtils]: For program point L654(lines 654 880) no Hoare annotation was computed. [2021-01-06 14:17:59,557 INFO L189 CegarLoopUtils]: For program point L522(lines 522 880) no Hoare annotation was computed. [2021-01-06 14:17:59,557 INFO L189 CegarLoopUtils]: For program point L787(lines 787 880) no Hoare annotation was computed. [2021-01-06 14:17:59,557 INFO L189 CegarLoopUtils]: For program point L589(lines 589 880) no Hoare annotation was computed. [2021-01-06 14:17:59,557 INFO L189 CegarLoopUtils]: For program point L193-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,557 INFO L189 CegarLoopUtils]: For program point L127-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,557 INFO L189 CegarLoopUtils]: For program point L61-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,557 INFO L189 CegarLoopUtils]: For program point L722(lines 722 880) no Hoare annotation was computed. [2021-01-06 14:17:59,557 INFO L189 CegarLoopUtils]: For program point L194(line 194) no Hoare annotation was computed. [2021-01-06 14:17:59,557 INFO L189 CegarLoopUtils]: For program point L128(line 128) no Hoare annotation was computed. [2021-01-06 14:17:59,558 INFO L189 CegarLoopUtils]: For program point L62(line 62) no Hoare annotation was computed. [2021-01-06 14:17:59,558 INFO L189 CegarLoopUtils]: For program point L459(lines 459 880) no Hoare annotation was computed. [2021-01-06 14:17:59,558 INFO L189 CegarLoopUtils]: For program point L327(lines 327 880) no Hoare annotation was computed. [2021-01-06 14:17:59,558 INFO L189 CegarLoopUtils]: For program point L394(lines 394 880) no Hoare annotation was computed. [2021-01-06 14:17:59,558 INFO L189 CegarLoopUtils]: For program point L262(lines 262 880) no Hoare annotation was computed. [2021-01-06 14:17:59,558 INFO L189 CegarLoopUtils]: For program point L196-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,558 INFO L189 CegarLoopUtils]: For program point L130-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,558 INFO L189 CegarLoopUtils]: For program point L64-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,558 INFO L189 CegarLoopUtils]: For program point L197(line 197) no Hoare annotation was computed. [2021-01-06 14:17:59,558 INFO L189 CegarLoopUtils]: For program point L131(line 131) no Hoare annotation was computed. [2021-01-06 14:17:59,558 INFO L189 CegarLoopUtils]: For program point L65(line 65) no Hoare annotation was computed. [2021-01-06 14:17:59,558 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 14:17:59,558 INFO L189 CegarLoopUtils]: For program point L858(lines 858 880) no Hoare annotation was computed. [2021-01-06 14:17:59,558 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2021-01-06 14:17:59,558 INFO L189 CegarLoopUtils]: For program point L660(lines 660 880) no Hoare annotation was computed. [2021-01-06 14:17:59,558 INFO L189 CegarLoopUtils]: For program point L528(lines 528 880) no Hoare annotation was computed. [2021-01-06 14:17:59,558 INFO L189 CegarLoopUtils]: For program point L793(lines 793 880) no Hoare annotation was computed. [2021-01-06 14:17:59,559 INFO L189 CegarLoopUtils]: For program point L595(lines 595 880) no Hoare annotation was computed. [2021-01-06 14:17:59,559 INFO L189 CegarLoopUtils]: For program point L199-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,559 INFO L189 CegarLoopUtils]: For program point L133-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,559 INFO L189 CegarLoopUtils]: For program point L67-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,559 INFO L189 CegarLoopUtils]: For program point L728(lines 728 880) no Hoare annotation was computed. [2021-01-06 14:17:59,559 INFO L189 CegarLoopUtils]: For program point L464(lines 464 880) no Hoare annotation was computed. [2021-01-06 14:17:59,559 INFO L189 CegarLoopUtils]: For program point L200(line 200) no Hoare annotation was computed. [2021-01-06 14:17:59,559 INFO L189 CegarLoopUtils]: For program point L134(line 134) no Hoare annotation was computed. [2021-01-06 14:17:59,559 INFO L189 CegarLoopUtils]: For program point L68(line 68) no Hoare annotation was computed. [2021-01-06 14:17:59,559 INFO L189 CegarLoopUtils]: For program point L333(lines 333 880) no Hoare annotation was computed. [2021-01-06 14:17:59,559 INFO L189 CegarLoopUtils]: For program point L400(lines 400 880) no Hoare annotation was computed. [2021-01-06 14:17:59,559 INFO L189 CegarLoopUtils]: For program point L268(lines 268 880) no Hoare annotation was computed. [2021-01-06 14:17:59,559 INFO L189 CegarLoopUtils]: For program point L202-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,559 INFO L189 CegarLoopUtils]: For program point L136-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,560 INFO L189 CegarLoopUtils]: For program point L70-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,560 INFO L189 CegarLoopUtils]: For program point L203(line 203) no Hoare annotation was computed. [2021-01-06 14:17:59,560 INFO L189 CegarLoopUtils]: For program point L137(line 137) no Hoare annotation was computed. [2021-01-06 14:17:59,560 INFO L189 CegarLoopUtils]: For program point L71(line 71) no Hoare annotation was computed. [2021-01-06 14:17:59,560 INFO L189 CegarLoopUtils]: For program point L864(lines 864 880) no Hoare annotation was computed. [2021-01-06 14:17:59,560 INFO L189 CegarLoopUtils]: For program point L666(lines 666 880) no Hoare annotation was computed. [2021-01-06 14:17:59,560 INFO L189 CegarLoopUtils]: For program point L534(lines 534 880) no Hoare annotation was computed. [2021-01-06 14:17:59,560 INFO L189 CegarLoopUtils]: For program point L799(lines 799 880) no Hoare annotation was computed. [2021-01-06 14:17:59,560 INFO L189 CegarLoopUtils]: For program point L601(lines 601 880) no Hoare annotation was computed. [2021-01-06 14:17:59,560 INFO L189 CegarLoopUtils]: For program point L205-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,561 INFO L189 CegarLoopUtils]: For program point L139-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,561 INFO L189 CegarLoopUtils]: For program point L73-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,561 INFO L189 CegarLoopUtils]: For program point L734(lines 734 880) no Hoare annotation was computed. [2021-01-06 14:17:59,561 INFO L189 CegarLoopUtils]: For program point L470(lines 470 880) no Hoare annotation was computed. [2021-01-06 14:17:59,561 INFO L189 CegarLoopUtils]: For program point L206(line 206) no Hoare annotation was computed. [2021-01-06 14:17:59,561 INFO L189 CegarLoopUtils]: For program point L140(line 140) no Hoare annotation was computed. [2021-01-06 14:17:59,561 INFO L189 CegarLoopUtils]: For program point L74(line 74) no Hoare annotation was computed. [2021-01-06 14:17:59,561 INFO L189 CegarLoopUtils]: For program point L339(lines 339 880) no Hoare annotation was computed. [2021-01-06 14:17:59,561 INFO L189 CegarLoopUtils]: For program point L406(lines 406 880) no Hoare annotation was computed. [2021-01-06 14:17:59,561 INFO L189 CegarLoopUtils]: For program point L274(lines 274 880) no Hoare annotation was computed. [2021-01-06 14:17:59,561 INFO L189 CegarLoopUtils]: For program point L208-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,562 INFO L189 CegarLoopUtils]: For program point L142-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,562 INFO L189 CegarLoopUtils]: For program point L76-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,562 INFO L189 CegarLoopUtils]: For program point L869(lines 869 880) no Hoare annotation was computed. [2021-01-06 14:17:59,562 INFO L189 CegarLoopUtils]: For program point L209(line 209) no Hoare annotation was computed. [2021-01-06 14:17:59,562 INFO L189 CegarLoopUtils]: For program point L143(line 143) no Hoare annotation was computed. [2021-01-06 14:17:59,562 INFO L189 CegarLoopUtils]: For program point L77(line 77) no Hoare annotation was computed. [2021-01-06 14:17:59,562 INFO L189 CegarLoopUtils]: For program point L672(lines 672 880) no Hoare annotation was computed. [2021-01-06 14:17:59,562 INFO L189 CegarLoopUtils]: For program point L540(lines 540 880) no Hoare annotation was computed. [2021-01-06 14:17:59,562 INFO L189 CegarLoopUtils]: For program point L805(lines 805 880) no Hoare annotation was computed. [2021-01-06 14:17:59,562 INFO L189 CegarLoopUtils]: For program point L607(lines 607 880) no Hoare annotation was computed. [2021-01-06 14:17:59,562 INFO L189 CegarLoopUtils]: For program point L211-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,563 INFO L189 CegarLoopUtils]: For program point L145-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,563 INFO L189 CegarLoopUtils]: For program point L79-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,563 INFO L189 CegarLoopUtils]: For program point L740(lines 740 880) no Hoare annotation was computed. [2021-01-06 14:17:59,563 INFO L189 CegarLoopUtils]: For program point L212(line 212) no Hoare annotation was computed. [2021-01-06 14:17:59,563 INFO L189 CegarLoopUtils]: For program point L146(line 146) no Hoare annotation was computed. [2021-01-06 14:17:59,563 INFO L189 CegarLoopUtils]: For program point L80(line 80) no Hoare annotation was computed. [2021-01-06 14:17:59,563 INFO L189 CegarLoopUtils]: For program point L477(lines 477 880) no Hoare annotation was computed. [2021-01-06 14:17:59,563 INFO L189 CegarLoopUtils]: For program point L345(lines 345 880) no Hoare annotation was computed. [2021-01-06 14:17:59,563 INFO L189 CegarLoopUtils]: For program point L279(lines 279 880) no Hoare annotation was computed. [2021-01-06 14:17:59,563 INFO L189 CegarLoopUtils]: For program point L412(lines 412 880) no Hoare annotation was computed. [2021-01-06 14:17:59,564 INFO L189 CegarLoopUtils]: For program point L148-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,564 INFO L189 CegarLoopUtils]: For program point L82-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,564 INFO L189 CegarLoopUtils]: For program point L875(lines 875 880) no Hoare annotation was computed. [2021-01-06 14:17:59,564 INFO L189 CegarLoopUtils]: For program point L149(line 149) no Hoare annotation was computed. [2021-01-06 14:17:59,564 INFO L189 CegarLoopUtils]: For program point L83(line 83) no Hoare annotation was computed. [2021-01-06 14:17:59,564 INFO L189 CegarLoopUtils]: For program point L678(lines 678 880) no Hoare annotation was computed. [2021-01-06 14:17:59,564 INFO L189 CegarLoopUtils]: For program point L546(lines 546 880) no Hoare annotation was computed. [2021-01-06 14:17:59,564 INFO L189 CegarLoopUtils]: For program point L811(lines 811 880) no Hoare annotation was computed. [2021-01-06 14:17:59,564 INFO L189 CegarLoopUtils]: For program point L745(lines 745 880) no Hoare annotation was computed. [2021-01-06 14:17:59,564 INFO L189 CegarLoopUtils]: For program point L613(lines 613 880) no Hoare annotation was computed. [2021-01-06 14:17:59,564 INFO L189 CegarLoopUtils]: For program point L151-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,565 INFO L189 CegarLoopUtils]: For program point L85-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,565 INFO L189 CegarLoopUtils]: For program point L482(lines 482 880) no Hoare annotation was computed. [2021-01-06 14:17:59,565 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 14:17:59,565 INFO L189 CegarLoopUtils]: For program point L152(line 152) no Hoare annotation was computed. [2021-01-06 14:17:59,565 INFO L189 CegarLoopUtils]: For program point L86(line 86) no Hoare annotation was computed. [2021-01-06 14:17:59,565 INFO L189 CegarLoopUtils]: For program point L351(lines 351 880) no Hoare annotation was computed. [2021-01-06 14:17:59,565 INFO L189 CegarLoopUtils]: For program point L285(lines 285 880) no Hoare annotation was computed. [2021-01-06 14:17:59,565 INFO L189 CegarLoopUtils]: For program point L418(lines 418 880) no Hoare annotation was computed. [2021-01-06 14:17:59,565 INFO L189 CegarLoopUtils]: For program point L154-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,565 INFO L189 CegarLoopUtils]: For program point L88-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,566 INFO L185 CegarLoopUtils]: At program point L881(lines 30 882) the Hoare annotation is: (let ((.cse12 (<= ~a12~0 11)) (.cse5 (<= ~a21~0 7)) (.cse1 (= ~a24~0 1)) (.cse4 (<= ~a15~0 8))) (let ((.cse3 (<= ~a12~0 76)) (.cse0 (<= 8 ~a21~0)) (.cse2 (<= ~a21~0 8)) (.cse11 (+ ~a12~0 43)) (.cse6 (< 80 ~a12~0)) (.cse8 (<= ~a15~0 6)) (.cse10 (or (and .cse5 .cse12 .cse1 .cse4) (and .cse5 (<= 7 ~a21~0) .cse1 .cse4))) (.cse9 (<= ~a15~0 7)) (.cse7 (<= 10 ~a21~0))) (or (and (<= 8 ~a15~0) .cse0 .cse1 .cse2 .cse3) (and .cse4 (or (and .cse5 .cse6 .cse1) (and .cse6 .cse1 .cse7))) (and .cse6 .cse1 (<= ~a12~0 73282) .cse2) (and (<= 9 ~a21~0) .cse1 .cse4 (<= ~a21~0 9) .cse3) (and (<= (+ ~a12~0 49) 0) .cse1 .cse4) (and .cse0 .cse1 (<= (+ ~a12~0 42) 0) .cse2) (and (<= (+ ~a12~0 9352) 0) (<= ~a21~0 6) .cse8) (and .cse9 .cse1 .cse7) (and .cse6 .cse1 (<= 9 ~a15~0) (<= ~a12~0 599999)) (and .cse10 (< 0 .cse11) .cse12) (and .cse5 (<= ~a24~0 1) (<= .cse11 0) .cse8) (and .cse9 .cse6 .cse1) (and .cse1 .cse8) (and .cse10 .cse9) (and .cse12 .cse1 .cse7)))) [2021-01-06 14:17:59,566 INFO L189 CegarLoopUtils]: For program point L551(lines 551 880) no Hoare annotation was computed. [2021-01-06 14:17:59,566 INFO L189 CegarLoopUtils]: For program point L221(lines 221 880) no Hoare annotation was computed. [2021-01-06 14:17:59,566 INFO L189 CegarLoopUtils]: For program point L155(line 155) no Hoare annotation was computed. [2021-01-06 14:17:59,566 INFO L189 CegarLoopUtils]: For program point L89(line 89) no Hoare annotation was computed. [2021-01-06 14:17:59,566 INFO L189 CegarLoopUtils]: For program point L684(lines 684 880) no Hoare annotation was computed. [2021-01-06 14:17:59,566 INFO L189 CegarLoopUtils]: For program point L817(lines 817 880) no Hoare annotation was computed. [2021-01-06 14:17:59,567 INFO L189 CegarLoopUtils]: For program point L751(lines 751 880) no Hoare annotation was computed. [2021-01-06 14:17:59,567 INFO L189 CegarLoopUtils]: For program point L619(lines 619 880) no Hoare annotation was computed. [2021-01-06 14:17:59,567 INFO L189 CegarLoopUtils]: For program point L157-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,567 INFO L189 CegarLoopUtils]: For program point L91-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,567 INFO L192 CegarLoopUtils]: At program point L884(lines 884 900) the Hoare annotation is: true [2021-01-06 14:17:59,567 INFO L189 CegarLoopUtils]: For program point L488(lines 488 880) no Hoare annotation was computed. [2021-01-06 14:17:59,567 INFO L189 CegarLoopUtils]: For program point L290(lines 290 880) no Hoare annotation was computed. [2021-01-06 14:17:59,567 INFO L189 CegarLoopUtils]: For program point L158(line 158) no Hoare annotation was computed. [2021-01-06 14:17:59,567 INFO L189 CegarLoopUtils]: For program point L92(line 92) no Hoare annotation was computed. [2021-01-06 14:17:59,567 INFO L189 CegarLoopUtils]: For program point L687(lines 687 880) no Hoare annotation was computed. [2021-01-06 14:17:59,568 INFO L189 CegarLoopUtils]: For program point L357(lines 357 880) no Hoare annotation was computed. [2021-01-06 14:17:59,568 INFO L189 CegarLoopUtils]: For program point L424(lines 424 880) no Hoare annotation was computed. [2021-01-06 14:17:59,568 INFO L189 CegarLoopUtils]: For program point L160-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,568 INFO L189 CegarLoopUtils]: For program point L94-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,568 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 14:17:59,568 INFO L189 CegarLoopUtils]: For program point L557(lines 557 880) no Hoare annotation was computed. [2021-01-06 14:17:59,568 INFO L189 CegarLoopUtils]: For program point L227(lines 227 880) no Hoare annotation was computed. [2021-01-06 14:17:59,568 INFO L189 CegarLoopUtils]: For program point L161(line 161) no Hoare annotation was computed. [2021-01-06 14:17:59,568 INFO L189 CegarLoopUtils]: For program point L95(line 95) no Hoare annotation was computed. [2021-01-06 14:17:59,568 INFO L189 CegarLoopUtils]: For program point L757(lines 757 880) no Hoare annotation was computed. [2021-01-06 14:17:59,568 INFO L189 CegarLoopUtils]: For program point L625(lines 625 880) no Hoare annotation was computed. [2021-01-06 14:17:59,568 INFO L189 CegarLoopUtils]: For program point L163-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,568 INFO L189 CegarLoopUtils]: For program point L97-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,569 INFO L189 CegarLoopUtils]: For program point L31(lines 31 33) no Hoare annotation was computed. [2021-01-06 14:17:59,569 INFO L189 CegarLoopUtils]: For program point L31-2(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,569 INFO L189 CegarLoopUtils]: For program point L824(lines 824 880) no Hoare annotation was computed. [2021-01-06 14:17:59,569 INFO L185 CegarLoopUtils]: At program point L890-2(lines 890 899) the Hoare annotation is: (let ((.cse12 (<= ~a12~0 11)) (.cse5 (<= ~a21~0 7)) (.cse1 (= ~a24~0 1)) (.cse4 (<= ~a15~0 8))) (let ((.cse3 (<= ~a12~0 76)) (.cse0 (<= 8 ~a21~0)) (.cse2 (<= ~a21~0 8)) (.cse11 (+ ~a12~0 43)) (.cse6 (< 80 ~a12~0)) (.cse8 (<= ~a15~0 6)) (.cse10 (or (and .cse5 .cse12 .cse1 .cse4) (and .cse5 (<= 7 ~a21~0) .cse1 .cse4))) (.cse9 (<= ~a15~0 7)) (.cse7 (<= 10 ~a21~0))) (or (and (<= 8 ~a15~0) .cse0 .cse1 .cse2 .cse3) (and .cse4 (or (and .cse5 .cse6 .cse1) (and .cse6 .cse1 .cse7))) (and .cse6 .cse1 (<= ~a12~0 73282) .cse2) (and (<= 9 ~a21~0) .cse1 .cse4 (<= ~a21~0 9) .cse3) (and (<= (+ ~a12~0 49) 0) .cse1 .cse4) (and .cse0 .cse1 (<= (+ ~a12~0 42) 0) .cse2) (and (<= (+ ~a12~0 9352) 0) (<= ~a21~0 6) .cse8) (and .cse9 .cse1 .cse7) (and .cse6 .cse1 (<= 9 ~a15~0) (<= ~a12~0 599999)) (and .cse10 (< 0 .cse11) .cse12) (and .cse5 (<= ~a24~0 1) (<= .cse11 0) .cse8) (and .cse9 .cse6 .cse1) (and .cse1 .cse8) (and .cse10 .cse9) (and .cse12 .cse1 .cse7)))) [2021-01-06 14:17:59,569 INFO L189 CegarLoopUtils]: For program point L494(lines 494 880) no Hoare annotation was computed. [2021-01-06 14:17:59,569 INFO L189 CegarLoopUtils]: For program point L296(lines 296 880) no Hoare annotation was computed. [2021-01-06 14:17:59,569 INFO L189 CegarLoopUtils]: For program point L164(line 164) no Hoare annotation was computed. [2021-01-06 14:17:59,570 INFO L189 CegarLoopUtils]: For program point L98(line 98) no Hoare annotation was computed. [2021-01-06 14:17:59,570 INFO L189 CegarLoopUtils]: For program point L32(line 32) no Hoare annotation was computed. [2021-01-06 14:17:59,570 INFO L189 CegarLoopUtils]: For program point L693(lines 693 880) no Hoare annotation was computed. [2021-01-06 14:17:59,570 INFO L189 CegarLoopUtils]: For program point L363(lines 363 880) no Hoare annotation was computed. [2021-01-06 14:17:59,570 INFO L189 CegarLoopUtils]: For program point L562(lines 562 880) no Hoare annotation was computed. [2021-01-06 14:17:59,570 INFO L189 CegarLoopUtils]: For program point L430(lines 430 880) no Hoare annotation was computed. [2021-01-06 14:17:59,570 INFO L189 CegarLoopUtils]: For program point L166-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,570 INFO L189 CegarLoopUtils]: For program point L100-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,570 INFO L189 CegarLoopUtils]: For program point L34-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:59,570 INFO L189 CegarLoopUtils]: For program point L233(lines 233 880) no Hoare annotation was computed. [2021-01-06 14:17:59,570 INFO L189 CegarLoopUtils]: For program point L167(line 167) no Hoare annotation was computed. [2021-01-06 14:17:59,571 INFO L189 CegarLoopUtils]: For program point L101(line 101) no Hoare annotation was computed. [2021-01-06 14:17:59,571 INFO L189 CegarLoopUtils]: For program point L35(line 35) no Hoare annotation was computed. [2021-01-06 14:17:59,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 02:17:59 BoogieIcfgContainer [2021-01-06 14:17:59,602 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 14:17:59,602 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 14:17:59,602 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 14:17:59,603 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 14:17:59,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 02:16:32" (3/4) ... [2021-01-06 14:17:59,607 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 14:17:59,653 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-01-06 14:17:59,658 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 14:17:59,662 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 14:17:59,664 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 14:17:59,848 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/eca-rers2012/Problem14_label51.c-witness.graphml [2021-01-06 14:17:59,848 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 14:17:59,849 INFO L168 Benchmark]: Toolchain (without parser) took 90303.26 ms. Allocated memory was 161.5 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 133.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 500.0 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:59,850 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 161.5 MB. Free memory is still 140.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 14:17:59,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.03 ms. Allocated memory is still 161.5 MB. Free memory was 133.8 MB in the beginning and 101.1 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.5 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:59,851 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.59 ms. Allocated memory is still 161.5 MB. Free memory was 101.1 MB in the beginning and 91.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:59,852 INFO L168 Benchmark]: Boogie Preprocessor took 85.52 ms. Allocated memory is still 161.5 MB. Free memory was 91.8 MB in the beginning and 85.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:59,852 INFO L168 Benchmark]: RCFGBuilder took 1960.07 ms. Allocated memory is still 161.5 MB. Free memory was 85.1 MB in the beginning and 115.5 MB in the end (delta: -30.4 MB). Peak memory consumption was 54.9 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:59,852 INFO L168 Benchmark]: TraceAbstraction took 87075.00 ms. Allocated memory was 161.5 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 114.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 460.8 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:59,853 INFO L168 Benchmark]: Witness Printer took 245.87 ms. Allocated memory is still 2.1 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:59,855 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 161.5 MB. Free memory is still 140.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 819.03 ms. Allocated memory is still 161.5 MB. Free memory was 133.8 MB in the beginning and 101.1 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 109.59 ms. Allocated memory is still 161.5 MB. Free memory was 101.1 MB in the beginning and 91.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 85.52 ms. Allocated memory is still 161.5 MB. Free memory was 91.8 MB in the beginning and 85.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1960.07 ms. Allocated memory is still 161.5 MB. Free memory was 85.1 MB in the beginning and 115.5 MB in the end (delta: -30.4 MB). Peak memory consumption was 54.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 87075.00 ms. Allocated memory was 161.5 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 114.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 460.8 MB. Max. memory is 8.0 GB. * Witness Printer took 245.87 ms. Allocated memory is still 2.1 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 884]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: (((((((((((((((((8 <= a15 && 8 <= a21) && a24 == 1) && a21 <= 8) && a12 <= 76) || (a15 <= 8 && (((a21 <= 7 && 80 < a12) && a24 == 1) || ((80 < a12 && a24 == 1) && 10 <= a21)))) || (((80 < a12 && a24 == 1) && a12 <= 73282) && a21 <= 8)) || ((((9 <= a21 && a24 == 1) && a15 <= 8) && a21 <= 9) && a12 <= 76)) || ((a12 + 49 <= 0 && a24 == 1) && a15 <= 8)) || (((8 <= a21 && a24 == 1) && a12 + 42 <= 0) && a21 <= 8)) || ((a12 + 9352 <= 0 && a21 <= 6) && a15 <= 6)) || ((a15 <= 7 && a24 == 1) && 10 <= a21)) || (((80 < a12 && a24 == 1) && 9 <= a15) && a12 <= 599999)) || ((((((a21 <= 7 && a12 <= 11) && a24 == 1) && a15 <= 8) || (((a21 <= 7 && 7 <= a21) && a24 == 1) && a15 <= 8)) && 0 < a12 + 43) && a12 <= 11)) || (((a21 <= 7 && a24 <= 1) && a12 + 43 <= 0) && a15 <= 6)) || ((a15 <= 7 && 80 < a12) && a24 == 1)) || (a24 == 1 && a15 <= 6)) || (((((a21 <= 7 && a12 <= 11) && a24 == 1) && a15 <= 8) || (((a21 <= 7 && 7 <= a21) && a24 == 1) && a15 <= 8)) && a15 <= 7)) || ((a12 <= 11 && a24 == 1) && 10 <= a21) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((((((((8 <= a15 && 8 <= a21) && a24 == 1) && a21 <= 8) && a12 <= 76) || (a15 <= 8 && (((a21 <= 7 && 80 < a12) && a24 == 1) || ((80 < a12 && a24 == 1) && 10 <= a21)))) || (((80 < a12 && a24 == 1) && a12 <= 73282) && a21 <= 8)) || ((((9 <= a21 && a24 == 1) && a15 <= 8) && a21 <= 9) && a12 <= 76)) || ((a12 + 49 <= 0 && a24 == 1) && a15 <= 8)) || (((8 <= a21 && a24 == 1) && a12 + 42 <= 0) && a21 <= 8)) || ((a12 + 9352 <= 0 && a21 <= 6) && a15 <= 6)) || ((a15 <= 7 && a24 == 1) && 10 <= a21)) || (((80 < a12 && a24 == 1) && 9 <= a15) && a12 <= 599999)) || ((((((a21 <= 7 && a12 <= 11) && a24 == 1) && a15 <= 8) || (((a21 <= 7 && 7 <= a21) && a24 == 1) && a15 <= 8)) && 0 < a12 + 43) && a12 <= 11)) || (((a21 <= 7 && a24 <= 1) && a12 + 43 <= 0) && a15 <= 6)) || ((a15 <= 7 && 80 < a12) && a24 == 1)) || (a24 == 1 && a15 <= 6)) || (((((a21 <= 7 && a12 <= 11) && a24 == 1) && a15 <= 8) || (((a21 <= 7 && 7 <= a21) && a24 == 1) && a15 <= 8)) && a15 <= 7)) || ((a12 <= 11 && a24 == 1) && 10 <= a21) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 84.5s, OverallIterations: 28, TraceHistogramMax: 18, AutomataDifference: 23.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3028 SDtfs, 3468 SDslu, 156 SDs, 0 SdLazy, 14326 SolverSat, 1261 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12885 GetRequests, 12810 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4988occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 5696 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 91 NumberOfFragments, 485 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5808 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 4130 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 4.9s SatisfiabilityAnalysisTime, 26.2s InterpolantComputationTime, 37216 NumberOfCodeBlocks, 37216 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 37174 ConstructedInterpolants, 0 QuantifiedInterpolants, 112309249 SizeOfPredicates, 0 NumberOfNonLiveVariables, 16137 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 42 InterpolantComputations, 27 PerfectInterpolantSequences, 148976/151743 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...