/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/eca-rers2012/Problem14_label53.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 14:16:30,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 14:16:30,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 14:16:30,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 14:16:30,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 14:16:30,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 14:16:30,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 14:16:30,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 14:16:30,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 14:16:30,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 14:16:30,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 14:16:30,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 14:16:30,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 14:16:30,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 14:16:30,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 14:16:30,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 14:16:30,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 14:16:30,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 14:16:30,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 14:16:30,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 14:16:30,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 14:16:30,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 14:16:30,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 14:16:30,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 14:16:30,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 14:16:30,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 14:16:30,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 14:16:30,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 14:16:30,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 14:16:30,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 14:16:30,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 14:16:30,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 14:16:30,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 14:16:30,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 14:16:30,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 14:16:30,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 14:16:30,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 14:16:30,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 14:16:30,253 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 14:16:30,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 14:16:30,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 14:16:30,256 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 14:16:30,307 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 14:16:30,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 14:16:30,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 14:16:30,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 14:16:30,313 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 14:16:30,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 14:16:30,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 14:16:30,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 14:16:30,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 14:16:30,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 14:16:30,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 14:16:30,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 14:16:30,317 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 14:16:30,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 14:16:30,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 14:16:30,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 14:16:30,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 14:16:30,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 14:16:30,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 14:16:30,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 14:16:30,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 14:16:30,318 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 14:16:30,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 14:16:30,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 14:16:30,319 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 14:16:30,319 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 14:16:30,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 14:16:30,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 14:16:30,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 14:16:30,777 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 14:16:30,778 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 14:16:30,780 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label53.c [2021-01-06 14:16:30,866 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/faf663c5f/13b910e9956342809cc65676fc9280ac/FLAGa09d24bac [2021-01-06 14:16:31,733 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 14:16:31,734 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label53.c [2021-01-06 14:16:31,758 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/faf663c5f/13b910e9956342809cc65676fc9280ac/FLAGa09d24bac [2021-01-06 14:16:31,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/faf663c5f/13b910e9956342809cc65676fc9280ac [2021-01-06 14:16:31,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 14:16:31,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 14:16:31,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 14:16:31,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 14:16:31,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 14:16:31,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 02:16:31" (1/1) ... [2021-01-06 14:16:31,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed8c11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:31, skipping insertion in model container [2021-01-06 14:16:31,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 02:16:31" (1/1) ... [2021-01-06 14:16:31,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 14:16:32,032 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 14:16:32,264 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label53.c[5103,5116] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2021-01-06 14:16:32,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 14:16:32,588 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 14:16:32,643 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label53.c[5103,5116] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2021-01-06 14:16:32,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 14:16:32,881 INFO L208 MainTranslator]: Completed translation [2021-01-06 14:16:32,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:32 WrapperNode [2021-01-06 14:16:32,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 14:16:32,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 14:16:32,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 14:16:32,884 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 14:16:32,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:32" (1/1) ... [2021-01-06 14:16:32,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:32" (1/1) ... [2021-01-06 14:16:33,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 14:16:33,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 14:16:33,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 14:16:33,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 14:16:33,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:32" (1/1) ... [2021-01-06 14:16:33,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:32" (1/1) ... [2021-01-06 14:16:33,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:32" (1/1) ... [2021-01-06 14:16:33,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:32" (1/1) ... [2021-01-06 14:16:33,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:32" (1/1) ... [2021-01-06 14:16:33,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:32" (1/1) ... [2021-01-06 14:16:33,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:32" (1/1) ... [2021-01-06 14:16:33,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 14:16:33,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 14:16:33,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 14:16:33,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 14:16:33,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:32" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 14:16:33,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 14:16:33,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 14:16:33,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 14:16:33,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 14:16:35,146 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 14:16:35,147 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 14:16:35,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 02:16:35 BoogieIcfgContainer [2021-01-06 14:16:35,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 14:16:35,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 14:16:35,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 14:16:35,156 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 14:16:35,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 02:16:31" (1/3) ... [2021-01-06 14:16:35,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7dcfaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 02:16:35, skipping insertion in model container [2021-01-06 14:16:35,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:16:32" (2/3) ... [2021-01-06 14:16:35,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7dcfaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 02:16:35, skipping insertion in model container [2021-01-06 14:16:35,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 02:16:35" (3/3) ... [2021-01-06 14:16:35,160 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label53.c [2021-01-06 14:16:35,168 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 14:16:35,173 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 14:16:35,194 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 14:16:35,228 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 14:16:35,229 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 14:16:35,229 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 14:16:35,229 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 14:16:35,229 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 14:16:35,230 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 14:16:35,230 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 14:16:35,230 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 14:16:35,253 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2021-01-06 14:16:35,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 14:16:35,263 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:35,264 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] [2021-01-06 14:16:35,265 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:35,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:35,272 INFO L82 PathProgramCache]: Analyzing trace with hash 301649817, now seen corresponding path program 1 times [2021-01-06 14:16:35,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:35,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277151130] [2021-01-06 14:16:35,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:16:35,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277151130] [2021-01-06 14:16:35,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:35,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:35,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506563096] [2021-01-06 14:16:35,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:16:35,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:35,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:16:35,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:16:35,719 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2021-01-06 14:16:37,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:37,888 INFO L93 Difference]: Finished difference Result 852 states and 1560 transitions. [2021-01-06 14:16:37,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:16:37,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2021-01-06 14:16:37,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:37,912 INFO L225 Difference]: With dead ends: 852 [2021-01-06 14:16:37,912 INFO L226 Difference]: Without dead ends: 538 [2021-01-06 14:16:37,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:16:37,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-01-06 14:16:38,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2021-01-06 14:16:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2021-01-06 14:16:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2021-01-06 14:16:38,018 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 49 [2021-01-06 14:16:38,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:38,019 INFO L481 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2021-01-06 14:16:38,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:16:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2021-01-06 14:16:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-01-06 14:16:38,030 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:38,030 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, 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] [2021-01-06 14:16:38,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 14:16:38,031 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:38,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:38,032 INFO L82 PathProgramCache]: Analyzing trace with hash -265131167, now seen corresponding path program 1 times [2021-01-06 14:16:38,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:38,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169299428] [2021-01-06 14:16:38,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-01-06 14:16:38,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169299428] [2021-01-06 14:16:38,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:38,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 14:16:38,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399896901] [2021-01-06 14:16:38,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:38,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:38,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:38,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:38,298 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand 3 states. [2021-01-06 14:16:39,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:39,398 INFO L93 Difference]: Finished difference Result 1074 states and 1656 transitions. [2021-01-06 14:16:39,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:39,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2021-01-06 14:16:39,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:39,404 INFO L225 Difference]: With dead ends: 1074 [2021-01-06 14:16:39,404 INFO L226 Difference]: Without dead ends: 716 [2021-01-06 14:16:39,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:39,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-01-06 14:16:39,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2021-01-06 14:16:39,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2021-01-06 14:16:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 968 transitions. [2021-01-06 14:16:39,444 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 968 transitions. Word has length 197 [2021-01-06 14:16:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:39,444 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 968 transitions. [2021-01-06 14:16:39,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 968 transitions. [2021-01-06 14:16:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2021-01-06 14:16:39,457 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:39,458 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 14:16:39,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 14:16:39,458 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:39,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:39,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1568066862, now seen corresponding path program 1 times [2021-01-06 14:16:39,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:39,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231874932] [2021-01-06 14:16:39,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-01-06 14:16:39,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231874932] [2021-01-06 14:16:39,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:39,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:39,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909860990] [2021-01-06 14:16:39,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:16:39,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:39,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:16:39,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:16:39,894 INFO L87 Difference]: Start difference. First operand 716 states and 968 transitions. Second operand 4 states. [2021-01-06 14:16:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:41,050 INFO L93 Difference]: Finished difference Result 1637 states and 2268 transitions. [2021-01-06 14:16:41,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:16:41,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2021-01-06 14:16:41,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:41,058 INFO L225 Difference]: With dead ends: 1637 [2021-01-06 14:16:41,058 INFO L226 Difference]: Without dead ends: 1072 [2021-01-06 14:16:41,060 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:16:41,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2021-01-06 14:16:41,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 894. [2021-01-06 14:16:41,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2021-01-06 14:16:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1047 transitions. [2021-01-06 14:16:41,084 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1047 transitions. Word has length 220 [2021-01-06 14:16:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:41,085 INFO L481 AbstractCegarLoop]: Abstraction has 894 states and 1047 transitions. [2021-01-06 14:16:41,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:16:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1047 transitions. [2021-01-06 14:16:41,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2021-01-06 14:16:41,092 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:41,092 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:41,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 14:16:41,093 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:41,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:41,093 INFO L82 PathProgramCache]: Analyzing trace with hash 555922922, now seen corresponding path program 1 times [2021-01-06 14:16:41,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:41,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709050994] [2021-01-06 14:16:41,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 271 proven. 100 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-01-06 14:16:41,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709050994] [2021-01-06 14:16:41,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10991017] [2021-01-06 14:16:41,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:42,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:16:42,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:42,757 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2021-01-06 14:16:42,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:42,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:16:42,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641231129] [2021-01-06 14:16:42,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:42,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:42,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:42,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:16:42,763 INFO L87 Difference]: Start difference. First operand 894 states and 1047 transitions. Second operand 3 states. [2021-01-06 14:16:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:43,621 INFO L93 Difference]: Finished difference Result 2320 states and 2778 transitions. [2021-01-06 14:16:43,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:43,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 351 [2021-01-06 14:16:43,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:43,632 INFO L225 Difference]: With dead ends: 2320 [2021-01-06 14:16:43,633 INFO L226 Difference]: Without dead ends: 1606 [2021-01-06 14:16:43,634 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:16:43,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2021-01-06 14:16:43,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2021-01-06 14:16:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2021-01-06 14:16:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1627 transitions. [2021-01-06 14:16:43,667 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1627 transitions. Word has length 351 [2021-01-06 14:16:43,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:43,668 INFO L481 AbstractCegarLoop]: Abstraction has 1428 states and 1627 transitions. [2021-01-06 14:16:43,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1627 transitions. [2021-01-06 14:16:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2021-01-06 14:16:43,678 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:43,678 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:43,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:43,893 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:43,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:43,894 INFO L82 PathProgramCache]: Analyzing trace with hash 303978021, now seen corresponding path program 1 times [2021-01-06 14:16:43,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:43,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272542663] [2021-01-06 14:16:43,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2021-01-06 14:16:44,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272542663] [2021-01-06 14:16:44,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:44,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:44,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297076909] [2021-01-06 14:16:44,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:44,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:44,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:44,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:44,401 INFO L87 Difference]: Start difference. First operand 1428 states and 1627 transitions. Second operand 3 states. [2021-01-06 14:16:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:45,292 INFO L93 Difference]: Finished difference Result 3210 states and 3757 transitions. [2021-01-06 14:16:45,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:45,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 450 [2021-01-06 14:16:45,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:45,304 INFO L225 Difference]: With dead ends: 3210 [2021-01-06 14:16:45,304 INFO L226 Difference]: Without dead ends: 1962 [2021-01-06 14:16:45,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:45,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2021-01-06 14:16:45,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2021-01-06 14:16:45,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2021-01-06 14:16:45,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2022 transitions. [2021-01-06 14:16:45,347 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2022 transitions. Word has length 450 [2021-01-06 14:16:45,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:45,348 INFO L481 AbstractCegarLoop]: Abstraction has 1784 states and 2022 transitions. [2021-01-06 14:16:45,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:45,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2022 transitions. [2021-01-06 14:16:45,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2021-01-06 14:16:45,358 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:45,359 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:45,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 14:16:45,359 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:45,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:45,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1651652833, now seen corresponding path program 1 times [2021-01-06 14:16:45,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:45,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756155720] [2021-01-06 14:16:45,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 551 proven. 23 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2021-01-06 14:16:46,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756155720] [2021-01-06 14:16:46,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148286989] [2021-01-06 14:16:46,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:46,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:16:46,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:47,207 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2021-01-06 14:16:47,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:47,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:16:47,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039426141] [2021-01-06 14:16:47,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:16:47,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:47,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:16:47,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:16:47,211 INFO L87 Difference]: Start difference. First operand 1784 states and 2022 transitions. Second operand 4 states. [2021-01-06 14:16:48,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:48,270 INFO L93 Difference]: Finished difference Result 3744 states and 4272 transitions. [2021-01-06 14:16:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:16:48,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 474 [2021-01-06 14:16:48,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:48,281 INFO L225 Difference]: With dead ends: 3744 [2021-01-06 14:16:48,284 INFO L226 Difference]: Without dead ends: 1962 [2021-01-06 14:16:48,288 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:16:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2021-01-06 14:16:48,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2021-01-06 14:16:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2021-01-06 14:16:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2219 transitions. [2021-01-06 14:16:48,330 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2219 transitions. Word has length 474 [2021-01-06 14:16:48,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:48,331 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 2219 transitions. [2021-01-06 14:16:48,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:16:48,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2219 transitions. [2021-01-06 14:16:48,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2021-01-06 14:16:48,351 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:48,351 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:48,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:48,566 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:48,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:48,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1089264344, now seen corresponding path program 1 times [2021-01-06 14:16:48,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:48,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108195768] [2021-01-06 14:16:48,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:49,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2021-01-06 14:16:49,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108195768] [2021-01-06 14:16:49,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:49,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:49,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046910738] [2021-01-06 14:16:49,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:16:49,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:49,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:16:49,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:16:49,052 INFO L87 Difference]: Start difference. First operand 1962 states and 2219 transitions. Second operand 4 states. [2021-01-06 14:16:49,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:49,978 INFO L93 Difference]: Finished difference Result 3773 states and 4286 transitions. [2021-01-06 14:16:49,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:16:49,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 530 [2021-01-06 14:16:49,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:49,988 INFO L225 Difference]: With dead ends: 3773 [2021-01-06 14:16:49,989 INFO L226 Difference]: Without dead ends: 1962 [2021-01-06 14:16:49,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:16:49,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2021-01-06 14:16:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2021-01-06 14:16:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2021-01-06 14:16:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2142 transitions. [2021-01-06 14:16:50,040 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2142 transitions. Word has length 530 [2021-01-06 14:16:50,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:50,041 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 2142 transitions. [2021-01-06 14:16:50,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:16:50,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2142 transitions. [2021-01-06 14:16:50,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2021-01-06 14:16:50,047 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:50,048 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:50,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 14:16:50,048 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:50,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:50,049 INFO L82 PathProgramCache]: Analyzing trace with hash -970210919, now seen corresponding path program 2 times [2021-01-06 14:16:50,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:50,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206754715] [2021-01-06 14:16:50,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:51,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 819 proven. 11 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2021-01-06 14:16:51,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206754715] [2021-01-06 14:16:51,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285587710] [2021-01-06 14:16:51,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:51,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 14:16:51,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 14:16:51,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 14:16:51,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 830 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2021-01-06 14:16:52,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:52,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2021-01-06 14:16:52,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392797690] [2021-01-06 14:16:52,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 14:16:52,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:52,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 14:16:52,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-01-06 14:16:52,307 INFO L87 Difference]: Start difference. First operand 1962 states and 2142 transitions. Second operand 5 states. [2021-01-06 14:16:53,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:53,776 INFO L93 Difference]: Finished difference Result 4129 states and 4557 transitions. [2021-01-06 14:16:53,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 14:16:53,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 556 [2021-01-06 14:16:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:53,788 INFO L225 Difference]: With dead ends: 4129 [2021-01-06 14:16:53,788 INFO L226 Difference]: Without dead ends: 2347 [2021-01-06 14:16:53,791 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-01-06 14:16:53,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2347 states. [2021-01-06 14:16:53,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2347 to 2140. [2021-01-06 14:16:53,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2021-01-06 14:16:53,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2324 transitions. [2021-01-06 14:16:53,829 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2324 transitions. Word has length 556 [2021-01-06 14:16:53,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:53,829 INFO L481 AbstractCegarLoop]: Abstraction has 2140 states and 2324 transitions. [2021-01-06 14:16:53,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 14:16:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2324 transitions. [2021-01-06 14:16:53,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2021-01-06 14:16:53,834 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:53,835 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:54,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:54,049 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:54,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:54,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1613402830, now seen corresponding path program 1 times [2021-01-06 14:16:54,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:54,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095192280] [2021-01-06 14:16:54,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 832 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2021-01-06 14:16:54,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095192280] [2021-01-06 14:16:54,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:16:54,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:16:54,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218084410] [2021-01-06 14:16:54,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:54,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:54,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:54,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:54,637 INFO L87 Difference]: Start difference. First operand 2140 states and 2324 transitions. Second operand 3 states. [2021-01-06 14:16:55,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:55,470 INFO L93 Difference]: Finished difference Result 4812 states and 5286 transitions. [2021-01-06 14:16:55,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:55,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 563 [2021-01-06 14:16:55,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:55,485 INFO L225 Difference]: With dead ends: 4812 [2021-01-06 14:16:55,485 INFO L226 Difference]: Without dead ends: 2852 [2021-01-06 14:16:55,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:16:55,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2021-01-06 14:16:55,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2021-01-06 14:16:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2021-01-06 14:16:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2896 transitions. [2021-01-06 14:16:55,542 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2896 transitions. Word has length 563 [2021-01-06 14:16:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:55,543 INFO L481 AbstractCegarLoop]: Abstraction has 2674 states and 2896 transitions. [2021-01-06 14:16:55,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:55,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2896 transitions. [2021-01-06 14:16:55,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2021-01-06 14:16:55,550 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:55,551 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 14:16:55,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 14:16:55,551 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:55,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:55,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1091532232, now seen corresponding path program 1 times [2021-01-06 14:16:55,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:55,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371657477] [2021-01-06 14:16:55,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:16:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:56,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1211 backedges. 633 proven. 195 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2021-01-06 14:16:56,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371657477] [2021-01-06 14:16:56,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423749110] [2021-01-06 14:16:56,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:16:57,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:16:57,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:16:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1211 backedges. 514 proven. 0 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2021-01-06 14:16:58,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:16:58,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2021-01-06 14:16:58,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632200471] [2021-01-06 14:16:58,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:16:58,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:16:58,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:16:58,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:16:58,813 INFO L87 Difference]: Start difference. First operand 2674 states and 2896 transitions. Second operand 3 states. [2021-01-06 14:16:59,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:16:59,702 INFO L93 Difference]: Finished difference Result 5168 states and 5611 transitions. [2021-01-06 14:16:59,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:16:59,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 626 [2021-01-06 14:16:59,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:16:59,715 INFO L225 Difference]: With dead ends: 5168 [2021-01-06 14:16:59,715 INFO L226 Difference]: Without dead ends: 2674 [2021-01-06 14:16:59,718 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:16:59,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2021-01-06 14:16:59,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2674. [2021-01-06 14:16:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2021-01-06 14:16:59,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2878 transitions. [2021-01-06 14:16:59,768 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2878 transitions. Word has length 626 [2021-01-06 14:16:59,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:16:59,769 INFO L481 AbstractCegarLoop]: Abstraction has 2674 states and 2878 transitions. [2021-01-06 14:16:59,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:16:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2878 transitions. [2021-01-06 14:16:59,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2021-01-06 14:16:59,775 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:16:59,776 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:16:59,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:16:59,990 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:16:59,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:16:59,991 INFO L82 PathProgramCache]: Analyzing trace with hash 186723207, now seen corresponding path program 1 times [2021-01-06 14:16:59,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:16:59,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458275090] [2021-01-06 14:16:59,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:00,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 837 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2021-01-06 14:17:00,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458275090] [2021-01-06 14:17:00,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:17:00,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:17:00,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193922496] [2021-01-06 14:17:00,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:17:00,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:00,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:17:00,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:17:00,586 INFO L87 Difference]: Start difference. First operand 2674 states and 2878 transitions. Second operand 3 states. [2021-01-06 14:17:01,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:01,547 INFO L93 Difference]: Finished difference Result 6058 states and 6559 transitions. [2021-01-06 14:17:01,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:17:01,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 630 [2021-01-06 14:17:01,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:01,565 INFO L225 Difference]: With dead ends: 6058 [2021-01-06 14:17:01,565 INFO L226 Difference]: Without dead ends: 3564 [2021-01-06 14:17:01,568 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:17:01,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2021-01-06 14:17:01,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3564. [2021-01-06 14:17:01,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2021-01-06 14:17:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3814 transitions. [2021-01-06 14:17:01,636 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3814 transitions. Word has length 630 [2021-01-06 14:17:01,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:01,637 INFO L481 AbstractCegarLoop]: Abstraction has 3564 states and 3814 transitions. [2021-01-06 14:17:01,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:17:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3814 transitions. [2021-01-06 14:17:01,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2021-01-06 14:17:01,645 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:01,646 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:01,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 14:17:01,646 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:01,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:01,647 INFO L82 PathProgramCache]: Analyzing trace with hash -287829589, now seen corresponding path program 1 times [2021-01-06 14:17:01,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:01,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561987366] [2021-01-06 14:17:01,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1805 backedges. 1289 proven. 155 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2021-01-06 14:17:02,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561987366] [2021-01-06 14:17:02,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747078589] [2021-01-06 14:17:02,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:17:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:02,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:17:02,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:17:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1805 backedges. 1289 proven. 155 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2021-01-06 14:17:03,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 14:17:03,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 14:17:03,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33603853] [2021-01-06 14:17:03,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:17:03,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:03,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:17:03,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:17:03,769 INFO L87 Difference]: Start difference. First operand 3564 states and 3814 transitions. Second operand 4 states. [2021-01-06 14:17:04,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:04,943 INFO L93 Difference]: Finished difference Result 8194 states and 8798 transitions. [2021-01-06 14:17:04,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:17:04,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 785 [2021-01-06 14:17:04,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:04,963 INFO L225 Difference]: With dead ends: 8194 [2021-01-06 14:17:04,964 INFO L226 Difference]: Without dead ends: 4810 [2021-01-06 14:17:04,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 786 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:17:04,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2021-01-06 14:17:05,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4276. [2021-01-06 14:17:05,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2021-01-06 14:17:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4589 transitions. [2021-01-06 14:17:05,093 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4589 transitions. Word has length 785 [2021-01-06 14:17:05,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:05,094 INFO L481 AbstractCegarLoop]: Abstraction has 4276 states and 4589 transitions. [2021-01-06 14:17:05,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:17:05,094 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4589 transitions. [2021-01-06 14:17:05,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2021-01-06 14:17:05,104 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:05,105 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:05,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-06 14:17:05,318 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:05,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:05,319 INFO L82 PathProgramCache]: Analyzing trace with hash -978914331, now seen corresponding path program 1 times [2021-01-06 14:17:05,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:05,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028201946] [2021-01-06 14:17:05,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2287 backedges. 1669 proven. 260 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2021-01-06 14:17:06,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028201946] [2021-01-06 14:17:06,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582121115] [2021-01-06 14:17:06,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:17:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:06,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:17:06,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:17:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2287 backedges. 1720 proven. 0 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2021-01-06 14:17:08,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:17:08,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 14:17:08,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055125659] [2021-01-06 14:17:08,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:17:08,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:08,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:17:08,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:17:08,250 INFO L87 Difference]: Start difference. First operand 4276 states and 4589 transitions. Second operand 3 states. [2021-01-06 14:17:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:09,030 INFO L93 Difference]: Finished difference Result 8728 states and 9361 transitions. [2021-01-06 14:17:09,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:17:09,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 836 [2021-01-06 14:17:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:09,053 INFO L225 Difference]: With dead ends: 8728 [2021-01-06 14:17:09,053 INFO L226 Difference]: Without dead ends: 4632 [2021-01-06 14:17:09,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 835 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:17:09,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2021-01-06 14:17:09,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4632. [2021-01-06 14:17:09,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2021-01-06 14:17:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4928 transitions. [2021-01-06 14:17:09,135 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4928 transitions. Word has length 836 [2021-01-06 14:17:09,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:09,136 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4928 transitions. [2021-01-06 14:17:09,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:17:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4928 transitions. [2021-01-06 14:17:09,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2021-01-06 14:17:09,146 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:09,147 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:09,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:17:09,362 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:09,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:09,363 INFO L82 PathProgramCache]: Analyzing trace with hash -570726484, now seen corresponding path program 1 times [2021-01-06 14:17:09,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:09,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34864771] [2021-01-06 14:17:09,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:10,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2283 backedges. 1470 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2021-01-06 14:17:10,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34864771] [2021-01-06 14:17:10,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:17:10,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:17:10,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013565800] [2021-01-06 14:17:10,050 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:17:10,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:10,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:17:10,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:17:10,051 INFO L87 Difference]: Start difference. First operand 4632 states and 4928 transitions. Second operand 3 states. [2021-01-06 14:17:10,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:10,940 INFO L93 Difference]: Finished difference Result 9974 states and 10683 transitions. [2021-01-06 14:17:10,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:17:10,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 857 [2021-01-06 14:17:10,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:10,971 INFO L225 Difference]: With dead ends: 9974 [2021-01-06 14:17:10,972 INFO L226 Difference]: Without dead ends: 5522 [2021-01-06 14:17:10,979 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:17:10,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2021-01-06 14:17:11,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 5344. [2021-01-06 14:17:11,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2021-01-06 14:17:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5701 transitions. [2021-01-06 14:17:11,080 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5701 transitions. Word has length 857 [2021-01-06 14:17:11,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:11,081 INFO L481 AbstractCegarLoop]: Abstraction has 5344 states and 5701 transitions. [2021-01-06 14:17:11,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:17:11,081 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5701 transitions. [2021-01-06 14:17:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2021-01-06 14:17:11,093 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:11,093 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:11,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 14:17:11,094 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:11,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:11,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1312070584, now seen corresponding path program 1 times [2021-01-06 14:17:11,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:11,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659496761] [2021-01-06 14:17:11,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:12,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2515 backedges. 1756 proven. 260 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2021-01-06 14:17:12,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659496761] [2021-01-06 14:17:12,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966505795] [2021-01-06 14:17:12,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:17:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:12,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:17:13,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:17:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2515 backedges. 1702 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2021-01-06 14:17:14,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:17:14,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 14:17:14,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670982448] [2021-01-06 14:17:14,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:17:14,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:14,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:17:14,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 14:17:14,418 INFO L87 Difference]: Start difference. First operand 5344 states and 5701 transitions. Second operand 4 states. [2021-01-06 14:17:15,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:15,639 INFO L93 Difference]: Finished difference Result 10508 states and 11221 transitions. [2021-01-06 14:17:15,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:17:15,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 914 [2021-01-06 14:17:15,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:15,650 INFO L225 Difference]: With dead ends: 10508 [2021-01-06 14:17:15,651 INFO L226 Difference]: Without dead ends: 5166 [2021-01-06 14:17:15,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 918 GetRequests, 912 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 14:17:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2021-01-06 14:17:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4810. [2021-01-06 14:17:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2021-01-06 14:17:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5135 transitions. [2021-01-06 14:17:15,752 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5135 transitions. Word has length 914 [2021-01-06 14:17:15,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:15,753 INFO L481 AbstractCegarLoop]: Abstraction has 4810 states and 5135 transitions. [2021-01-06 14:17:15,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:17:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5135 transitions. [2021-01-06 14:17:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 944 [2021-01-06 14:17:15,766 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:15,767 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:15,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-06 14:17:15,983 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:15,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:15,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1100691125, now seen corresponding path program 1 times [2021-01-06 14:17:15,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:15,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494423147] [2021-01-06 14:17:15,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2570 backedges. 1757 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2021-01-06 14:17:16,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494423147] [2021-01-06 14:17:16,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:17:16,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:17:16,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131932549] [2021-01-06 14:17:16,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:17:16,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:16,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:17:16,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:17:16,895 INFO L87 Difference]: Start difference. First operand 4810 states and 5135 transitions. Second operand 3 states. [2021-01-06 14:17:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:17,738 INFO L93 Difference]: Finished difference Result 9262 states and 9909 transitions. [2021-01-06 14:17:17,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:17:17,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 943 [2021-01-06 14:17:17,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:17,748 INFO L225 Difference]: With dead ends: 9262 [2021-01-06 14:17:17,748 INFO L226 Difference]: Without dead ends: 4632 [2021-01-06 14:17:17,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:17:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2021-01-06 14:17:17,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4632. [2021-01-06 14:17:17,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2021-01-06 14:17:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4907 transitions. [2021-01-06 14:17:17,826 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4907 transitions. Word has length 943 [2021-01-06 14:17:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:17,827 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4907 transitions. [2021-01-06 14:17:17,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:17:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4907 transitions. [2021-01-06 14:17:17,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 953 [2021-01-06 14:17:17,840 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:17,841 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:17,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 14:17:17,841 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:17,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:17,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1227190264, now seen corresponding path program 1 times [2021-01-06 14:17:17,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:17,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025730297] [2021-01-06 14:17:17,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:18,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1865 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2021-01-06 14:17:18,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025730297] [2021-01-06 14:17:18,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092614684] [2021-01-06 14:17:18,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:17:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:19,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 14:17:19,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:17:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1578 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2021-01-06 14:17:20,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:17:20,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2021-01-06 14:17:20,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400200152] [2021-01-06 14:17:20,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:17:20,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:20,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:17:20,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:17:20,921 INFO L87 Difference]: Start difference. First operand 4632 states and 4907 transitions. Second operand 4 states. [2021-01-06 14:17:22,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:22,397 INFO L93 Difference]: Finished difference Result 10686 states and 11308 transitions. [2021-01-06 14:17:22,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:17:22,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 952 [2021-01-06 14:17:22,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:22,409 INFO L225 Difference]: With dead ends: 10686 [2021-01-06 14:17:22,410 INFO L226 Difference]: Without dead ends: 6056 [2021-01-06 14:17:22,415 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 956 GetRequests, 951 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:17:22,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2021-01-06 14:17:22,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 5344. [2021-01-06 14:17:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2021-01-06 14:17:22,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5653 transitions. [2021-01-06 14:17:22,501 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5653 transitions. Word has length 952 [2021-01-06 14:17:22,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:22,502 INFO L481 AbstractCegarLoop]: Abstraction has 5344 states and 5653 transitions. [2021-01-06 14:17:22,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:17:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5653 transitions. [2021-01-06 14:17:22,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1113 [2021-01-06 14:17:22,517 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:22,517 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2021-01-06 14:17:22,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-06 14:17:22,731 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:22,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:22,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1758745810, now seen corresponding path program 1 times [2021-01-06 14:17:22,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:22,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757606100] [2021-01-06 14:17:22,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3504 backedges. 1706 proven. 0 refuted. 0 times theorem prover too weak. 1798 trivial. 0 not checked. [2021-01-06 14:17:23,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757606100] [2021-01-06 14:17:23,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:17:23,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:17:23,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127766020] [2021-01-06 14:17:23,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:17:23,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:23,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:17:23,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:17:23,830 INFO L87 Difference]: Start difference. First operand 5344 states and 5653 transitions. Second operand 3 states. [2021-01-06 14:17:24,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:24,743 INFO L93 Difference]: Finished difference Result 10508 states and 11125 transitions. [2021-01-06 14:17:24,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:17:24,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1112 [2021-01-06 14:17:24,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:24,755 INFO L225 Difference]: With dead ends: 10508 [2021-01-06 14:17:24,755 INFO L226 Difference]: Without dead ends: 5344 [2021-01-06 14:17:24,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:17:24,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2021-01-06 14:17:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4988. [2021-01-06 14:17:24,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2021-01-06 14:17:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5211 transitions. [2021-01-06 14:17:24,854 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5211 transitions. Word has length 1112 [2021-01-06 14:17:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:24,855 INFO L481 AbstractCegarLoop]: Abstraction has 4988 states and 5211 transitions. [2021-01-06 14:17:24,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:17:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5211 transitions. [2021-01-06 14:17:24,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1663 [2021-01-06 14:17:24,891 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:24,892 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:24,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 14:17:24,892 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:24,893 INFO L82 PathProgramCache]: Analyzing trace with hash 698233105, now seen corresponding path program 1 times [2021-01-06 14:17:24,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:24,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274420791] [2021-01-06 14:17:24,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 8507 backedges. 1838 proven. 1045 refuted. 0 times theorem prover too weak. 5624 trivial. 0 not checked. [2021-01-06 14:17:27,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274420791] [2021-01-06 14:17:27,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613175639] [2021-01-06 14:17:27,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:17:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:28,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 2031 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:17:28,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:17:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8507 backedges. 2883 proven. 0 refuted. 0 times theorem prover too weak. 5624 trivial. 0 not checked. [2021-01-06 14:17:31,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:17:31,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:17:31,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418934555] [2021-01-06 14:17:31,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:17:31,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:31,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:17:31,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:17:31,008 INFO L87 Difference]: Start difference. First operand 4988 states and 5211 transitions. Second operand 3 states. [2021-01-06 14:17:31,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:31,805 INFO L93 Difference]: Finished difference Result 11220 states and 11693 transitions. [2021-01-06 14:17:31,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:17:31,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1662 [2021-01-06 14:17:31,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:31,816 INFO L225 Difference]: With dead ends: 11220 [2021-01-06 14:17:31,816 INFO L226 Difference]: Without dead ends: 3920 [2021-01-06 14:17:31,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1665 GetRequests, 1661 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:17:31,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2021-01-06 14:17:31,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3920. [2021-01-06 14:17:31,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2021-01-06 14:17:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4016 transitions. [2021-01-06 14:17:31,885 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4016 transitions. Word has length 1662 [2021-01-06 14:17:31,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:31,887 INFO L481 AbstractCegarLoop]: Abstraction has 3920 states and 4016 transitions. [2021-01-06 14:17:31,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:17:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4016 transitions. [2021-01-06 14:17:31,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1734 [2021-01-06 14:17:31,920 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:31,921 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:32,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:17:32,137 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:32,139 INFO L82 PathProgramCache]: Analyzing trace with hash -2019243921, now seen corresponding path program 1 times [2021-01-06 14:17:32,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:32,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653597159] [2021-01-06 14:17:32,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9783 backedges. 1707 proven. 0 refuted. 0 times theorem prover too weak. 8076 trivial. 0 not checked. [2021-01-06 14:17:36,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653597159] [2021-01-06 14:17:36,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:17:36,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 14:17:36,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586392310] [2021-01-06 14:17:36,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 14:17:36,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:36,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 14:17:36,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:17:36,131 INFO L87 Difference]: Start difference. First operand 3920 states and 4016 transitions. Second operand 5 states. [2021-01-06 14:17:37,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:37,281 INFO L93 Difference]: Finished difference Result 5181 states and 5325 transitions. [2021-01-06 14:17:37,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 14:17:37,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1733 [2021-01-06 14:17:37,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:37,292 INFO L225 Difference]: With dead ends: 5181 [2021-01-06 14:17:37,292 INFO L226 Difference]: Without dead ends: 4988 [2021-01-06 14:17:37,294 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:17:37,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2021-01-06 14:17:37,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4454. [2021-01-06 14:17:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2021-01-06 14:17:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4581 transitions. [2021-01-06 14:17:37,365 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4581 transitions. Word has length 1733 [2021-01-06 14:17:37,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:37,367 INFO L481 AbstractCegarLoop]: Abstraction has 4454 states and 4581 transitions. [2021-01-06 14:17:37,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 14:17:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4581 transitions. [2021-01-06 14:17:37,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1739 [2021-01-06 14:17:37,400 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:37,401 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:37,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 14:17:37,401 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:37,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:37,405 INFO L82 PathProgramCache]: Analyzing trace with hash 636915005, now seen corresponding path program 1 times [2021-01-06 14:17:37,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:37,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580039555] [2021-01-06 14:17:37,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:40,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9838 backedges. 657 proven. 0 refuted. 0 times theorem prover too weak. 9181 trivial. 0 not checked. [2021-01-06 14:17:40,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580039555] [2021-01-06 14:17:40,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:17:40,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:17:40,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912743795] [2021-01-06 14:17:40,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:17:40,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:40,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:17:40,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:17:40,759 INFO L87 Difference]: Start difference. First operand 4454 states and 4581 transitions. Second operand 4 states. [2021-01-06 14:17:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:41,605 INFO L93 Difference]: Finished difference Result 4646 states and 4773 transitions. [2021-01-06 14:17:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:17:41,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1738 [2021-01-06 14:17:41,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:41,615 INFO L225 Difference]: With dead ends: 4646 [2021-01-06 14:17:41,615 INFO L226 Difference]: Without dead ends: 4454 [2021-01-06 14:17:41,617 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:17:41,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2021-01-06 14:17:41,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2021-01-06 14:17:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2021-01-06 14:17:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4577 transitions. [2021-01-06 14:17:41,677 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4577 transitions. Word has length 1738 [2021-01-06 14:17:41,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:41,679 INFO L481 AbstractCegarLoop]: Abstraction has 4454 states and 4577 transitions. [2021-01-06 14:17:41,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:17:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4577 transitions. [2021-01-06 14:17:41,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1739 [2021-01-06 14:17:41,717 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:41,719 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:41,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 14:17:41,719 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:41,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:41,720 INFO L82 PathProgramCache]: Analyzing trace with hash -2092363024, now seen corresponding path program 1 times [2021-01-06 14:17:41,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:41,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672703199] [2021-01-06 14:17:41,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9805 backedges. 6650 proven. 0 refuted. 0 times theorem prover too weak. 3155 trivial. 0 not checked. [2021-01-06 14:17:44,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672703199] [2021-01-06 14:17:44,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:17:44,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 14:17:44,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117435927] [2021-01-06 14:17:44,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:17:44,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:44,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:17:44,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:17:44,494 INFO L87 Difference]: Start difference. First operand 4454 states and 4577 transitions. Second operand 4 states. [2021-01-06 14:17:45,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:45,655 INFO L93 Difference]: Finished difference Result 8728 states and 8973 transitions. [2021-01-06 14:17:45,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:17:45,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1738 [2021-01-06 14:17:45,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:45,667 INFO L225 Difference]: With dead ends: 8728 [2021-01-06 14:17:45,667 INFO L226 Difference]: Without dead ends: 4454 [2021-01-06 14:17:45,671 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:17:45,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2021-01-06 14:17:45,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2021-01-06 14:17:45,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2021-01-06 14:17:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4535 transitions. [2021-01-06 14:17:45,730 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4535 transitions. Word has length 1738 [2021-01-06 14:17:45,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:45,732 INFO L481 AbstractCegarLoop]: Abstraction has 4454 states and 4535 transitions. [2021-01-06 14:17:45,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:17:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4535 transitions. [2021-01-06 14:17:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2036 [2021-01-06 14:17:45,771 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:17:45,772 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:17:45,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 14:17:45,772 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:17:45,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:17:45,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1253846088, now seen corresponding path program 1 times [2021-01-06 14:17:45,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:17:45,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112353955] [2021-01-06 14:17:45,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:17:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:17:48,952 INFO L134 CoverageAnalysis]: Checked inductivity of 13209 backedges. 1965 proven. 0 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2021-01-06 14:17:48,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112353955] [2021-01-06 14:17:48,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:17:48,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 14:17:48,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67964043] [2021-01-06 14:17:48,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:17:48,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:17:48,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:17:48,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:17:48,956 INFO L87 Difference]: Start difference. First operand 4454 states and 4535 transitions. Second operand 4 states. [2021-01-06 14:17:49,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:17:49,769 INFO L93 Difference]: Finished difference Result 4467 states and 4548 transitions. [2021-01-06 14:17:49,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:17:49,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2035 [2021-01-06 14:17:49,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:17:49,772 INFO L225 Difference]: With dead ends: 4467 [2021-01-06 14:17:49,772 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 14:17:49,775 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:17:49,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 14:17:49,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 14:17:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 14:17:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 14:17:49,781 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2035 [2021-01-06 14:17:49,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:17:49,782 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 14:17:49,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:17:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 14:17:49,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 14:17:49,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 14:17:49,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 14:17:49,962 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 114 [2021-01-06 14:17:50,694 WARN L197 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2021-01-06 14:17:51,322 WARN L197 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2021-01-06 14:17:51,326 INFO L189 CegarLoopUtils]: For program point L762(lines 762 880) no Hoare annotation was computed. [2021-01-06 14:17:51,326 INFO L189 CegarLoopUtils]: For program point L895(line 895) no Hoare annotation was computed. [2021-01-06 14:17:51,326 INFO L189 CegarLoopUtils]: For program point L829(lines 829 880) no Hoare annotation was computed. [2021-01-06 14:17:51,326 INFO L189 CegarLoopUtils]: For program point L631(lines 631 880) no Hoare annotation was computed. [2021-01-06 14:17:51,326 INFO L189 CegarLoopUtils]: For program point L565(lines 565 880) no Hoare annotation was computed. [2021-01-06 14:17:51,326 INFO L189 CegarLoopUtils]: For program point L169-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,327 INFO L189 CegarLoopUtils]: For program point L103-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,327 INFO L189 CegarLoopUtils]: For program point L37-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,327 INFO L189 CegarLoopUtils]: For program point L698(lines 698 880) no Hoare annotation was computed. [2021-01-06 14:17:51,327 INFO L189 CegarLoopUtils]: For program point L500(lines 500 880) no Hoare annotation was computed. [2021-01-06 14:17:51,327 INFO L189 CegarLoopUtils]: For program point L170(line 170) no Hoare annotation was computed. [2021-01-06 14:17:51,327 INFO L189 CegarLoopUtils]: For program point L104(line 104) no Hoare annotation was computed. [2021-01-06 14:17:51,327 INFO L189 CegarLoopUtils]: For program point L38(line 38) no Hoare annotation was computed. [2021-01-06 14:17:51,327 INFO L189 CegarLoopUtils]: For program point L369(lines 369 880) no Hoare annotation was computed. [2021-01-06 14:17:51,327 INFO L189 CegarLoopUtils]: For program point L303(lines 303 880) no Hoare annotation was computed. [2021-01-06 14:17:51,327 INFO L189 CegarLoopUtils]: For program point L436(lines 436 880) no Hoare annotation was computed. [2021-01-06 14:17:51,327 INFO L189 CegarLoopUtils]: For program point L172-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,327 INFO L189 CegarLoopUtils]: For program point L106-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,327 INFO L189 CegarLoopUtils]: For program point L40-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,327 INFO L189 CegarLoopUtils]: For program point L239(lines 239 880) no Hoare annotation was computed. [2021-01-06 14:17:51,328 INFO L189 CegarLoopUtils]: For program point L173(line 173) no Hoare annotation was computed. [2021-01-06 14:17:51,328 INFO L189 CegarLoopUtils]: For program point L107(line 107) no Hoare annotation was computed. [2021-01-06 14:17:51,328 INFO L189 CegarLoopUtils]: For program point L41(line 41) no Hoare annotation was computed. [2021-01-06 14:17:51,328 INFO L189 CegarLoopUtils]: For program point L768(lines 768 880) no Hoare annotation was computed. [2021-01-06 14:17:51,328 INFO L189 CegarLoopUtils]: For program point L636(lines 636 880) no Hoare annotation was computed. [2021-01-06 14:17:51,328 INFO L189 CegarLoopUtils]: For program point L835(lines 835 880) no Hoare annotation was computed. [2021-01-06 14:17:51,328 INFO L189 CegarLoopUtils]: For program point L571(lines 571 880) no Hoare annotation was computed. [2021-01-06 14:17:51,328 INFO L189 CegarLoopUtils]: For program point L505(lines 505 880) no Hoare annotation was computed. [2021-01-06 14:17:51,328 INFO L189 CegarLoopUtils]: For program point L175-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,328 INFO L189 CegarLoopUtils]: For program point L109-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,328 INFO L189 CegarLoopUtils]: For program point L43-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,328 INFO L189 CegarLoopUtils]: For program point L704(lines 704 880) no Hoare annotation was computed. [2021-01-06 14:17:51,328 INFO L189 CegarLoopUtils]: For program point L176(line 176) no Hoare annotation was computed. [2021-01-06 14:17:51,328 INFO L189 CegarLoopUtils]: For program point L110(line 110) no Hoare annotation was computed. [2021-01-06 14:17:51,329 INFO L189 CegarLoopUtils]: For program point L44(line 44) no Hoare annotation was computed. [2021-01-06 14:17:51,329 INFO L189 CegarLoopUtils]: For program point L309(lines 309 880) no Hoare annotation was computed. [2021-01-06 14:17:51,329 INFO L189 CegarLoopUtils]: For program point L442(lines 442 880) no Hoare annotation was computed. [2021-01-06 14:17:51,329 INFO L189 CegarLoopUtils]: For program point L376(lines 376 880) no Hoare annotation was computed. [2021-01-06 14:17:51,329 INFO L189 CegarLoopUtils]: For program point L178-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,329 INFO L189 CegarLoopUtils]: For program point L112-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,329 INFO L189 CegarLoopUtils]: For program point L46-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,329 INFO L189 CegarLoopUtils]: For program point L245(lines 245 880) no Hoare annotation was computed. [2021-01-06 14:17:51,329 INFO L189 CegarLoopUtils]: For program point L179(line 179) no Hoare annotation was computed. [2021-01-06 14:17:51,330 INFO L189 CegarLoopUtils]: For program point L113(line 113) no Hoare annotation was computed. [2021-01-06 14:17:51,330 INFO L189 CegarLoopUtils]: For program point L47(line 47) no Hoare annotation was computed. [2021-01-06 14:17:51,330 INFO L189 CegarLoopUtils]: For program point L774(lines 774 880) no Hoare annotation was computed. [2021-01-06 14:17:51,330 INFO L189 CegarLoopUtils]: For program point L642(lines 642 880) no Hoare annotation was computed. [2021-01-06 14:17:51,330 INFO L189 CegarLoopUtils]: For program point L510(lines 510 880) no Hoare annotation was computed. [2021-01-06 14:17:51,330 INFO L189 CegarLoopUtils]: For program point L841(lines 841 880) no Hoare annotation was computed. [2021-01-06 14:17:51,331 INFO L189 CegarLoopUtils]: For program point L181-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,331 INFO L189 CegarLoopUtils]: For program point L115-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,331 INFO L189 CegarLoopUtils]: For program point L49-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,331 INFO L189 CegarLoopUtils]: For program point L710(lines 710 880) no Hoare annotation was computed. [2021-01-06 14:17:51,331 INFO L189 CegarLoopUtils]: For program point L578(lines 578 880) no Hoare annotation was computed. [2021-01-06 14:17:51,331 INFO L189 CegarLoopUtils]: For program point L182(line 182) no Hoare annotation was computed. [2021-01-06 14:17:51,331 INFO L189 CegarLoopUtils]: For program point L116(line 116) no Hoare annotation was computed. [2021-01-06 14:17:51,331 INFO L189 CegarLoopUtils]: For program point L50(line 50) no Hoare annotation was computed. [2021-01-06 14:17:51,331 INFO L189 CegarLoopUtils]: For program point L315(lines 315 880) no Hoare annotation was computed. [2021-01-06 14:17:51,331 INFO L189 CegarLoopUtils]: For program point L448(lines 448 880) no Hoare annotation was computed. [2021-01-06 14:17:51,331 INFO L189 CegarLoopUtils]: For program point L382(lines 382 880) no Hoare annotation was computed. [2021-01-06 14:17:51,332 INFO L189 CegarLoopUtils]: For program point L184-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,332 INFO L189 CegarLoopUtils]: For program point L118-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,332 INFO L189 CegarLoopUtils]: For program point L52-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,332 INFO L189 CegarLoopUtils]: For program point L251(lines 251 880) no Hoare annotation was computed. [2021-01-06 14:17:51,332 INFO L189 CegarLoopUtils]: For program point L185(line 185) no Hoare annotation was computed. [2021-01-06 14:17:51,332 INFO L189 CegarLoopUtils]: For program point L119(line 119) no Hoare annotation was computed. [2021-01-06 14:17:51,332 INFO L189 CegarLoopUtils]: For program point L53(line 53) no Hoare annotation was computed. [2021-01-06 14:17:51,332 INFO L189 CegarLoopUtils]: For program point L648(lines 648 880) no Hoare annotation was computed. [2021-01-06 14:17:51,332 INFO L189 CegarLoopUtils]: For program point L516(lines 516 880) no Hoare annotation was computed. [2021-01-06 14:17:51,332 INFO L189 CegarLoopUtils]: For program point L847(lines 847 880) no Hoare annotation was computed. [2021-01-06 14:17:51,333 INFO L189 CegarLoopUtils]: For program point L781(lines 781 880) no Hoare annotation was computed. [2021-01-06 14:17:51,333 INFO L189 CegarLoopUtils]: For program point L583(lines 583 880) no Hoare annotation was computed. [2021-01-06 14:17:51,333 INFO L189 CegarLoopUtils]: For program point L187-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,333 INFO L189 CegarLoopUtils]: For program point L121-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,333 INFO L189 CegarLoopUtils]: For program point L55-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,333 INFO L189 CegarLoopUtils]: For program point L716(lines 716 880) no Hoare annotation was computed. [2021-01-06 14:17:51,333 INFO L189 CegarLoopUtils]: For program point L188(line 188) no Hoare annotation was computed. [2021-01-06 14:17:51,333 INFO L189 CegarLoopUtils]: For program point L122(line 122) no Hoare annotation was computed. [2021-01-06 14:17:51,333 INFO L189 CegarLoopUtils]: For program point L56(line 56) no Hoare annotation was computed. [2021-01-06 14:17:51,333 INFO L189 CegarLoopUtils]: For program point L321(lines 321 880) no Hoare annotation was computed. [2021-01-06 14:17:51,333 INFO L189 CegarLoopUtils]: For program point L454(lines 454 880) no Hoare annotation was computed. [2021-01-06 14:17:51,334 INFO L189 CegarLoopUtils]: For program point L388(lines 388 880) no Hoare annotation was computed. [2021-01-06 14:17:51,334 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 14:17:51,334 INFO L189 CegarLoopUtils]: For program point L190-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,334 INFO L189 CegarLoopUtils]: For program point L124-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,334 INFO L189 CegarLoopUtils]: For program point L58-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,334 INFO L189 CegarLoopUtils]: For program point L257(lines 257 880) no Hoare annotation was computed. [2021-01-06 14:17:51,334 INFO L189 CegarLoopUtils]: For program point L191(line 191) no Hoare annotation was computed. [2021-01-06 14:17:51,334 INFO L189 CegarLoopUtils]: For program point L125(line 125) no Hoare annotation was computed. [2021-01-06 14:17:51,334 INFO L189 CegarLoopUtils]: For program point L59(line 59) no Hoare annotation was computed. [2021-01-06 14:17:51,334 INFO L189 CegarLoopUtils]: For program point L852(lines 852 880) no Hoare annotation was computed. [2021-01-06 14:17:51,334 INFO L189 CegarLoopUtils]: For program point L654(lines 654 880) no Hoare annotation was computed. [2021-01-06 14:17:51,335 INFO L189 CegarLoopUtils]: For program point L522(lines 522 880) no Hoare annotation was computed. [2021-01-06 14:17:51,335 INFO L189 CegarLoopUtils]: For program point L787(lines 787 880) no Hoare annotation was computed. [2021-01-06 14:17:51,335 INFO L189 CegarLoopUtils]: For program point L589(lines 589 880) no Hoare annotation was computed. [2021-01-06 14:17:51,335 INFO L189 CegarLoopUtils]: For program point L193-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,335 INFO L189 CegarLoopUtils]: For program point L127-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,335 INFO L189 CegarLoopUtils]: For program point L61-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,335 INFO L189 CegarLoopUtils]: For program point L722(lines 722 880) no Hoare annotation was computed. [2021-01-06 14:17:51,335 INFO L189 CegarLoopUtils]: For program point L194(line 194) no Hoare annotation was computed. [2021-01-06 14:17:51,335 INFO L189 CegarLoopUtils]: For program point L128(line 128) no Hoare annotation was computed. [2021-01-06 14:17:51,335 INFO L189 CegarLoopUtils]: For program point L62(line 62) no Hoare annotation was computed. [2021-01-06 14:17:51,335 INFO L189 CegarLoopUtils]: For program point L459(lines 459 880) no Hoare annotation was computed. [2021-01-06 14:17:51,335 INFO L189 CegarLoopUtils]: For program point L327(lines 327 880) no Hoare annotation was computed. [2021-01-06 14:17:51,336 INFO L189 CegarLoopUtils]: For program point L394(lines 394 880) no Hoare annotation was computed. [2021-01-06 14:17:51,336 INFO L189 CegarLoopUtils]: For program point L262(lines 262 880) no Hoare annotation was computed. [2021-01-06 14:17:51,336 INFO L189 CegarLoopUtils]: For program point L196-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,336 INFO L189 CegarLoopUtils]: For program point L130-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,336 INFO L189 CegarLoopUtils]: For program point L64-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,336 INFO L189 CegarLoopUtils]: For program point L197(line 197) no Hoare annotation was computed. [2021-01-06 14:17:51,336 INFO L189 CegarLoopUtils]: For program point L131(line 131) no Hoare annotation was computed. [2021-01-06 14:17:51,336 INFO L189 CegarLoopUtils]: For program point L65(line 65) no Hoare annotation was computed. [2021-01-06 14:17:51,336 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 14:17:51,336 INFO L189 CegarLoopUtils]: For program point L858(lines 858 880) no Hoare annotation was computed. [2021-01-06 14:17:51,336 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2021-01-06 14:17:51,337 INFO L189 CegarLoopUtils]: For program point L660(lines 660 880) no Hoare annotation was computed. [2021-01-06 14:17:51,337 INFO L189 CegarLoopUtils]: For program point L528(lines 528 880) no Hoare annotation was computed. [2021-01-06 14:17:51,337 INFO L189 CegarLoopUtils]: For program point L793(lines 793 880) no Hoare annotation was computed. [2021-01-06 14:17:51,337 INFO L189 CegarLoopUtils]: For program point L595(lines 595 880) no Hoare annotation was computed. [2021-01-06 14:17:51,337 INFO L189 CegarLoopUtils]: For program point L199-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,337 INFO L189 CegarLoopUtils]: For program point L133-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,337 INFO L189 CegarLoopUtils]: For program point L67-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,337 INFO L189 CegarLoopUtils]: For program point L728(lines 728 880) no Hoare annotation was computed. [2021-01-06 14:17:51,337 INFO L189 CegarLoopUtils]: For program point L464(lines 464 880) no Hoare annotation was computed. [2021-01-06 14:17:51,337 INFO L189 CegarLoopUtils]: For program point L200(line 200) no Hoare annotation was computed. [2021-01-06 14:17:51,337 INFO L189 CegarLoopUtils]: For program point L134(line 134) no Hoare annotation was computed. [2021-01-06 14:17:51,338 INFO L189 CegarLoopUtils]: For program point L68(line 68) no Hoare annotation was computed. [2021-01-06 14:17:51,338 INFO L189 CegarLoopUtils]: For program point L333(lines 333 880) no Hoare annotation was computed. [2021-01-06 14:17:51,338 INFO L189 CegarLoopUtils]: For program point L400(lines 400 880) no Hoare annotation was computed. [2021-01-06 14:17:51,338 INFO L189 CegarLoopUtils]: For program point L268(lines 268 880) no Hoare annotation was computed. [2021-01-06 14:17:51,338 INFO L189 CegarLoopUtils]: For program point L202-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,338 INFO L189 CegarLoopUtils]: For program point L136-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,338 INFO L189 CegarLoopUtils]: For program point L70-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,338 INFO L189 CegarLoopUtils]: For program point L203(line 203) no Hoare annotation was computed. [2021-01-06 14:17:51,338 INFO L189 CegarLoopUtils]: For program point L137(line 137) no Hoare annotation was computed. [2021-01-06 14:17:51,338 INFO L189 CegarLoopUtils]: For program point L71(line 71) no Hoare annotation was computed. [2021-01-06 14:17:51,338 INFO L189 CegarLoopUtils]: For program point L864(lines 864 880) no Hoare annotation was computed. [2021-01-06 14:17:51,338 INFO L189 CegarLoopUtils]: For program point L666(lines 666 880) no Hoare annotation was computed. [2021-01-06 14:17:51,339 INFO L189 CegarLoopUtils]: For program point L534(lines 534 880) no Hoare annotation was computed. [2021-01-06 14:17:51,339 INFO L189 CegarLoopUtils]: For program point L799(lines 799 880) no Hoare annotation was computed. [2021-01-06 14:17:51,339 INFO L189 CegarLoopUtils]: For program point L601(lines 601 880) no Hoare annotation was computed. [2021-01-06 14:17:51,339 INFO L189 CegarLoopUtils]: For program point L205-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,339 INFO L189 CegarLoopUtils]: For program point L139-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,339 INFO L189 CegarLoopUtils]: For program point L73-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,339 INFO L189 CegarLoopUtils]: For program point L734(lines 734 880) no Hoare annotation was computed. [2021-01-06 14:17:51,339 INFO L189 CegarLoopUtils]: For program point L470(lines 470 880) no Hoare annotation was computed. [2021-01-06 14:17:51,339 INFO L189 CegarLoopUtils]: For program point L206(line 206) no Hoare annotation was computed. [2021-01-06 14:17:51,339 INFO L189 CegarLoopUtils]: For program point L140(line 140) no Hoare annotation was computed. [2021-01-06 14:17:51,339 INFO L189 CegarLoopUtils]: For program point L74(line 74) no Hoare annotation was computed. [2021-01-06 14:17:51,339 INFO L189 CegarLoopUtils]: For program point L339(lines 339 880) no Hoare annotation was computed. [2021-01-06 14:17:51,340 INFO L189 CegarLoopUtils]: For program point L406(lines 406 880) no Hoare annotation was computed. [2021-01-06 14:17:51,340 INFO L189 CegarLoopUtils]: For program point L274(lines 274 880) no Hoare annotation was computed. [2021-01-06 14:17:51,340 INFO L189 CegarLoopUtils]: For program point L208-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,340 INFO L189 CegarLoopUtils]: For program point L142-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,340 INFO L189 CegarLoopUtils]: For program point L76-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,340 INFO L189 CegarLoopUtils]: For program point L869(lines 869 880) no Hoare annotation was computed. [2021-01-06 14:17:51,340 INFO L189 CegarLoopUtils]: For program point L209(line 209) no Hoare annotation was computed. [2021-01-06 14:17:51,340 INFO L189 CegarLoopUtils]: For program point L143(line 143) no Hoare annotation was computed. [2021-01-06 14:17:51,340 INFO L189 CegarLoopUtils]: For program point L77(line 77) no Hoare annotation was computed. [2021-01-06 14:17:51,340 INFO L189 CegarLoopUtils]: For program point L672(lines 672 880) no Hoare annotation was computed. [2021-01-06 14:17:51,340 INFO L189 CegarLoopUtils]: For program point L540(lines 540 880) no Hoare annotation was computed. [2021-01-06 14:17:51,341 INFO L189 CegarLoopUtils]: For program point L805(lines 805 880) no Hoare annotation was computed. [2021-01-06 14:17:51,341 INFO L189 CegarLoopUtils]: For program point L607(lines 607 880) no Hoare annotation was computed. [2021-01-06 14:17:51,341 INFO L189 CegarLoopUtils]: For program point L211-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,341 INFO L189 CegarLoopUtils]: For program point L145-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,341 INFO L189 CegarLoopUtils]: For program point L79-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,341 INFO L189 CegarLoopUtils]: For program point L740(lines 740 880) no Hoare annotation was computed. [2021-01-06 14:17:51,341 INFO L189 CegarLoopUtils]: For program point L212(line 212) no Hoare annotation was computed. [2021-01-06 14:17:51,341 INFO L189 CegarLoopUtils]: For program point L146(line 146) no Hoare annotation was computed. [2021-01-06 14:17:51,341 INFO L189 CegarLoopUtils]: For program point L80(line 80) no Hoare annotation was computed. [2021-01-06 14:17:51,341 INFO L189 CegarLoopUtils]: For program point L477(lines 477 880) no Hoare annotation was computed. [2021-01-06 14:17:51,341 INFO L189 CegarLoopUtils]: For program point L345(lines 345 880) no Hoare annotation was computed. [2021-01-06 14:17:51,342 INFO L189 CegarLoopUtils]: For program point L279(lines 279 880) no Hoare annotation was computed. [2021-01-06 14:17:51,342 INFO L189 CegarLoopUtils]: For program point L412(lines 412 880) no Hoare annotation was computed. [2021-01-06 14:17:51,342 INFO L189 CegarLoopUtils]: For program point L148-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,342 INFO L189 CegarLoopUtils]: For program point L82-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,342 INFO L189 CegarLoopUtils]: For program point L875(lines 875 880) no Hoare annotation was computed. [2021-01-06 14:17:51,342 INFO L189 CegarLoopUtils]: For program point L149(line 149) no Hoare annotation was computed. [2021-01-06 14:17:51,342 INFO L189 CegarLoopUtils]: For program point L83(line 83) no Hoare annotation was computed. [2021-01-06 14:17:51,342 INFO L189 CegarLoopUtils]: For program point L678(lines 678 880) no Hoare annotation was computed. [2021-01-06 14:17:51,342 INFO L189 CegarLoopUtils]: For program point L546(lines 546 880) no Hoare annotation was computed. [2021-01-06 14:17:51,342 INFO L189 CegarLoopUtils]: For program point L811(lines 811 880) no Hoare annotation was computed. [2021-01-06 14:17:51,342 INFO L189 CegarLoopUtils]: For program point L745(lines 745 880) no Hoare annotation was computed. [2021-01-06 14:17:51,342 INFO L189 CegarLoopUtils]: For program point L613(lines 613 880) no Hoare annotation was computed. [2021-01-06 14:17:51,343 INFO L189 CegarLoopUtils]: For program point L151-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,343 INFO L189 CegarLoopUtils]: For program point L85-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,343 INFO L189 CegarLoopUtils]: For program point L482(lines 482 880) no Hoare annotation was computed. [2021-01-06 14:17:51,343 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 14:17:51,343 INFO L189 CegarLoopUtils]: For program point L152(line 152) no Hoare annotation was computed. [2021-01-06 14:17:51,343 INFO L189 CegarLoopUtils]: For program point L86(line 86) no Hoare annotation was computed. [2021-01-06 14:17:51,343 INFO L189 CegarLoopUtils]: For program point L351(lines 351 880) no Hoare annotation was computed. [2021-01-06 14:17:51,343 INFO L189 CegarLoopUtils]: For program point L285(lines 285 880) no Hoare annotation was computed. [2021-01-06 14:17:51,343 INFO L189 CegarLoopUtils]: For program point L418(lines 418 880) no Hoare annotation was computed. [2021-01-06 14:17:51,343 INFO L189 CegarLoopUtils]: For program point L154-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,343 INFO L189 CegarLoopUtils]: For program point L88-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,344 INFO L185 CegarLoopUtils]: At program point L881(lines 30 882) the Hoare annotation is: (let ((.cse4 (not (= 7 ~a15~0))) (.cse1 (<= ~a21~0 6)) (.cse3 (<= ~a12~0 599999)) (.cse2 (<= ~a15~0 7)) (.cse5 (<= ~a21~0 9)) (.cse6 (+ ~a12~0 43)) (.cse0 (= ~a24~0 1)) (.cse7 (<= ~a21~0 8))) (or (and (<= ~a12~0 586307) .cse0 .cse1) (and .cse2 (= ~a21~0 10) (< 80 ~a12~0) .cse0) (and .cse0 (<= 10 ~a21~0) .cse3 .cse4) (and .cse2 .cse0 .cse4) (and (<= 9 ~a21~0) .cse0 .cse5 (<= ~a12~0 76)) (and (<= (+ ~a12~0 49) 0) .cse0) (and .cse2 (<= .cse6 0) .cse1) (and (<= 8 ~a21~0) .cse0 (<= ~a12~0 73282) .cse7) (and (<= 7 ~a21~0) .cse0 (<= 9 ~a15~0) .cse3) (and .cse2 .cse0 .cse5) (and (< 0 .cse6) (<= ~a12~0 11) .cse0 .cse7))) [2021-01-06 14:17:51,344 INFO L189 CegarLoopUtils]: For program point L551(lines 551 880) no Hoare annotation was computed. [2021-01-06 14:17:51,344 INFO L189 CegarLoopUtils]: For program point L221(lines 221 880) no Hoare annotation was computed. [2021-01-06 14:17:51,344 INFO L189 CegarLoopUtils]: For program point L155(line 155) no Hoare annotation was computed. [2021-01-06 14:17:51,344 INFO L189 CegarLoopUtils]: For program point L89(line 89) no Hoare annotation was computed. [2021-01-06 14:17:51,344 INFO L189 CegarLoopUtils]: For program point L684(lines 684 880) no Hoare annotation was computed. [2021-01-06 14:17:51,344 INFO L189 CegarLoopUtils]: For program point L817(lines 817 880) no Hoare annotation was computed. [2021-01-06 14:17:51,345 INFO L189 CegarLoopUtils]: For program point L751(lines 751 880) no Hoare annotation was computed. [2021-01-06 14:17:51,345 INFO L189 CegarLoopUtils]: For program point L619(lines 619 880) no Hoare annotation was computed. [2021-01-06 14:17:51,345 INFO L189 CegarLoopUtils]: For program point L157-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,345 INFO L189 CegarLoopUtils]: For program point L91-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,345 INFO L192 CegarLoopUtils]: At program point L884(lines 884 900) the Hoare annotation is: true [2021-01-06 14:17:51,345 INFO L189 CegarLoopUtils]: For program point L488(lines 488 880) no Hoare annotation was computed. [2021-01-06 14:17:51,345 INFO L189 CegarLoopUtils]: For program point L290(lines 290 880) no Hoare annotation was computed. [2021-01-06 14:17:51,345 INFO L189 CegarLoopUtils]: For program point L158(line 158) no Hoare annotation was computed. [2021-01-06 14:17:51,345 INFO L189 CegarLoopUtils]: For program point L92(line 92) no Hoare annotation was computed. [2021-01-06 14:17:51,345 INFO L189 CegarLoopUtils]: For program point L687(lines 687 880) no Hoare annotation was computed. [2021-01-06 14:17:51,345 INFO L189 CegarLoopUtils]: For program point L357(lines 357 880) no Hoare annotation was computed. [2021-01-06 14:17:51,345 INFO L189 CegarLoopUtils]: For program point L424(lines 424 880) no Hoare annotation was computed. [2021-01-06 14:17:51,345 INFO L189 CegarLoopUtils]: For program point L160-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,346 INFO L189 CegarLoopUtils]: For program point L94-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,346 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 14:17:51,346 INFO L189 CegarLoopUtils]: For program point L557(lines 557 880) no Hoare annotation was computed. [2021-01-06 14:17:51,346 INFO L189 CegarLoopUtils]: For program point L227(lines 227 880) no Hoare annotation was computed. [2021-01-06 14:17:51,346 INFO L189 CegarLoopUtils]: For program point L161(line 161) no Hoare annotation was computed. [2021-01-06 14:17:51,346 INFO L189 CegarLoopUtils]: For program point L95(line 95) no Hoare annotation was computed. [2021-01-06 14:17:51,346 INFO L189 CegarLoopUtils]: For program point L757(lines 757 880) no Hoare annotation was computed. [2021-01-06 14:17:51,346 INFO L189 CegarLoopUtils]: For program point L625(lines 625 880) no Hoare annotation was computed. [2021-01-06 14:17:51,346 INFO L189 CegarLoopUtils]: For program point L163-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,346 INFO L189 CegarLoopUtils]: For program point L97-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,346 INFO L189 CegarLoopUtils]: For program point L31(lines 31 33) no Hoare annotation was computed. [2021-01-06 14:17:51,346 INFO L189 CegarLoopUtils]: For program point L31-2(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,347 INFO L189 CegarLoopUtils]: For program point L824(lines 824 880) no Hoare annotation was computed. [2021-01-06 14:17:51,347 INFO L185 CegarLoopUtils]: At program point L890-2(lines 890 899) the Hoare annotation is: (let ((.cse4 (not (= 7 ~a15~0))) (.cse1 (<= ~a21~0 6)) (.cse3 (<= ~a12~0 599999)) (.cse2 (<= ~a15~0 7)) (.cse5 (<= ~a21~0 9)) (.cse6 (+ ~a12~0 43)) (.cse0 (= ~a24~0 1)) (.cse7 (<= ~a21~0 8))) (or (and (<= ~a12~0 586307) .cse0 .cse1) (and .cse2 (= ~a21~0 10) (< 80 ~a12~0) .cse0) (and .cse0 (<= 10 ~a21~0) .cse3 .cse4) (and .cse2 .cse0 .cse4) (and (<= 9 ~a21~0) .cse0 .cse5 (<= ~a12~0 76)) (and (<= (+ ~a12~0 49) 0) .cse0) (and .cse2 (<= .cse6 0) .cse1) (and (<= 8 ~a21~0) .cse0 (<= ~a12~0 73282) .cse7) (and (<= 7 ~a21~0) .cse0 (<= 9 ~a15~0) .cse3) (and .cse2 .cse0 .cse5) (and (< 0 .cse6) (<= ~a12~0 11) .cse0 .cse7))) [2021-01-06 14:17:51,347 INFO L189 CegarLoopUtils]: For program point L494(lines 494 880) no Hoare annotation was computed. [2021-01-06 14:17:51,347 INFO L189 CegarLoopUtils]: For program point L296(lines 296 880) no Hoare annotation was computed. [2021-01-06 14:17:51,347 INFO L189 CegarLoopUtils]: For program point L164(line 164) no Hoare annotation was computed. [2021-01-06 14:17:51,347 INFO L189 CegarLoopUtils]: For program point L98(line 98) no Hoare annotation was computed. [2021-01-06 14:17:51,347 INFO L189 CegarLoopUtils]: For program point L32(line 32) no Hoare annotation was computed. [2021-01-06 14:17:51,347 INFO L189 CegarLoopUtils]: For program point L693(lines 693 880) no Hoare annotation was computed. [2021-01-06 14:17:51,347 INFO L189 CegarLoopUtils]: For program point L363(lines 363 880) no Hoare annotation was computed. [2021-01-06 14:17:51,347 INFO L189 CegarLoopUtils]: For program point L562(lines 562 880) no Hoare annotation was computed. [2021-01-06 14:17:51,347 INFO L189 CegarLoopUtils]: For program point L430(lines 430 880) no Hoare annotation was computed. [2021-01-06 14:17:51,348 INFO L189 CegarLoopUtils]: For program point L166-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,348 INFO L189 CegarLoopUtils]: For program point L100-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,348 INFO L189 CegarLoopUtils]: For program point L34-1(lines 30 882) no Hoare annotation was computed. [2021-01-06 14:17:51,348 INFO L189 CegarLoopUtils]: For program point L233(lines 233 880) no Hoare annotation was computed. [2021-01-06 14:17:51,348 INFO L189 CegarLoopUtils]: For program point L167(line 167) no Hoare annotation was computed. [2021-01-06 14:17:51,348 INFO L189 CegarLoopUtils]: For program point L101(line 101) no Hoare annotation was computed. [2021-01-06 14:17:51,348 INFO L189 CegarLoopUtils]: For program point L35(line 35) no Hoare annotation was computed. [2021-01-06 14:17:51,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 02:17:51 BoogieIcfgContainer [2021-01-06 14:17:51,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 14:17:51,376 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 14:17:51,376 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 14:17:51,378 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 14:17:51,379 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 02:16:35" (3/4) ... [2021-01-06 14:17:51,384 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 14:17:51,419 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-01-06 14:17:51,421 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 14:17:51,422 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 14:17:51,424 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 14:17:51,586 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/eca-rers2012/Problem14_label53.c-witness.graphml [2021-01-06 14:17:51,586 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 14:17:51,587 INFO L168 Benchmark]: Toolchain (without parser) took 79656.15 ms. Allocated memory was 153.1 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 126.8 MB in the beginning and 958.3 MB in the end (delta: -831.5 MB). Peak memory consumption was 929.4 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:51,588 INFO L168 Benchmark]: CDTParser took 3.36 ms. Allocated memory is still 153.1 MB. Free memory is still 130.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 14:17:51,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 945.33 ms. Allocated memory is still 153.1 MB. Free memory was 126.6 MB in the beginning and 128.1 MB in the end (delta: -1.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:51,589 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.17 ms. Allocated memory is still 153.1 MB. Free memory was 128.1 MB in the beginning and 118.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:51,589 INFO L168 Benchmark]: Boogie Preprocessor took 131.77 ms. Allocated memory is still 153.1 MB. Free memory was 118.8 MB in the beginning and 112.5 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:51,589 INFO L168 Benchmark]: RCFGBuilder took 1992.89 ms. Allocated memory was 153.1 MB in the beginning and 200.3 MB in the end (delta: 47.2 MB). Free memory was 112.0 MB in the beginning and 170.3 MB in the end (delta: -58.4 MB). Peak memory consumption was 72.2 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:51,590 INFO L168 Benchmark]: TraceAbstraction took 76223.50 ms. Allocated memory was 200.3 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 169.8 MB in the beginning and 977.1 MB in the end (delta: -807.3 MB). Peak memory consumption was 905.5 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:51,590 INFO L168 Benchmark]: Witness Printer took 210.39 ms. Allocated memory is still 1.9 GB. Free memory was 977.1 MB in the beginning and 958.3 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2021-01-06 14:17:51,593 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.36 ms. Allocated memory is still 153.1 MB. Free memory is still 130.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 945.33 ms. Allocated memory is still 153.1 MB. Free memory was 126.6 MB in the beginning and 128.1 MB in the end (delta: -1.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 137.17 ms. Allocated memory is still 153.1 MB. Free memory was 128.1 MB in the beginning and 118.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 131.77 ms. Allocated memory is still 153.1 MB. Free memory was 118.8 MB in the beginning and 112.5 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1992.89 ms. Allocated memory was 153.1 MB in the beginning and 200.3 MB in the end (delta: 47.2 MB). Free memory was 112.0 MB in the beginning and 170.3 MB in the end (delta: -58.4 MB). Peak memory consumption was 72.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 76223.50 ms. Allocated memory was 200.3 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 169.8 MB in the beginning and 977.1 MB in the end (delta: -807.3 MB). Peak memory consumption was 905.5 MB. Max. memory is 8.0 GB. * Witness Printer took 210.39 ms. Allocated memory is still 1.9 GB. Free memory was 977.1 MB in the beginning and 958.3 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 884]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: (((((((((((a12 <= 586307 && a24 == 1) && a21 <= 6) || (((a15 <= 7 && a21 == 10) && 80 < a12) && a24 == 1)) || (((a24 == 1 && 10 <= a21) && a12 <= 599999) && !(7 == a15))) || ((a15 <= 7 && a24 == 1) && !(7 == a15))) || (((9 <= a21 && a24 == 1) && a21 <= 9) && a12 <= 76)) || (a12 + 49 <= 0 && a24 == 1)) || ((a15 <= 7 && a12 + 43 <= 0) && a21 <= 6)) || (((8 <= a21 && a24 == 1) && a12 <= 73282) && a21 <= 8)) || (((7 <= a21 && a24 == 1) && 9 <= a15) && a12 <= 599999)) || ((a15 <= 7 && a24 == 1) && a21 <= 9)) || (((0 < a12 + 43 && a12 <= 11) && a24 == 1) && a21 <= 8) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((a12 <= 586307 && a24 == 1) && a21 <= 6) || (((a15 <= 7 && a21 == 10) && 80 < a12) && a24 == 1)) || (((a24 == 1 && 10 <= a21) && a12 <= 599999) && !(7 == a15))) || ((a15 <= 7 && a24 == 1) && !(7 == a15))) || (((9 <= a21 && a24 == 1) && a21 <= 9) && a12 <= 76)) || (a12 + 49 <= 0 && a24 == 1)) || ((a15 <= 7 && a12 + 43 <= 0) && a21 <= 6)) || (((8 <= a21 && a24 == 1) && a12 <= 73282) && a21 <= 8)) || (((7 <= a21 && a24 == 1) && 9 <= a15) && a12 <= 599999)) || ((a15 <= 7 && a24 == 1) && a21 <= 9)) || (((0 < a12 + 43 && a12 <= 11) && a24 == 1) && a21 <= 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 74.5s, OverallIterations: 23, TraceHistogramMax: 17, AutomataDifference: 24.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2218 SDtfs, 2484 SDslu, 159 SDs, 0 SdLazy, 13459 SolverSat, 1698 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7234 GetRequests, 7169 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5344occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 3589 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 98 NumberOfFragments, 269 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3488 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1806 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 27107 NumberOfCodeBlocks, 27107 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 27075 ConstructedInterpolants, 0 QuantifiedInterpolants, 78810272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 9086 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 32 InterpolantComputations, 22 PerfectInterpolantSequences, 96439/98715 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...