/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/Problem11_label24.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 03:39:56,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 03:39:56,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 03:39:57,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 03:39:57,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 03:39:57,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 03:39:57,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 03:39:57,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 03:39:57,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 03:39:57,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 03:39:57,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 03:39:57,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 03:39:57,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 03:39:57,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 03:39:57,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 03:39:57,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 03:39:57,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 03:39:57,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 03:39:57,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 03:39:57,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 03:39:57,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 03:39:57,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 03:39:57,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 03:39:57,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 03:39:57,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 03:39:57,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 03:39:57,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 03:39:57,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 03:39:57,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 03:39:57,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 03:39:57,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 03:39:57,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 03:39:57,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 03:39:57,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 03:39:57,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 03:39:57,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 03:39:57,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 03:39:57,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 03:39:57,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 03:39:57,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 03:39:57,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 03:39:57,104 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 03:39:57,135 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 03:39:57,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 03:39:57,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 03:39:57,139 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 03:39:57,139 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 03:39:57,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 03:39:57,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 03:39:57,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 03:39:57,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 03:39:57,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 03:39:57,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 03:39:57,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 03:39:57,143 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 03:39:57,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 03:39:57,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 03:39:57,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 03:39:57,145 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 03:39:57,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 03:39:57,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 03:39:57,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 03:39:57,145 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 03:39:57,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 03:39:57,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 03:39:57,146 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 03:39:57,146 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 03:39:57,146 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 03:39:57,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 03:39:57,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 03:39:57,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 03:39:57,575 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 03:39:57,576 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 03:39:57,577 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label24.c [2020-12-23 03:39:57,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7e88de230/6286c31924754b69afcda754c8546eb8/FLAGa50fb278b [2020-12-23 03:39:58,693 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 03:39:58,694 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label24.c [2020-12-23 03:39:58,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7e88de230/6286c31924754b69afcda754c8546eb8/FLAGa50fb278b [2020-12-23 03:39:58,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7e88de230/6286c31924754b69afcda754c8546eb8 [2020-12-23 03:39:58,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 03:39:58,805 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 03:39:58,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 03:39:58,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 03:39:58,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 03:39:58,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:39:58" (1/1) ... [2020-12-23 03:39:58,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25efa617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:39:58, skipping insertion in model container [2020-12-23 03:39:58,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:39:58" (1/1) ... [2020-12-23 03:39:58,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 03:39:58,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 03:39:59,151 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/Problem11_label24.c[7451,7464] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2020-12-23 03:39:59,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 03:39:59,663 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 03:39:59,737 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/Problem11_label24.c[7451,7464] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2020-12-23 03:39:59,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 03:39:59,946 INFO L208 MainTranslator]: Completed translation [2020-12-23 03:39:59,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:39:59 WrapperNode [2020-12-23 03:39:59,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 03:39:59,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 03:39:59,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 03:39:59,949 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 03:39:59,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:39:59" (1/1) ... [2020-12-23 03:40:00,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:39:59" (1/1) ... [2020-12-23 03:40:00,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 03:40:00,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 03:40:00,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 03:40:00,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 03:40:00,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:39:59" (1/1) ... [2020-12-23 03:40:00,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:39:59" (1/1) ... [2020-12-23 03:40:00,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:39:59" (1/1) ... [2020-12-23 03:40:00,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:39:59" (1/1) ... [2020-12-23 03:40:00,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:39:59" (1/1) ... [2020-12-23 03:40:00,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:39:59" (1/1) ... [2020-12-23 03:40:00,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:39:59" (1/1) ... [2020-12-23 03:40:00,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 03:40:00,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 03:40:00,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 03:40:00,254 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 03:40:00,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:39:59" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 03:40:00,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 03:40:00,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 03:40:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 03:40:00,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 03:40:02,675 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 03:40:02,675 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 03:40:02,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:40:02 BoogieIcfgContainer [2020-12-23 03:40:02,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 03:40:02,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 03:40:02,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 03:40:02,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 03:40:02,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 03:39:58" (1/3) ... [2020-12-23 03:40:02,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4be117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:40:02, skipping insertion in model container [2020-12-23 03:40:02,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:39:59" (2/3) ... [2020-12-23 03:40:02,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4be117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:40:02, skipping insertion in model container [2020-12-23 03:40:02,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:40:02" (3/3) ... [2020-12-23 03:40:02,694 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label24.c [2020-12-23 03:40:02,701 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 03:40:02,707 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 03:40:02,728 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 03:40:02,760 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 03:40:02,760 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 03:40:02,760 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 03:40:02,760 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 03:40:02,761 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 03:40:02,761 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 03:40:02,761 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 03:40:02,761 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 03:40:02,786 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2020-12-23 03:40:02,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-23 03:40:02,798 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:02,799 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:02,799 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:02,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:02,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2122806209, now seen corresponding path program 1 times [2020-12-23 03:40:02,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:02,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391067268] [2020-12-23 03:40:02,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:03,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:40:03,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391067268] [2020-12-23 03:40:03,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:03,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 03:40:03,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416963979] [2020-12-23 03:40:03,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:03,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:03,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:03,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:03,323 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 3 states. [2020-12-23 03:40:05,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:05,057 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2020-12-23 03:40:05,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:05,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-12-23 03:40:05,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:05,078 INFO L225 Difference]: With dead ends: 761 [2020-12-23 03:40:05,078 INFO L226 Difference]: Without dead ends: 413 [2020-12-23 03:40:05,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:05,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-12-23 03:40:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2020-12-23 03:40:05,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2020-12-23 03:40:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2020-12-23 03:40:05,170 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 51 [2020-12-23 03:40:05,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:05,171 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2020-12-23 03:40:05,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:05,172 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2020-12-23 03:40:05,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-12-23 03:40:05,186 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:05,187 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, 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] [2020-12-23 03:40:05,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 03:40:05,187 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:05,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:05,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1424628072, now seen corresponding path program 1 times [2020-12-23 03:40:05,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:05,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039785974] [2020-12-23 03:40:05,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:40:05,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039785974] [2020-12-23 03:40:05,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:05,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 03:40:05,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458292967] [2020-12-23 03:40:05,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:05,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:05,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:05,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:05,495 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand 3 states. [2020-12-23 03:40:06,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:06,820 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2020-12-23 03:40:06,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:06,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2020-12-23 03:40:06,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:06,827 INFO L225 Difference]: With dead ends: 1211 [2020-12-23 03:40:06,827 INFO L226 Difference]: Without dead ends: 800 [2020-12-23 03:40:06,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:06,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2020-12-23 03:40:06,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2020-12-23 03:40:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-12-23 03:40:06,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2020-12-23 03:40:06,915 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 119 [2020-12-23 03:40:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:06,916 INFO L481 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2020-12-23 03:40:06,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:06,916 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2020-12-23 03:40:06,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-23 03:40:06,919 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:06,919 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, 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] [2020-12-23 03:40:06,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 03:40:06,920 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:06,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:06,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1033925576, now seen corresponding path program 1 times [2020-12-23 03:40:06,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:06,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289861764] [2020-12-23 03:40:06,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:40:07,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289861764] [2020-12-23 03:40:07,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:07,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:07,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600593520] [2020-12-23 03:40:07,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:40:07,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:07,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:40:07,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:40:07,209 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand 4 states. [2020-12-23 03:40:09,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:09,592 INFO L93 Difference]: Finished difference Result 2505 states and 3428 transitions. [2020-12-23 03:40:09,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:40:09,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2020-12-23 03:40:09,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:09,606 INFO L225 Difference]: With dead ends: 2505 [2020-12-23 03:40:09,606 INFO L226 Difference]: Without dead ends: 1718 [2020-12-23 03:40:09,608 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 03:40:09,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2020-12-23 03:40:09,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1714. [2020-12-23 03:40:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1714 states. [2020-12-23 03:40:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2101 transitions. [2020-12-23 03:40:09,653 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2101 transitions. Word has length 120 [2020-12-23 03:40:09,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:09,653 INFO L481 AbstractCegarLoop]: Abstraction has 1714 states and 2101 transitions. [2020-12-23 03:40:09,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:40:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2101 transitions. [2020-12-23 03:40:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-12-23 03:40:09,657 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:09,657 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, 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, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:09,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 03:40:09,658 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:09,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:09,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1823083661, now seen corresponding path program 1 times [2020-12-23 03:40:09,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:09,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433248043] [2020-12-23 03:40:09,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:40:09,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433248043] [2020-12-23 03:40:09,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:09,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:09,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966384570] [2020-12-23 03:40:09,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:09,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:09,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:09,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:09,838 INFO L87 Difference]: Start difference. First operand 1714 states and 2101 transitions. Second operand 3 states. [2020-12-23 03:40:11,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:11,132 INFO L93 Difference]: Finished difference Result 4005 states and 5048 transitions. [2020-12-23 03:40:11,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:11,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-12-23 03:40:11,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:11,148 INFO L225 Difference]: With dead ends: 4005 [2020-12-23 03:40:11,148 INFO L226 Difference]: Without dead ends: 2477 [2020-12-23 03:40:11,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:11,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2020-12-23 03:40:11,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2474. [2020-12-23 03:40:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2020-12-23 03:40:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3044 transitions. [2020-12-23 03:40:11,212 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3044 transitions. Word has length 178 [2020-12-23 03:40:11,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:11,213 INFO L481 AbstractCegarLoop]: Abstraction has 2474 states and 3044 transitions. [2020-12-23 03:40:11,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:11,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3044 transitions. [2020-12-23 03:40:11,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2020-12-23 03:40:11,218 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:11,218 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:11,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 03:40:11,219 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:11,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:11,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1160646091, now seen corresponding path program 1 times [2020-12-23 03:40:11,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:11,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534613470] [2020-12-23 03:40:11,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:40:11,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534613470] [2020-12-23 03:40:11,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:11,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:11,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458758379] [2020-12-23 03:40:11,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:11,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:11,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:11,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:11,463 INFO L87 Difference]: Start difference. First operand 2474 states and 3044 transitions. Second operand 3 states. [2020-12-23 03:40:12,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:12,757 INFO L93 Difference]: Finished difference Result 5885 states and 7350 transitions. [2020-12-23 03:40:12,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:12,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2020-12-23 03:40:12,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:12,780 INFO L225 Difference]: With dead ends: 5885 [2020-12-23 03:40:12,781 INFO L226 Difference]: Without dead ends: 3597 [2020-12-23 03:40:12,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:12,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3597 states. [2020-12-23 03:40:12,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 3397. [2020-12-23 03:40:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3397 states. [2020-12-23 03:40:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4111 transitions. [2020-12-23 03:40:12,874 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4111 transitions. Word has length 231 [2020-12-23 03:40:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:12,875 INFO L481 AbstractCegarLoop]: Abstraction has 3397 states and 4111 transitions. [2020-12-23 03:40:12,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:12,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4111 transitions. [2020-12-23 03:40:12,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-12-23 03:40:12,880 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:12,880 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:12,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 03:40:12,881 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:12,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:12,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1440418757, now seen corresponding path program 1 times [2020-12-23 03:40:12,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:12,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467267675] [2020-12-23 03:40:12,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:40:13,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467267675] [2020-12-23 03:40:13,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:13,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 03:40:13,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350054846] [2020-12-23 03:40:13,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:40:13,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:13,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:40:13,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:40:13,172 INFO L87 Difference]: Start difference. First operand 3397 states and 4111 transitions. Second operand 4 states. [2020-12-23 03:40:15,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:15,825 INFO L93 Difference]: Finished difference Result 9581 states and 11902 transitions. [2020-12-23 03:40:15,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:40:15,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2020-12-23 03:40:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:15,864 INFO L225 Difference]: With dead ends: 9581 [2020-12-23 03:40:15,864 INFO L226 Difference]: Without dead ends: 6186 [2020-12-23 03:40:15,872 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:40:15,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6186 states. [2020-12-23 03:40:16,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6186 to 5987. [2020-12-23 03:40:16,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5987 states. [2020-12-23 03:40:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5987 states to 5987 states and 7314 transitions. [2020-12-23 03:40:16,027 INFO L78 Accepts]: Start accepts. Automaton has 5987 states and 7314 transitions. Word has length 232 [2020-12-23 03:40:16,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:16,028 INFO L481 AbstractCegarLoop]: Abstraction has 5987 states and 7314 transitions. [2020-12-23 03:40:16,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:40:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 5987 states and 7314 transitions. [2020-12-23 03:40:16,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2020-12-23 03:40:16,033 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:16,034 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:16,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 03:40:16,034 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:16,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:16,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1400544816, now seen corresponding path program 1 times [2020-12-23 03:40:16,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:16,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736047544] [2020-12-23 03:40:16,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:16,313 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-23 03:40:16,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736047544] [2020-12-23 03:40:16,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:16,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:16,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75763124] [2020-12-23 03:40:16,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:16,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:16,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:16,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:16,316 INFO L87 Difference]: Start difference. First operand 5987 states and 7314 transitions. Second operand 3 states. [2020-12-23 03:40:17,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:17,830 INFO L93 Difference]: Finished difference Result 13276 states and 16460 transitions. [2020-12-23 03:40:17,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:17,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2020-12-23 03:40:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:17,871 INFO L225 Difference]: With dead ends: 13276 [2020-12-23 03:40:17,872 INFO L226 Difference]: Without dead ends: 7659 [2020-12-23 03:40:17,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:17,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7659 states. [2020-12-23 03:40:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7659 to 7643. [2020-12-23 03:40:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7643 states. [2020-12-23 03:40:18,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7643 states to 7643 states and 9174 transitions. [2020-12-23 03:40:18,121 INFO L78 Accepts]: Start accepts. Automaton has 7643 states and 9174 transitions. Word has length 233 [2020-12-23 03:40:18,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:18,122 INFO L481 AbstractCegarLoop]: Abstraction has 7643 states and 9174 transitions. [2020-12-23 03:40:18,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:18,122 INFO L276 IsEmpty]: Start isEmpty. Operand 7643 states and 9174 transitions. [2020-12-23 03:40:18,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2020-12-23 03:40:18,128 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:18,128 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:18,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 03:40:18,129 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:18,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:18,129 INFO L82 PathProgramCache]: Analyzing trace with hash 826529202, now seen corresponding path program 1 times [2020-12-23 03:40:18,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:18,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772561546] [2020-12-23 03:40:18,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:40:18,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772561546] [2020-12-23 03:40:18,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:18,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:18,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649539164] [2020-12-23 03:40:18,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:40:18,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:18,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:40:18,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:40:18,356 INFO L87 Difference]: Start difference. First operand 7643 states and 9174 transitions. Second operand 4 states. [2020-12-23 03:40:20,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:20,775 INFO L93 Difference]: Finished difference Result 16401 states and 19943 transitions. [2020-12-23 03:40:20,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:40:20,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2020-12-23 03:40:20,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:20,817 INFO L225 Difference]: With dead ends: 16401 [2020-12-23 03:40:20,817 INFO L226 Difference]: Without dead ends: 9128 [2020-12-23 03:40:20,830 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:40:20,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9128 states. [2020-12-23 03:40:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9128 to 9119. [2020-12-23 03:40:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9119 states. [2020-12-23 03:40:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9119 states to 9119 states and 10868 transitions. [2020-12-23 03:40:21,041 INFO L78 Accepts]: Start accepts. Automaton has 9119 states and 10868 transitions. Word has length 243 [2020-12-23 03:40:21,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:21,042 INFO L481 AbstractCegarLoop]: Abstraction has 9119 states and 10868 transitions. [2020-12-23 03:40:21,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:40:21,042 INFO L276 IsEmpty]: Start isEmpty. Operand 9119 states and 10868 transitions. [2020-12-23 03:40:21,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2020-12-23 03:40:21,049 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:21,049 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:40:21,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 03:40:21,050 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:21,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:21,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1535621630, now seen corresponding path program 1 times [2020-12-23 03:40:21,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:21,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648215595] [2020-12-23 03:40:21,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:21,276 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-12-23 03:40:21,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648215595] [2020-12-23 03:40:21,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:21,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:21,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958837423] [2020-12-23 03:40:21,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:21,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:21,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:21,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:21,288 INFO L87 Difference]: Start difference. First operand 9119 states and 10868 transitions. Second operand 3 states. [2020-12-23 03:40:22,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:22,519 INFO L93 Difference]: Finished difference Result 19550 states and 23437 transitions. [2020-12-23 03:40:22,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:22,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2020-12-23 03:40:22,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:22,548 INFO L225 Difference]: With dead ends: 19550 [2020-12-23 03:40:22,549 INFO L226 Difference]: Without dead ends: 10802 [2020-12-23 03:40:22,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:22,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10802 states. [2020-12-23 03:40:22,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10802 to 10406. [2020-12-23 03:40:22,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10406 states. [2020-12-23 03:40:22,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10406 states to 10406 states and 12401 transitions. [2020-12-23 03:40:22,761 INFO L78 Accepts]: Start accepts. Automaton has 10406 states and 12401 transitions. Word has length 253 [2020-12-23 03:40:22,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:22,762 INFO L481 AbstractCegarLoop]: Abstraction has 10406 states and 12401 transitions. [2020-12-23 03:40:22,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand 10406 states and 12401 transitions. [2020-12-23 03:40:22,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2020-12-23 03:40:22,772 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:22,772 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, 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, 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] [2020-12-23 03:40:22,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 03:40:22,773 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:22,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:22,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1353186746, now seen corresponding path program 1 times [2020-12-23 03:40:22,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:22,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110382958] [2020-12-23 03:40:22,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-12-23 03:40:23,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110382958] [2020-12-23 03:40:23,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:23,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:23,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299296458] [2020-12-23 03:40:23,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:23,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:23,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:23,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:23,085 INFO L87 Difference]: Start difference. First operand 10406 states and 12401 transitions. Second operand 3 states. [2020-12-23 03:40:24,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:24,440 INFO L93 Difference]: Finished difference Result 20820 states and 24826 transitions. [2020-12-23 03:40:24,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:24,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2020-12-23 03:40:24,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:24,465 INFO L225 Difference]: With dead ends: 20820 [2020-12-23 03:40:24,466 INFO L226 Difference]: Without dead ends: 10600 [2020-12-23 03:40:24,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:24,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10600 states. [2020-12-23 03:40:24,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10600 to 10589. [2020-12-23 03:40:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10589 states. [2020-12-23 03:40:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10589 states to 10589 states and 12263 transitions. [2020-12-23 03:40:24,643 INFO L78 Accepts]: Start accepts. Automaton has 10589 states and 12263 transitions. Word has length 284 [2020-12-23 03:40:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:24,644 INFO L481 AbstractCegarLoop]: Abstraction has 10589 states and 12263 transitions. [2020-12-23 03:40:24,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 10589 states and 12263 transitions. [2020-12-23 03:40:24,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2020-12-23 03:40:24,657 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:24,657 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, 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, 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] [2020-12-23 03:40:24,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 03:40:24,658 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:24,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:24,658 INFO L82 PathProgramCache]: Analyzing trace with hash 263747274, now seen corresponding path program 1 times [2020-12-23 03:40:24,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:24,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45620658] [2020-12-23 03:40:24,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2020-12-23 03:40:24,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45620658] [2020-12-23 03:40:24,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:24,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:24,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472471065] [2020-12-23 03:40:24,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:24,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:24,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:24,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:24,971 INFO L87 Difference]: Start difference. First operand 10589 states and 12263 transitions. Second operand 3 states. [2020-12-23 03:40:26,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:26,398 INFO L93 Difference]: Finished difference Result 25597 states and 29894 transitions. [2020-12-23 03:40:26,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:26,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2020-12-23 03:40:26,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:26,433 INFO L225 Difference]: With dead ends: 25597 [2020-12-23 03:40:26,434 INFO L226 Difference]: Without dead ends: 15379 [2020-12-23 03:40:26,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:26,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15379 states. [2020-12-23 03:40:26,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15379 to 15373. [2020-12-23 03:40:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15373 states. [2020-12-23 03:40:26,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15373 states to 15373 states and 17769 transitions. [2020-12-23 03:40:26,791 INFO L78 Accepts]: Start accepts. Automaton has 15373 states and 17769 transitions. Word has length 322 [2020-12-23 03:40:26,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:26,792 INFO L481 AbstractCegarLoop]: Abstraction has 15373 states and 17769 transitions. [2020-12-23 03:40:26,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:26,792 INFO L276 IsEmpty]: Start isEmpty. Operand 15373 states and 17769 transitions. [2020-12-23 03:40:26,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2020-12-23 03:40:26,806 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:26,806 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, 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, 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] [2020-12-23 03:40:26,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 03:40:26,807 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:26,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:26,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1188223949, now seen corresponding path program 1 times [2020-12-23 03:40:26,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:26,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134943238] [2020-12-23 03:40:26,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-23 03:40:27,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134943238] [2020-12-23 03:40:27,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:27,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:27,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023975280] [2020-12-23 03:40:27,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:27,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:27,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:27,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:27,043 INFO L87 Difference]: Start difference. First operand 15373 states and 17769 transitions. Second operand 3 states. [2020-12-23 03:40:28,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:28,320 INFO L93 Difference]: Finished difference Result 29790 states and 34447 transitions. [2020-12-23 03:40:28,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:28,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2020-12-23 03:40:28,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:28,349 INFO L225 Difference]: With dead ends: 29790 [2020-12-23 03:40:28,349 INFO L226 Difference]: Without dead ends: 14788 [2020-12-23 03:40:28,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:28,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14788 states. [2020-12-23 03:40:28,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14788 to 14600. [2020-12-23 03:40:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2020-12-23 03:40:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 16131 transitions. [2020-12-23 03:40:28,661 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 16131 transitions. Word has length 325 [2020-12-23 03:40:28,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:28,662 INFO L481 AbstractCegarLoop]: Abstraction has 14600 states and 16131 transitions. [2020-12-23 03:40:28,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 16131 transitions. [2020-12-23 03:40:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2020-12-23 03:40:28,674 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:28,675 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, 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, 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] [2020-12-23 03:40:28,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 03:40:28,675 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:28,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:28,676 INFO L82 PathProgramCache]: Analyzing trace with hash -56733327, now seen corresponding path program 1 times [2020-12-23 03:40:28,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:28,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639440961] [2020-12-23 03:40:28,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:28,890 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-12-23 03:40:28,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639440961] [2020-12-23 03:40:28,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:28,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:28,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145149393] [2020-12-23 03:40:28,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:28,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:28,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:28,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:28,893 INFO L87 Difference]: Start difference. First operand 14600 states and 16131 transitions. Second operand 3 states. [2020-12-23 03:40:30,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:30,187 INFO L93 Difference]: Finished difference Result 31221 states and 34495 transitions. [2020-12-23 03:40:30,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:30,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2020-12-23 03:40:30,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:30,215 INFO L225 Difference]: With dead ends: 31221 [2020-12-23 03:40:30,216 INFO L226 Difference]: Without dead ends: 16991 [2020-12-23 03:40:30,228 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:30,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16991 states. [2020-12-23 03:40:30,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16991 to 10363. [2020-12-23 03:40:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10363 states. [2020-12-23 03:40:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10363 states to 10363 states and 11538 transitions. [2020-12-23 03:40:30,475 INFO L78 Accepts]: Start accepts. Automaton has 10363 states and 11538 transitions. Word has length 326 [2020-12-23 03:40:30,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:30,476 INFO L481 AbstractCegarLoop]: Abstraction has 10363 states and 11538 transitions. [2020-12-23 03:40:30,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:30,477 INFO L276 IsEmpty]: Start isEmpty. Operand 10363 states and 11538 transitions. [2020-12-23 03:40:30,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2020-12-23 03:40:30,493 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:30,493 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, 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, 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] [2020-12-23 03:40:30,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 03:40:30,494 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:30,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:30,495 INFO L82 PathProgramCache]: Analyzing trace with hash 234214298, now seen corresponding path program 1 times [2020-12-23 03:40:30,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:30,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614340911] [2020-12-23 03:40:30,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2020-12-23 03:40:30,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614340911] [2020-12-23 03:40:30,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:30,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 03:40:30,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471130445] [2020-12-23 03:40:30,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:30,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:30,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:30,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:30,945 INFO L87 Difference]: Start difference. First operand 10363 states and 11538 transitions. Second operand 3 states. [2020-12-23 03:40:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:31,610 INFO L93 Difference]: Finished difference Result 20352 states and 22690 transitions. [2020-12-23 03:40:31,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:31,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2020-12-23 03:40:31,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:31,630 INFO L225 Difference]: With dead ends: 20352 [2020-12-23 03:40:31,630 INFO L226 Difference]: Without dead ends: 10359 [2020-12-23 03:40:31,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:31,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10359 states. [2020-12-23 03:40:31,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10359 to 10359. [2020-12-23 03:40:31,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10359 states. [2020-12-23 03:40:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10359 states to 10359 states and 11528 transitions. [2020-12-23 03:40:31,786 INFO L78 Accepts]: Start accepts. Automaton has 10359 states and 11528 transitions. Word has length 333 [2020-12-23 03:40:31,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:31,787 INFO L481 AbstractCegarLoop]: Abstraction has 10359 states and 11528 transitions. [2020-12-23 03:40:31,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:31,787 INFO L276 IsEmpty]: Start isEmpty. Operand 10359 states and 11528 transitions. [2020-12-23 03:40:31,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2020-12-23 03:40:31,802 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:31,803 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, 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, 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, 1, 1, 1, 1, 1] [2020-12-23 03:40:31,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 03:40:31,803 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:31,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:31,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1309922959, now seen corresponding path program 1 times [2020-12-23 03:40:31,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:31,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592142058] [2020-12-23 03:40:31,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-12-23 03:40:32,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592142058] [2020-12-23 03:40:32,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:32,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:32,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872193211] [2020-12-23 03:40:32,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:32,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:32,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:32,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:32,135 INFO L87 Difference]: Start difference. First operand 10359 states and 11528 transitions. Second operand 3 states. [2020-12-23 03:40:33,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:33,483 INFO L93 Difference]: Finished difference Result 23844 states and 26484 transitions. [2020-12-23 03:40:33,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:33,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 357 [2020-12-23 03:40:33,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:33,504 INFO L225 Difference]: With dead ends: 23844 [2020-12-23 03:40:33,504 INFO L226 Difference]: Without dead ends: 12009 [2020-12-23 03:40:33,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:33,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12009 states. [2020-12-23 03:40:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12009 to 10905. [2020-12-23 03:40:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10905 states. [2020-12-23 03:40:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10905 states to 10905 states and 11944 transitions. [2020-12-23 03:40:33,673 INFO L78 Accepts]: Start accepts. Automaton has 10905 states and 11944 transitions. Word has length 357 [2020-12-23 03:40:33,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:33,673 INFO L481 AbstractCegarLoop]: Abstraction has 10905 states and 11944 transitions. [2020-12-23 03:40:33,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 10905 states and 11944 transitions. [2020-12-23 03:40:33,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2020-12-23 03:40:33,681 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:33,682 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, 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, 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] [2020-12-23 03:40:33,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 03:40:33,682 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:33,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:33,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1148869825, now seen corresponding path program 1 times [2020-12-23 03:40:33,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:33,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333314000] [2020-12-23 03:40:33,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:33,981 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2020-12-23 03:40:33,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333314000] [2020-12-23 03:40:33,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:33,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:33,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5785580] [2020-12-23 03:40:33,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:33,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:33,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:33,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:33,987 INFO L87 Difference]: Start difference. First operand 10905 states and 11944 transitions. Second operand 3 states. [2020-12-23 03:40:35,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:35,253 INFO L93 Difference]: Finished difference Result 23659 states and 25948 transitions. [2020-12-23 03:40:35,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:35,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 362 [2020-12-23 03:40:35,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:35,271 INFO L225 Difference]: With dead ends: 23659 [2020-12-23 03:40:35,271 INFO L226 Difference]: Without dead ends: 13124 [2020-12-23 03:40:35,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:35,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13124 states. [2020-12-23 03:40:35,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13124 to 12013. [2020-12-23 03:40:35,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12013 states. [2020-12-23 03:40:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12013 states to 12013 states and 13130 transitions. [2020-12-23 03:40:35,447 INFO L78 Accepts]: Start accepts. Automaton has 12013 states and 13130 transitions. Word has length 362 [2020-12-23 03:40:35,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:35,447 INFO L481 AbstractCegarLoop]: Abstraction has 12013 states and 13130 transitions. [2020-12-23 03:40:35,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:35,448 INFO L276 IsEmpty]: Start isEmpty. Operand 12013 states and 13130 transitions. [2020-12-23 03:40:35,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2020-12-23 03:40:35,456 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:35,457 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, 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, 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] [2020-12-23 03:40:35,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 03:40:35,457 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:35,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:35,458 INFO L82 PathProgramCache]: Analyzing trace with hash 827224776, now seen corresponding path program 1 times [2020-12-23 03:40:35,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:35,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515148729] [2020-12-23 03:40:35,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2020-12-23 03:40:35,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515148729] [2020-12-23 03:40:35,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:35,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:35,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408780954] [2020-12-23 03:40:35,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:40:35,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:35,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:40:35,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:40:35,903 INFO L87 Difference]: Start difference. First operand 12013 states and 13130 transitions. Second operand 4 states. [2020-12-23 03:40:37,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:37,998 INFO L93 Difference]: Finished difference Result 31400 states and 34348 transitions. [2020-12-23 03:40:37,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:40:37,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 372 [2020-12-23 03:40:37,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:38,017 INFO L225 Difference]: With dead ends: 31400 [2020-12-23 03:40:38,017 INFO L226 Difference]: Without dead ends: 19389 [2020-12-23 03:40:38,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:40:38,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19389 states. [2020-12-23 03:40:38,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19389 to 17913. [2020-12-23 03:40:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17913 states. [2020-12-23 03:40:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17913 states to 17913 states and 19535 transitions. [2020-12-23 03:40:38,281 INFO L78 Accepts]: Start accepts. Automaton has 17913 states and 19535 transitions. Word has length 372 [2020-12-23 03:40:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:38,281 INFO L481 AbstractCegarLoop]: Abstraction has 17913 states and 19535 transitions. [2020-12-23 03:40:38,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:40:38,281 INFO L276 IsEmpty]: Start isEmpty. Operand 17913 states and 19535 transitions. [2020-12-23 03:40:38,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2020-12-23 03:40:38,291 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:38,292 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, 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, 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, 1, 1] [2020-12-23 03:40:38,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 03:40:38,292 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:38,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:38,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1553293930, now seen corresponding path program 1 times [2020-12-23 03:40:38,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:38,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383096694] [2020-12-23 03:40:38,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 146 proven. 200 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-12-23 03:40:38,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383096694] [2020-12-23 03:40:38,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719254714] [2020-12-23 03:40:38,747 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 [2020-12-23 03:40:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:38,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-23 03:40:38,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 03:40:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 244 proven. 179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 03:40:40,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 03:40:40,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2020-12-23 03:40:40,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483414204] [2020-12-23 03:40:40,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 03:40:40,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:40,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 03:40:40,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-23 03:40:40,298 INFO L87 Difference]: Start difference. First operand 17913 states and 19535 transitions. Second operand 9 states. [2020-12-23 03:40:49,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:49,459 INFO L93 Difference]: Finished difference Result 52492 states and 57070 transitions. [2020-12-23 03:40:49,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 03:40:49,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 389 [2020-12-23 03:40:49,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:49,574 INFO L225 Difference]: With dead ends: 52492 [2020-12-23 03:40:49,575 INFO L226 Difference]: Without dead ends: 34397 [2020-12-23 03:40:49,593 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2020-12-23 03:40:49,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34397 states. [2020-12-23 03:40:50,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34397 to 32101. [2020-12-23 03:40:50,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32101 states. [2020-12-23 03:40:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32101 states to 32101 states and 34719 transitions. [2020-12-23 03:40:50,365 INFO L78 Accepts]: Start accepts. Automaton has 32101 states and 34719 transitions. Word has length 389 [2020-12-23 03:40:50,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:50,367 INFO L481 AbstractCegarLoop]: Abstraction has 32101 states and 34719 transitions. [2020-12-23 03:40:50,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 03:40:50,368 INFO L276 IsEmpty]: Start isEmpty. Operand 32101 states and 34719 transitions. [2020-12-23 03:40:50,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2020-12-23 03:40:50,385 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:50,386 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, 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, 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, 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] [2020-12-23 03:40:50,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 03:40:50,601 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:50,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:50,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1546004851, now seen corresponding path program 1 times [2020-12-23 03:40:50,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:50,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881520363] [2020-12-23 03:40:50,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2020-12-23 03:40:51,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881520363] [2020-12-23 03:40:51,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:51,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:51,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066420940] [2020-12-23 03:40:51,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 03:40:51,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:51,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 03:40:51,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:40:51,313 INFO L87 Difference]: Start difference. First operand 32101 states and 34719 transitions. Second operand 4 states. [2020-12-23 03:40:54,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:54,025 INFO L93 Difference]: Finished difference Result 65493 states and 70878 transitions. [2020-12-23 03:40:54,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 03:40:54,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 394 [2020-12-23 03:40:54,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:54,070 INFO L225 Difference]: With dead ends: 65493 [2020-12-23 03:40:54,070 INFO L226 Difference]: Without dead ends: 33762 [2020-12-23 03:40:54,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 03:40:54,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33762 states. [2020-12-23 03:40:54,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33762 to 30623. [2020-12-23 03:40:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30623 states. [2020-12-23 03:40:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30623 states to 30623 states and 33091 transitions. [2020-12-23 03:40:54,797 INFO L78 Accepts]: Start accepts. Automaton has 30623 states and 33091 transitions. Word has length 394 [2020-12-23 03:40:54,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:54,797 INFO L481 AbstractCegarLoop]: Abstraction has 30623 states and 33091 transitions. [2020-12-23 03:40:54,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 03:40:54,797 INFO L276 IsEmpty]: Start isEmpty. Operand 30623 states and 33091 transitions. [2020-12-23 03:40:54,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2020-12-23 03:40:54,806 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:54,806 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, 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, 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, 1, 1] [2020-12-23 03:40:54,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 03:40:54,807 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:54,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:54,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1216776914, now seen corresponding path program 1 times [2020-12-23 03:40:54,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:54,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929894224] [2020-12-23 03:40:54,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2020-12-23 03:40:55,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929894224] [2020-12-23 03:40:55,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:55,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:55,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818634728] [2020-12-23 03:40:55,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:55,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:55,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:55,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:55,324 INFO L87 Difference]: Start difference. First operand 30623 states and 33091 transitions. Second operand 3 states. [2020-12-23 03:40:56,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:56,866 INFO L93 Difference]: Finished difference Result 61974 states and 66993 transitions. [2020-12-23 03:40:56,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:56,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 403 [2020-12-23 03:40:56,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:56,909 INFO L225 Difference]: With dead ends: 61974 [2020-12-23 03:40:56,909 INFO L226 Difference]: Without dead ends: 31721 [2020-12-23 03:40:56,930 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:56,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31721 states. [2020-12-23 03:40:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31721 to 30982. [2020-12-23 03:40:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30982 states. [2020-12-23 03:40:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30982 states to 30982 states and 33315 transitions. [2020-12-23 03:40:57,527 INFO L78 Accepts]: Start accepts. Automaton has 30982 states and 33315 transitions. Word has length 403 [2020-12-23 03:40:57,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:40:57,527 INFO L481 AbstractCegarLoop]: Abstraction has 30982 states and 33315 transitions. [2020-12-23 03:40:57,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:40:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 30982 states and 33315 transitions. [2020-12-23 03:40:57,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2020-12-23 03:40:57,544 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:40:57,545 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, 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, 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, 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] [2020-12-23 03:40:57,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 03:40:57,545 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:40:57,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:40:57,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1148113260, now seen corresponding path program 1 times [2020-12-23 03:40:57,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:40:57,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415053607] [2020-12-23 03:40:57,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:40:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:40:58,216 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2020-12-23 03:40:58,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415053607] [2020-12-23 03:40:58,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:40:58,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:40:58,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777513878] [2020-12-23 03:40:58,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:40:58,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:40:58,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:40:58,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:58,218 INFO L87 Difference]: Start difference. First operand 30982 states and 33315 transitions. Second operand 3 states. [2020-12-23 03:40:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:40:59,598 INFO L93 Difference]: Finished difference Result 63982 states and 68823 transitions. [2020-12-23 03:40:59,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:40:59,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 434 [2020-12-23 03:40:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:40:59,642 INFO L225 Difference]: With dead ends: 63982 [2020-12-23 03:40:59,642 INFO L226 Difference]: Without dead ends: 33370 [2020-12-23 03:40:59,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:40:59,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33370 states. [2020-12-23 03:41:00,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33370 to 26924. [2020-12-23 03:41:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26924 states. [2020-12-23 03:41:00,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26924 states to 26924 states and 28800 transitions. [2020-12-23 03:41:00,229 INFO L78 Accepts]: Start accepts. Automaton has 26924 states and 28800 transitions. Word has length 434 [2020-12-23 03:41:00,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:41:00,229 INFO L481 AbstractCegarLoop]: Abstraction has 26924 states and 28800 transitions. [2020-12-23 03:41:00,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:41:00,229 INFO L276 IsEmpty]: Start isEmpty. Operand 26924 states and 28800 transitions. [2020-12-23 03:41:00,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2020-12-23 03:41:00,243 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:41:00,244 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:41:00,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 03:41:00,244 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:41:00,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:41:00,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1848032332, now seen corresponding path program 1 times [2020-12-23 03:41:00,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:41:00,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542128602] [2020-12-23 03:41:00,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:41:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 03:41:00,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542128602] [2020-12-23 03:41:00,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:41:00,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 03:41:00,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504104588] [2020-12-23 03:41:00,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:41:00,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:41:00,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:41:00,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:41:00,717 INFO L87 Difference]: Start difference. First operand 26924 states and 28800 transitions. Second operand 3 states. [2020-12-23 03:41:02,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:41:02,137 INFO L93 Difference]: Finished difference Result 52192 states and 55896 transitions. [2020-12-23 03:41:02,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:41:02,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 468 [2020-12-23 03:41:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:41:02,174 INFO L225 Difference]: With dead ends: 52192 [2020-12-23 03:41:02,174 INFO L226 Difference]: Without dead ends: 28032 [2020-12-23 03:41:02,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 03:41:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28032 states. [2020-12-23 03:41:02,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28032 to 26740. [2020-12-23 03:41:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26740 states. [2020-12-23 03:41:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26740 states to 26740 states and 28591 transitions. [2020-12-23 03:41:02,571 INFO L78 Accepts]: Start accepts. Automaton has 26740 states and 28591 transitions. Word has length 468 [2020-12-23 03:41:02,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:41:02,571 INFO L481 AbstractCegarLoop]: Abstraction has 26740 states and 28591 transitions. [2020-12-23 03:41:02,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:41:02,571 INFO L276 IsEmpty]: Start isEmpty. Operand 26740 states and 28591 transitions. [2020-12-23 03:41:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2020-12-23 03:41:02,581 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:41:02,581 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:41:02,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 03:41:02,581 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:41:02,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:41:02,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1117136727, now seen corresponding path program 1 times [2020-12-23 03:41:02,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:41:02,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079893421] [2020-12-23 03:41:02,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:41:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:03,022 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-23 03:41:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 365 proven. 36 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2020-12-23 03:41:03,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079893421] [2020-12-23 03:41:03,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609316618] [2020-12-23 03:41:03,615 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 [2020-12-23 03:41:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:03,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 03:41:03,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 03:41:04,469 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2020-12-23 03:41:04,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 03:41:04,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2020-12-23 03:41:04,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296193969] [2020-12-23 03:41:04,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 03:41:04,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:41:04,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 03:41:04,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-23 03:41:04,472 INFO L87 Difference]: Start difference. First operand 26740 states and 28591 transitions. Second operand 3 states. [2020-12-23 03:41:05,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:41:05,719 INFO L93 Difference]: Finished difference Result 50532 states and 54093 transitions. [2020-12-23 03:41:05,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 03:41:05,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 472 [2020-12-23 03:41:05,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:41:05,748 INFO L225 Difference]: With dead ends: 50532 [2020-12-23 03:41:05,748 INFO L226 Difference]: Without dead ends: 26372 [2020-12-23 03:41:05,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-23 03:41:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26372 states. [2020-12-23 03:41:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26372 to 26004. [2020-12-23 03:41:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26004 states. [2020-12-23 03:41:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26004 states to 26004 states and 27790 transitions. [2020-12-23 03:41:06,067 INFO L78 Accepts]: Start accepts. Automaton has 26004 states and 27790 transitions. Word has length 472 [2020-12-23 03:41:06,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:41:06,068 INFO L481 AbstractCegarLoop]: Abstraction has 26004 states and 27790 transitions. [2020-12-23 03:41:06,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 03:41:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 26004 states and 27790 transitions. [2020-12-23 03:41:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2020-12-23 03:41:06,086 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:41:06,087 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:41:06,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-12-23 03:41:06,300 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:41:06,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:41:06,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2131901513, now seen corresponding path program 1 times [2020-12-23 03:41:06,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:41:06,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083345938] [2020-12-23 03:41:06,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:41:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:07,623 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2020-12-23 03:41:07,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083345938] [2020-12-23 03:41:07,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 03:41:07,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 03:41:07,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815635897] [2020-12-23 03:41:07,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 03:41:07,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:41:07,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 03:41:07,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 03:41:07,626 INFO L87 Difference]: Start difference. First operand 26004 states and 27790 transitions. Second operand 6 states. [2020-12-23 03:41:10,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:41:10,642 INFO L93 Difference]: Finished difference Result 54855 states and 58603 transitions. [2020-12-23 03:41:10,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 03:41:10,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 523 [2020-12-23 03:41:10,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:41:10,678 INFO L225 Difference]: With dead ends: 54855 [2020-12-23 03:41:10,678 INFO L226 Difference]: Without dead ends: 31431 [2020-12-23 03:41:10,697 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-12-23 03:41:10,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31431 states. [2020-12-23 03:41:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31431 to 26926. [2020-12-23 03:41:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26926 states. [2020-12-23 03:41:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26926 states to 26926 states and 28791 transitions. [2020-12-23 03:41:11,144 INFO L78 Accepts]: Start accepts. Automaton has 26926 states and 28791 transitions. Word has length 523 [2020-12-23 03:41:11,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:41:11,145 INFO L481 AbstractCegarLoop]: Abstraction has 26926 states and 28791 transitions. [2020-12-23 03:41:11,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 03:41:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 26926 states and 28791 transitions. [2020-12-23 03:41:11,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2020-12-23 03:41:11,165 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:41:11,166 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 03:41:11,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 03:41:11,166 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:41:11,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:41:11,166 INFO L82 PathProgramCache]: Analyzing trace with hash 435204898, now seen corresponding path program 1 times [2020-12-23 03:41:11,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:41:11,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909328277] [2020-12-23 03:41:11,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:41:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 606 proven. 8 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2020-12-23 03:41:12,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909328277] [2020-12-23 03:41:12,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139011249] [2020-12-23 03:41:12,542 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 [2020-12-23 03:41:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:12,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 03:41:12,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 03:41:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 493 proven. 121 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2020-12-23 03:41:13,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 03:41:13,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2020-12-23 03:41:13,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105857908] [2020-12-23 03:41:13,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 03:41:13,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 03:41:13,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 03:41:13,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-23 03:41:13,983 INFO L87 Difference]: Start difference. First operand 26926 states and 28791 transitions. Second operand 9 states. [2020-12-23 03:41:20,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 03:41:20,551 INFO L93 Difference]: Finished difference Result 59841 states and 63896 transitions. [2020-12-23 03:41:20,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-23 03:41:20,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 533 [2020-12-23 03:41:20,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 03:41:20,591 INFO L225 Difference]: With dead ends: 59841 [2020-12-23 03:41:20,592 INFO L226 Difference]: Without dead ends: 33655 [2020-12-23 03:41:20,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2020-12-23 03:41:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33655 states. [2020-12-23 03:41:20,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33655 to 30606. [2020-12-23 03:41:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30606 states. [2020-12-23 03:41:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30606 states to 30606 states and 32641 transitions. [2020-12-23 03:41:21,023 INFO L78 Accepts]: Start accepts. Automaton has 30606 states and 32641 transitions. Word has length 533 [2020-12-23 03:41:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 03:41:21,023 INFO L481 AbstractCegarLoop]: Abstraction has 30606 states and 32641 transitions. [2020-12-23 03:41:21,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 03:41:21,024 INFO L276 IsEmpty]: Start isEmpty. Operand 30606 states and 32641 transitions. [2020-12-23 03:41:21,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2020-12-23 03:41:21,042 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 03:41:21,042 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, 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, 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, 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] [2020-12-23 03:41:21,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-12-23 03:41:21,258 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 03:41:21,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 03:41:21,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1729367067, now seen corresponding path program 1 times [2020-12-23 03:41:21,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 03:41:21,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65247830] [2020-12-23 03:41:21,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 03:41:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:21,988 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 390 proven. 206 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2020-12-23 03:41:21,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65247830] [2020-12-23 03:41:21,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570328953] [2020-12-23 03:41:21,989 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 [2020-12-23 03:41:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 03:41:22,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 03:41:22,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 03:41:22,876 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 03:41:22,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 03:41:22,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 03:41:23,102 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:23,263 INFO L757 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:23,486 INFO L757 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:23,920 INFO L757 QuantifierPusher]: Run 40 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:24,610 INFO L757 QuantifierPusher]: Run 50 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:25,710 INFO L757 QuantifierPusher]: Run 60 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:26,886 INFO L757 QuantifierPusher]: Run 70 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:27,669 INFO L757 QuantifierPusher]: Run 80 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:28,445 INFO L757 QuantifierPusher]: Run 90 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:29,737 INFO L757 QuantifierPusher]: Run 100 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:30,518 INFO L757 QuantifierPusher]: Run 110 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:31,406 INFO L757 QuantifierPusher]: Run 120 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:32,341 INFO L757 QuantifierPusher]: Run 130 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:33,475 INFO L757 QuantifierPusher]: Run 140 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:34,669 INFO L757 QuantifierPusher]: Run 150 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:35,933 INFO L757 QuantifierPusher]: Run 160 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:37,373 INFO L757 QuantifierPusher]: Run 170 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:39,259 INFO L757 QuantifierPusher]: Run 180 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:40,938 INFO L757 QuantifierPusher]: Run 190 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:42,808 INFO L757 QuantifierPusher]: Run 200 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:44,979 INFO L757 QuantifierPusher]: Run 210 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:47,513 INFO L757 QuantifierPusher]: Run 220 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:49,717 INFO L757 QuantifierPusher]: Run 230 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:51,949 INFO L757 QuantifierPusher]: Run 240 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:54,431 INFO L757 QuantifierPusher]: Run 250 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:41:57,523 INFO L757 QuantifierPusher]: Run 260 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:42:01,190 INFO L757 QuantifierPusher]: Run 270 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:42:05,642 INFO L757 QuantifierPusher]: Run 280 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:42:09,384 INFO L757 QuantifierPusher]: Run 290 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:42:12,954 INFO L757 QuantifierPusher]: Run 300 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:42:16,571 INFO L757 QuantifierPusher]: Run 310 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:42:20,561 INFO L757 QuantifierPusher]: Run 320 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:42:24,945 INFO L757 QuantifierPusher]: Run 330 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:42:30,182 INFO L757 QuantifierPusher]: Run 340 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:42:35,423 INFO L757 QuantifierPusher]: Run 350 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:42:40,991 INFO L757 QuantifierPusher]: Run 360 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:42:46,529 INFO L757 QuantifierPusher]: Run 370 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:42:52,658 INFO L757 QuantifierPusher]: Run 380 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:42:58,523 INFO L757 QuantifierPusher]: Run 390 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:43:04,629 INFO L757 QuantifierPusher]: Run 400 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:43:10,797 INFO L757 QuantifierPusher]: Run 410 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:43:17,847 INFO L757 QuantifierPusher]: Run 420 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:43:24,446 INFO L757 QuantifierPusher]: Run 430 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:43:31,001 INFO L757 QuantifierPusher]: Run 440 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:43:38,647 INFO L757 QuantifierPusher]: Run 450 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 03:43:46,158 INFO L757 QuantifierPusher]: Run 460 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug.