/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/Problem10_label30.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 13:31:41,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 13:31:41,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 13:31:41,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 13:31:41,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 13:31:41,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 13:31:41,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 13:31:41,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 13:31:41,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 13:31:41,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 13:31:41,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 13:31:41,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 13:31:41,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 13:31:41,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 13:31:41,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 13:31:41,075 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 13:31:41,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 13:31:41,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 13:31:41,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 13:31:41,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 13:31:41,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 13:31:41,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 13:31:41,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 13:31:41,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 13:31:41,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 13:31:41,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 13:31:41,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 13:31:41,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 13:31:41,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 13:31:41,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 13:31:41,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 13:31:41,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 13:31:41,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 13:31:41,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 13:31:41,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 13:31:41,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 13:31:41,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 13:31:41,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 13:31:41,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 13:31:41,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 13:31:41,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 13:31:41,121 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 13:31:41,150 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 13:31:41,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 13:31:41,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 13:31:41,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 13:31:41,152 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 13:31:41,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 13:31:41,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 13:31:41,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 13:31:41,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 13:31:41,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 13:31:41,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 13:31:41,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 13:31:41,154 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 13:31:41,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 13:31:41,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 13:31:41,155 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 13:31:41,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 13:31:41,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 13:31:41,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 13:31:41,156 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 13:31:41,157 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 13:31:41,157 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 13:31:41,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 13:31:41,157 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 13:31:41,158 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 13:31:41,158 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 13:31:41,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 13:31:41,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 13:31:41,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 13:31:41,642 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 13:31:41,643 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 13:31:41,644 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label30.c [2021-01-06 13:31:41,722 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b8c80f51b/839d13ab32724d548659b4110e3a84fd/FLAG4583754bf [2021-01-06 13:31:42,550 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 13:31:42,551 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label30.c [2021-01-06 13:31:42,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b8c80f51b/839d13ab32724d548659b4110e3a84fd/FLAG4583754bf [2021-01-06 13:31:42,787 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b8c80f51b/839d13ab32724d548659b4110e3a84fd [2021-01-06 13:31:42,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 13:31:42,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 13:31:42,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 13:31:42,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 13:31:42,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 13:31:42,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 01:31:42" (1/1) ... [2021-01-06 13:31:42,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ab4f3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:42, skipping insertion in model container [2021-01-06 13:31:42,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 01:31:42" (1/1) ... [2021-01-06 13:31:42,814 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 13:31:42,859 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 13:31:43,060 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/Problem10_label30.c[4019,4032] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~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 13:31:43,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 13:31:43,323 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 13:31:43,348 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/Problem10_label30.c[4019,4032] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a19~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 13:31:43,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 13:31:43,543 INFO L208 MainTranslator]: Completed translation [2021-01-06 13:31:43,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:43 WrapperNode [2021-01-06 13:31:43,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 13:31:43,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 13:31:43,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 13:31:43,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 13:31:43,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:43" (1/1) ... [2021-01-06 13:31:43,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:43" (1/1) ... [2021-01-06 13:31:43,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 13:31:43,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 13:31:43,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 13:31:43,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 13:31:43,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:43" (1/1) ... [2021-01-06 13:31:43,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:43" (1/1) ... [2021-01-06 13:31:43,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:43" (1/1) ... [2021-01-06 13:31:43,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:43" (1/1) ... [2021-01-06 13:31:43,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:43" (1/1) ... [2021-01-06 13:31:43,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:43" (1/1) ... [2021-01-06 13:31:43,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:43" (1/1) ... [2021-01-06 13:31:43,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 13:31:43,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 13:31:43,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 13:31:43,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 13:31:43,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:43" (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 13:31:43,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 13:31:43,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 13:31:43,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 13:31:43,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 13:31:45,513 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 13:31:45,514 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 13:31:45,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:31:45 BoogieIcfgContainer [2021-01-06 13:31:45,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 13:31:45,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 13:31:45,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 13:31:45,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 13:31:45,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 01:31:42" (1/3) ... [2021-01-06 13:31:45,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568ce5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 01:31:45, skipping insertion in model container [2021-01-06 13:31:45,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:31:43" (2/3) ... [2021-01-06 13:31:45,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568ce5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 01:31:45, skipping insertion in model container [2021-01-06 13:31:45,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:31:45" (3/3) ... [2021-01-06 13:31:45,528 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label30.c [2021-01-06 13:31:45,535 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 13:31:45,541 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 13:31:45,562 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 13:31:45,593 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 13:31:45,594 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 13:31:45,594 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 13:31:45,594 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 13:31:45,594 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 13:31:45,594 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 13:31:45,594 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 13:31:45,595 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 13:31:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2021-01-06 13:31:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-06 13:31:45,625 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:45,626 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] [2021-01-06 13:31:45,627 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:45,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1089129850, now seen corresponding path program 1 times [2021-01-06 13:31:45,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:45,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885229146] [2021-01-06 13:31:45,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:45,992 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 13:31:45,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885229146] [2021-01-06 13:31:45,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:31:45,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:31:45,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045501804] [2021-01-06 13:31:46,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:31:46,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:46,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:31:46,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:31:46,028 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 3 states. [2021-01-06 13:31:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:47,210 INFO L93 Difference]: Finished difference Result 567 states and 981 transitions. [2021-01-06 13:31:47,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:31:47,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2021-01-06 13:31:47,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:47,230 INFO L225 Difference]: With dead ends: 567 [2021-01-06 13:31:47,230 INFO L226 Difference]: Without dead ends: 282 [2021-01-06 13:31:47,235 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 13:31:47,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-01-06 13:31:47,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2021-01-06 13:31:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2021-01-06 13:31:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 412 transitions. [2021-01-06 13:31:47,300 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 412 transitions. Word has length 34 [2021-01-06 13:31:47,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:47,301 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 412 transitions. [2021-01-06 13:31:47,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:31:47,301 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 412 transitions. [2021-01-06 13:31:47,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-01-06 13:31:47,305 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:47,306 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:31:47,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 13:31:47,306 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:47,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:47,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1202022428, now seen corresponding path program 1 times [2021-01-06 13:31:47,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:47,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246519639] [2021-01-06 13:31:47,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:31:47,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246519639] [2021-01-06 13:31:47,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:31:47,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:31:47,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700920122] [2021-01-06 13:31:47,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:31:47,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:47,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:31:47,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:31:47,636 INFO L87 Difference]: Start difference. First operand 282 states and 412 transitions. Second operand 3 states. [2021-01-06 13:31:48,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:48,362 INFO L93 Difference]: Finished difference Result 840 states and 1231 transitions. [2021-01-06 13:31:48,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:31:48,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2021-01-06 13:31:48,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:48,367 INFO L225 Difference]: With dead ends: 840 [2021-01-06 13:31:48,368 INFO L226 Difference]: Without dead ends: 560 [2021-01-06 13:31:48,369 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 13:31:48,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2021-01-06 13:31:48,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2021-01-06 13:31:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2021-01-06 13:31:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 730 transitions. [2021-01-06 13:31:48,402 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 730 transitions. Word has length 104 [2021-01-06 13:31:48,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:48,402 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 730 transitions. [2021-01-06 13:31:48,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:31:48,403 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 730 transitions. [2021-01-06 13:31:48,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 13:31:48,407 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:48,408 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:31:48,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 13:31:48,408 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:48,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:48,409 INFO L82 PathProgramCache]: Analyzing trace with hash -560431948, now seen corresponding path program 1 times [2021-01-06 13:31:48,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:48,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653278523] [2021-01-06 13:31:48,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:31:48,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653278523] [2021-01-06 13:31:48,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045369664] [2021-01-06 13:31:48,591 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 13:31:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:48,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 13:31:48,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:31:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:31:48,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:31:48,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 13:31:48,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545274863] [2021-01-06 13:31:48,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:31:48,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:48,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:31:48,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:31:48,915 INFO L87 Difference]: Start difference. First operand 560 states and 730 transitions. Second operand 3 states. [2021-01-06 13:31:49,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:49,606 INFO L93 Difference]: Finished difference Result 1396 states and 1867 transitions. [2021-01-06 13:31:49,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:31:49,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2021-01-06 13:31:49,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:49,613 INFO L225 Difference]: With dead ends: 1396 [2021-01-06 13:31:49,613 INFO L226 Difference]: Without dead ends: 838 [2021-01-06 13:31:49,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 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 13:31:49,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2021-01-06 13:31:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2021-01-06 13:31:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2021-01-06 13:31:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1083 transitions. [2021-01-06 13:31:49,645 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1083 transitions. Word has length 109 [2021-01-06 13:31:49,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:49,646 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1083 transitions. [2021-01-06 13:31:49,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:31:49,646 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1083 transitions. [2021-01-06 13:31:49,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-01-06 13:31:49,650 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:49,650 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:31:49,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-06 13:31:49,864 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:49,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:49,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1284961652, now seen corresponding path program 1 times [2021-01-06 13:31:49,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:49,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935503941] [2021-01-06 13:31:49,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:31:50,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935503941] [2021-01-06 13:31:50,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:31:50,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:31:50,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102297729] [2021-01-06 13:31:50,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:31:50,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:50,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:31:50,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:31:50,064 INFO L87 Difference]: Start difference. First operand 838 states and 1083 transitions. Second operand 3 states. [2021-01-06 13:31:50,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:50,806 INFO L93 Difference]: Finished difference Result 2230 states and 2835 transitions. [2021-01-06 13:31:50,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:31:50,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2021-01-06 13:31:50,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:50,815 INFO L225 Difference]: With dead ends: 2230 [2021-01-06 13:31:50,815 INFO L226 Difference]: Without dead ends: 1394 [2021-01-06 13:31:50,817 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 13:31:50,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2021-01-06 13:31:50,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1255. [2021-01-06 13:31:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1255 states. [2021-01-06 13:31:50,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1505 transitions. [2021-01-06 13:31:50,850 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1505 transitions. Word has length 125 [2021-01-06 13:31:50,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:50,850 INFO L481 AbstractCegarLoop]: Abstraction has 1255 states and 1505 transitions. [2021-01-06 13:31:50,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:31:50,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1505 transitions. [2021-01-06 13:31:50,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-01-06 13:31:50,854 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:50,854 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:31:50,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 13:31:50,855 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:50,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:50,855 INFO L82 PathProgramCache]: Analyzing trace with hash -126231163, now seen corresponding path program 1 times [2021-01-06 13:31:50,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:50,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182340363] [2021-01-06 13:31:50,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:31:51,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182340363] [2021-01-06 13:31:51,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:31:51,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:31:51,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178899436] [2021-01-06 13:31:51,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:31:51,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:51,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:31:51,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:31:51,056 INFO L87 Difference]: Start difference. First operand 1255 states and 1505 transitions. Second operand 3 states. [2021-01-06 13:31:51,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:51,720 INFO L93 Difference]: Finished difference Result 2647 states and 3157 transitions. [2021-01-06 13:31:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:31:51,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2021-01-06 13:31:51,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:51,729 INFO L225 Difference]: With dead ends: 2647 [2021-01-06 13:31:51,729 INFO L226 Difference]: Without dead ends: 1394 [2021-01-06 13:31:51,732 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 13:31:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2021-01-06 13:31:51,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2021-01-06 13:31:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2021-01-06 13:31:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1649 transitions. [2021-01-06 13:31:51,761 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1649 transitions. Word has length 126 [2021-01-06 13:31:51,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:51,762 INFO L481 AbstractCegarLoop]: Abstraction has 1394 states and 1649 transitions. [2021-01-06 13:31:51,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:31:51,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1649 transitions. [2021-01-06 13:31:51,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-01-06 13:31:51,765 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:51,765 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:31:51,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 13:31:51,765 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:51,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:51,766 INFO L82 PathProgramCache]: Analyzing trace with hash 334684273, now seen corresponding path program 1 times [2021-01-06 13:31:51,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:51,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733782525] [2021-01-06 13:31:51,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-01-06 13:31:51,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733782525] [2021-01-06 13:31:51,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:31:51,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:31:51,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304141303] [2021-01-06 13:31:51,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:31:51,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:51,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:31:51,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:31:51,977 INFO L87 Difference]: Start difference. First operand 1394 states and 1649 transitions. Second operand 3 states. [2021-01-06 13:31:52,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:52,651 INFO L93 Difference]: Finished difference Result 2925 states and 3521 transitions. [2021-01-06 13:31:52,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:31:52,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2021-01-06 13:31:52,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:52,660 INFO L225 Difference]: With dead ends: 2925 [2021-01-06 13:31:52,661 INFO L226 Difference]: Without dead ends: 1672 [2021-01-06 13:31:52,663 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 13:31:52,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2021-01-06 13:31:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1672. [2021-01-06 13:31:52,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2021-01-06 13:31:52,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1952 transitions. [2021-01-06 13:31:52,699 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1952 transitions. Word has length 192 [2021-01-06 13:31:52,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:52,699 INFO L481 AbstractCegarLoop]: Abstraction has 1672 states and 1952 transitions. [2021-01-06 13:31:52,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:31:52,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1952 transitions. [2021-01-06 13:31:52,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-01-06 13:31:52,703 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:52,703 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:31:52,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 13:31:52,704 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:52,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:52,705 INFO L82 PathProgramCache]: Analyzing trace with hash -624322341, now seen corresponding path program 1 times [2021-01-06 13:31:52,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:52,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995916240] [2021-01-06 13:31:52,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-01-06 13:31:52,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995916240] [2021-01-06 13:31:52,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787809719] [2021-01-06 13:31:52,942 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 13:31:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:53,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 13:31:53,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:31:53,367 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-01-06 13:31:53,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:31:53,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2021-01-06 13:31:53,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445297551] [2021-01-06 13:31:53,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:31:53,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:53,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:31:53,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 13:31:53,370 INFO L87 Difference]: Start difference. First operand 1672 states and 1952 transitions. Second operand 3 states. [2021-01-06 13:31:54,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:54,041 INFO L93 Difference]: Finished difference Result 2508 states and 2933 transitions. [2021-01-06 13:31:54,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:31:54,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2021-01-06 13:31:54,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:54,053 INFO L225 Difference]: With dead ends: 2508 [2021-01-06 13:31:54,053 INFO L226 Difference]: Without dead ends: 2506 [2021-01-06 13:31:54,055 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 13:31:54,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2021-01-06 13:31:54,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1811. [2021-01-06 13:31:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2021-01-06 13:31:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2141 transitions. [2021-01-06 13:31:54,097 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2141 transitions. Word has length 193 [2021-01-06 13:31:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:54,098 INFO L481 AbstractCegarLoop]: Abstraction has 1811 states and 2141 transitions. [2021-01-06 13:31:54,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:31:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2141 transitions. [2021-01-06 13:31:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-01-06 13:31:54,101 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:54,102 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:31:54,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:31:54,316 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:54,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:54,317 INFO L82 PathProgramCache]: Analyzing trace with hash 543736396, now seen corresponding path program 1 times [2021-01-06 13:31:54,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:54,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101768748] [2021-01-06 13:31:54,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:31:54,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101768748] [2021-01-06 13:31:54,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:31:54,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:31:54,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961241775] [2021-01-06 13:31:54,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:31:54,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:54,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:31:54,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:31:54,467 INFO L87 Difference]: Start difference. First operand 1811 states and 2141 transitions. Second operand 3 states. [2021-01-06 13:31:55,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:55,206 INFO L93 Difference]: Finished difference Result 3898 states and 4694 transitions. [2021-01-06 13:31:55,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:31:55,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2021-01-06 13:31:55,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:55,217 INFO L225 Difference]: With dead ends: 3898 [2021-01-06 13:31:55,217 INFO L226 Difference]: Without dead ends: 2228 [2021-01-06 13:31:55,220 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 13:31:55,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2021-01-06 13:31:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2089. [2021-01-06 13:31:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2089 states. [2021-01-06 13:31:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2440 transitions. [2021-01-06 13:31:55,266 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2440 transitions. Word has length 194 [2021-01-06 13:31:55,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:55,267 INFO L481 AbstractCegarLoop]: Abstraction has 2089 states and 2440 transitions. [2021-01-06 13:31:55,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:31:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2440 transitions. [2021-01-06 13:31:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2021-01-06 13:31:55,272 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:55,272 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:31:55,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 13:31:55,273 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:55,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:55,273 INFO L82 PathProgramCache]: Analyzing trace with hash -556479966, now seen corresponding path program 1 times [2021-01-06 13:31:55,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:55,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895485200] [2021-01-06 13:31:55,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:55,632 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-01-06 13:31:55,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895485200] [2021-01-06 13:31:55,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:31:55,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 13:31:55,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125462212] [2021-01-06 13:31:55,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 13:31:55,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:55,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 13:31:55,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:31:55,639 INFO L87 Difference]: Start difference. First operand 2089 states and 2440 transitions. Second operand 7 states. [2021-01-06 13:31:56,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:56,400 INFO L93 Difference]: Finished difference Result 4092 states and 4789 transitions. [2021-01-06 13:31:56,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 13:31:56,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 246 [2021-01-06 13:31:56,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:56,411 INFO L225 Difference]: With dead ends: 4092 [2021-01-06 13:31:56,411 INFO L226 Difference]: Without dead ends: 2089 [2021-01-06 13:31:56,415 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:31:56,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2021-01-06 13:31:56,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2089. [2021-01-06 13:31:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2089 states. [2021-01-06 13:31:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2429 transitions. [2021-01-06 13:31:56,484 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2429 transitions. Word has length 246 [2021-01-06 13:31:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:56,484 INFO L481 AbstractCegarLoop]: Abstraction has 2089 states and 2429 transitions. [2021-01-06 13:31:56,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 13:31:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2429 transitions. [2021-01-06 13:31:56,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2021-01-06 13:31:56,490 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:56,491 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:31:56,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 13:31:56,494 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:56,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:56,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1050013116, now seen corresponding path program 1 times [2021-01-06 13:31:56,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:56,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918473254] [2021-01-06 13:31:56,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:31:56,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918473254] [2021-01-06 13:31:56,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:31:56,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 13:31:56,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053359525] [2021-01-06 13:31:56,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:31:56,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:56,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:31:56,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:31:56,792 INFO L87 Difference]: Start difference. First operand 2089 states and 2429 transitions. Second operand 4 states. [2021-01-06 13:31:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:57,882 INFO L93 Difference]: Finished difference Result 4315 states and 5054 transitions. [2021-01-06 13:31:57,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:31:57,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2021-01-06 13:31:57,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:57,895 INFO L225 Difference]: With dead ends: 4315 [2021-01-06 13:31:57,895 INFO L226 Difference]: Without dead ends: 2367 [2021-01-06 13:31:57,898 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 13:31:57,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2021-01-06 13:31:57,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2367. [2021-01-06 13:31:57,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2021-01-06 13:31:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 2696 transitions. [2021-01-06 13:31:57,948 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 2696 transitions. Word has length 282 [2021-01-06 13:31:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:57,949 INFO L481 AbstractCegarLoop]: Abstraction has 2367 states and 2696 transitions. [2021-01-06 13:31:57,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:31:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2696 transitions. [2021-01-06 13:31:57,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2021-01-06 13:31:57,955 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:57,955 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:31:57,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 13:31:57,955 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:57,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:57,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1732473944, now seen corresponding path program 1 times [2021-01-06 13:31:57,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:57,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000325361] [2021-01-06 13:31:57,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:31:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 75 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2021-01-06 13:31:58,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000325361] [2021-01-06 13:31:58,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021727746] [2021-01-06 13:31:58,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:31:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:31:58,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 13:31:58,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:31:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2021-01-06 13:31:58,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:31:58,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 13:31:58,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512498966] [2021-01-06 13:31:58,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:31:58,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:31:58,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:31:58,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:31:58,864 INFO L87 Difference]: Start difference. First operand 2367 states and 2696 transitions. Second operand 3 states. [2021-01-06 13:31:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:31:59,626 INFO L93 Difference]: Finished difference Result 3203 states and 3591 transitions. [2021-01-06 13:31:59,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:31:59,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 295 [2021-01-06 13:31:59,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:31:59,642 INFO L225 Difference]: With dead ends: 3203 [2021-01-06 13:31:59,642 INFO L226 Difference]: Without dead ends: 3201 [2021-01-06 13:31:59,644 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 294 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 13:31:59,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2021-01-06 13:31:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 2228. [2021-01-06 13:31:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2021-01-06 13:31:59,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2538 transitions. [2021-01-06 13:31:59,707 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2538 transitions. Word has length 295 [2021-01-06 13:31:59,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:31:59,708 INFO L481 AbstractCegarLoop]: Abstraction has 2228 states and 2538 transitions. [2021-01-06 13:31:59,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:31:59,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2538 transitions. [2021-01-06 13:31:59,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2021-01-06 13:31:59,716 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:31:59,716 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:31:59,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-01-06 13:31:59,929 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:31:59,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:31:59,931 INFO L82 PathProgramCache]: Analyzing trace with hash -993176621, now seen corresponding path program 1 times [2021-01-06 13:31:59,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:31:59,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531785019] [2021-01-06 13:31:59,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:32:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:32:00,671 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 10 proven. 261 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-01-06 13:32:00,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531785019] [2021-01-06 13:32:00,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648442598] [2021-01-06 13:32:00,672 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 13:32:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:32:00,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 13:32:00,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:32:01,097 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 13:32:01,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 13:32:01,166 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 13:32:01,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 13:32:01,193 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 13:32:01,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 13:32:01,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:32:01,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:32:01,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 13:32:01,233 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:32:01,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 13:32:01,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:32:01,262 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 13:32:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2021-01-06 13:32:01,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:32:01,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 13:32:01,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584566244] [2021-01-06 13:32:01,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:32:01,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:32:01,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:32:01,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:32:01,468 INFO L87 Difference]: Start difference. First operand 2228 states and 2538 transitions. Second operand 3 states. [2021-01-06 13:32:02,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:32:02,445 INFO L93 Difference]: Finished difference Result 5008 states and 5743 transitions. [2021-01-06 13:32:02,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:32:02,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2021-01-06 13:32:02,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:32:02,449 INFO L225 Difference]: With dead ends: 5008 [2021-01-06 13:32:02,449 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 13:32:02,455 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:32:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 13:32:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 13:32:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 13:32:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 13:32:02,456 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 331 [2021-01-06 13:32:02,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:32:02,457 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 13:32:02,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:32:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 13:32:02,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 13:32:02,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:32:02,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 13:32:03,091 WARN L197 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-01-06 13:32:03,349 WARN L197 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-01-06 13:32:03,354 INFO L189 CegarLoopUtils]: For program point L597(line 597) no Hoare annotation was computed. [2021-01-06 13:32:03,354 INFO L189 CegarLoopUtils]: For program point L564(lines 564 582) no Hoare annotation was computed. [2021-01-06 13:32:03,354 INFO L189 CegarLoopUtils]: For program point L333(lines 333 582) no Hoare annotation was computed. [2021-01-06 13:32:03,355 INFO L189 CegarLoopUtils]: For program point L367(lines 367 582) no Hoare annotation was computed. [2021-01-06 13:32:03,355 INFO L189 CegarLoopUtils]: For program point L301(lines 301 582) no Hoare annotation was computed. [2021-01-06 13:32:03,355 INFO L189 CegarLoopUtils]: For program point L235(lines 235 582) no Hoare annotation was computed. [2021-01-06 13:32:03,355 INFO L189 CegarLoopUtils]: For program point L202-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,355 INFO L189 CegarLoopUtils]: For program point L169-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,355 INFO L189 CegarLoopUtils]: For program point L136-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,355 INFO L189 CegarLoopUtils]: For program point L103-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,355 INFO L189 CegarLoopUtils]: For program point L70-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,356 INFO L189 CegarLoopUtils]: For program point L37-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,356 INFO L189 CegarLoopUtils]: For program point L533(lines 533 582) no Hoare annotation was computed. [2021-01-06 13:32:03,356 INFO L189 CegarLoopUtils]: For program point L203(line 203) no Hoare annotation was computed. [2021-01-06 13:32:03,356 INFO L189 CegarLoopUtils]: For program point L170(line 170) no Hoare annotation was computed. [2021-01-06 13:32:03,356 INFO L189 CegarLoopUtils]: For program point L137(line 137) no Hoare annotation was computed. [2021-01-06 13:32:03,357 INFO L189 CegarLoopUtils]: For program point L104(line 104) no Hoare annotation was computed. [2021-01-06 13:32:03,357 INFO L189 CegarLoopUtils]: For program point L71(line 71) no Hoare annotation was computed. [2021-01-06 13:32:03,357 INFO L189 CegarLoopUtils]: For program point L38(line 38) no Hoare annotation was computed. [2021-01-06 13:32:03,357 INFO L189 CegarLoopUtils]: For program point L567(lines 567 582) no Hoare annotation was computed. [2021-01-06 13:32:03,358 INFO L189 CegarLoopUtils]: For program point L435(lines 435 582) no Hoare annotation was computed. [2021-01-06 13:32:03,358 INFO L189 CegarLoopUtils]: For program point L336(lines 336 582) no Hoare annotation was computed. [2021-01-06 13:32:03,358 INFO L189 CegarLoopUtils]: For program point L270(lines 270 582) no Hoare annotation was computed. [2021-01-06 13:32:03,358 INFO L189 CegarLoopUtils]: For program point L403(lines 403 582) no Hoare annotation was computed. [2021-01-06 13:32:03,358 INFO L189 CegarLoopUtils]: For program point L370(lines 370 582) no Hoare annotation was computed. [2021-01-06 13:32:03,358 INFO L189 CegarLoopUtils]: For program point L205-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,358 INFO L189 CegarLoopUtils]: For program point L172-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,358 INFO L189 CegarLoopUtils]: For program point L139-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,359 INFO L189 CegarLoopUtils]: For program point L106-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,359 INFO L189 CegarLoopUtils]: For program point L73-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,359 INFO L189 CegarLoopUtils]: For program point L40-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,359 INFO L189 CegarLoopUtils]: For program point L536(lines 536 582) no Hoare annotation was computed. [2021-01-06 13:32:03,359 INFO L189 CegarLoopUtils]: For program point L503(lines 503 582) no Hoare annotation was computed. [2021-01-06 13:32:03,359 INFO L189 CegarLoopUtils]: For program point L470(lines 470 582) no Hoare annotation was computed. [2021-01-06 13:32:03,359 INFO L189 CegarLoopUtils]: For program point L206(line 206) no Hoare annotation was computed. [2021-01-06 13:32:03,359 INFO L189 CegarLoopUtils]: For program point L173(line 173) no Hoare annotation was computed. [2021-01-06 13:32:03,359 INFO L189 CegarLoopUtils]: For program point L140(line 140) no Hoare annotation was computed. [2021-01-06 13:32:03,360 INFO L189 CegarLoopUtils]: For program point L107(line 107) no Hoare annotation was computed. [2021-01-06 13:32:03,360 INFO L189 CegarLoopUtils]: For program point L74(line 74) no Hoare annotation was computed. [2021-01-06 13:32:03,360 INFO L189 CegarLoopUtils]: For program point L41(line 41) no Hoare annotation was computed. [2021-01-06 13:32:03,360 INFO L189 CegarLoopUtils]: For program point L339(lines 339 582) no Hoare annotation was computed. [2021-01-06 13:32:03,360 INFO L189 CegarLoopUtils]: For program point L306(lines 306 582) no Hoare annotation was computed. [2021-01-06 13:32:03,360 INFO L189 CegarLoopUtils]: For program point L241(lines 241 582) no Hoare annotation was computed. [2021-01-06 13:32:03,360 INFO L189 CegarLoopUtils]: For program point L208-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,360 INFO L189 CegarLoopUtils]: For program point L175-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,361 INFO L189 CegarLoopUtils]: For program point L142-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,361 INFO L189 CegarLoopUtils]: For program point L109-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,361 INFO L189 CegarLoopUtils]: For program point L76-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,361 INFO L189 CegarLoopUtils]: For program point L43-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,361 INFO L189 CegarLoopUtils]: For program point L539(lines 539 582) no Hoare annotation was computed. [2021-01-06 13:32:03,361 INFO L189 CegarLoopUtils]: For program point L440(lines 440 582) no Hoare annotation was computed. [2021-01-06 13:32:03,361 INFO L189 CegarLoopUtils]: For program point L275(lines 275 582) no Hoare annotation was computed. [2021-01-06 13:32:03,361 INFO L189 CegarLoopUtils]: For program point L209(line 209) no Hoare annotation was computed. [2021-01-06 13:32:03,362 INFO L189 CegarLoopUtils]: For program point L176(line 176) no Hoare annotation was computed. [2021-01-06 13:32:03,362 INFO L189 CegarLoopUtils]: For program point L143(line 143) no Hoare annotation was computed. [2021-01-06 13:32:03,362 INFO L189 CegarLoopUtils]: For program point L110(line 110) no Hoare annotation was computed. [2021-01-06 13:32:03,362 INFO L189 CegarLoopUtils]: For program point L77(line 77) no Hoare annotation was computed. [2021-01-06 13:32:03,362 INFO L189 CegarLoopUtils]: For program point L44(line 44) no Hoare annotation was computed. [2021-01-06 13:32:03,362 INFO L189 CegarLoopUtils]: For program point L573(lines 573 582) no Hoare annotation was computed. [2021-01-06 13:32:03,362 INFO L189 CegarLoopUtils]: For program point L408(lines 408 582) no Hoare annotation was computed. [2021-01-06 13:32:03,362 INFO L189 CegarLoopUtils]: For program point L375(lines 375 582) no Hoare annotation was computed. [2021-01-06 13:32:03,362 INFO L189 CegarLoopUtils]: For program point L475(lines 475 582) no Hoare annotation was computed. [2021-01-06 13:32:03,363 INFO L189 CegarLoopUtils]: For program point L211-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,363 INFO L189 CegarLoopUtils]: For program point L178-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,363 INFO L189 CegarLoopUtils]: For program point L145-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,363 INFO L189 CegarLoopUtils]: For program point L112-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,363 INFO L189 CegarLoopUtils]: For program point L79-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,363 INFO L189 CegarLoopUtils]: For program point L46-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,363 INFO L189 CegarLoopUtils]: For program point L509(lines 509 582) no Hoare annotation was computed. [2021-01-06 13:32:03,363 INFO L189 CegarLoopUtils]: For program point L311(lines 311 582) no Hoare annotation was computed. [2021-01-06 13:32:03,363 INFO L189 CegarLoopUtils]: For program point L212(line 212) no Hoare annotation was computed. [2021-01-06 13:32:03,364 INFO L189 CegarLoopUtils]: For program point L179(line 179) no Hoare annotation was computed. [2021-01-06 13:32:03,364 INFO L189 CegarLoopUtils]: For program point L146(line 146) no Hoare annotation was computed. [2021-01-06 13:32:03,364 INFO L189 CegarLoopUtils]: For program point L113(line 113) no Hoare annotation was computed. [2021-01-06 13:32:03,364 INFO L189 CegarLoopUtils]: For program point L80(line 80) no Hoare annotation was computed. [2021-01-06 13:32:03,364 INFO L189 CegarLoopUtils]: For program point L47(line 47) no Hoare annotation was computed. [2021-01-06 13:32:03,364 INFO L189 CegarLoopUtils]: For program point L345(lines 345 582) no Hoare annotation was computed. [2021-01-06 13:32:03,364 INFO L189 CegarLoopUtils]: For program point L246(lines 246 582) no Hoare annotation was computed. [2021-01-06 13:32:03,364 INFO L189 CegarLoopUtils]: For program point L544(lines 544 582) no Hoare annotation was computed. [2021-01-06 13:32:03,364 INFO L189 CegarLoopUtils]: For program point L181-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,365 INFO L189 CegarLoopUtils]: For program point L148-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,365 INFO L189 CegarLoopUtils]: For program point L115-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,365 INFO L189 CegarLoopUtils]: For program point L82-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,365 INFO L189 CegarLoopUtils]: For program point L49-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,365 INFO L189 CegarLoopUtils]: For program point L446(lines 446 582) no Hoare annotation was computed. [2021-01-06 13:32:03,365 INFO L189 CegarLoopUtils]: For program point L413(lines 413 582) no Hoare annotation was computed. [2021-01-06 13:32:03,365 INFO L189 CegarLoopUtils]: For program point L380(lines 380 582) no Hoare annotation was computed. [2021-01-06 13:32:03,365 INFO L189 CegarLoopUtils]: For program point L281(lines 281 582) no Hoare annotation was computed. [2021-01-06 13:32:03,366 INFO L189 CegarLoopUtils]: For program point L182(line 182) no Hoare annotation was computed. [2021-01-06 13:32:03,366 INFO L189 CegarLoopUtils]: For program point L149(line 149) no Hoare annotation was computed. [2021-01-06 13:32:03,366 INFO L189 CegarLoopUtils]: For program point L116(line 116) no Hoare annotation was computed. [2021-01-06 13:32:03,366 INFO L189 CegarLoopUtils]: For program point L83(line 83) no Hoare annotation was computed. [2021-01-06 13:32:03,366 INFO L189 CegarLoopUtils]: For program point L50(line 50) no Hoare annotation was computed. [2021-01-06 13:32:03,366 INFO L189 CegarLoopUtils]: For program point L579(lines 579 582) no Hoare annotation was computed. [2021-01-06 13:32:03,366 INFO L189 CegarLoopUtils]: For program point L249(lines 249 582) no Hoare annotation was computed. [2021-01-06 13:32:03,368 INFO L189 CegarLoopUtils]: For program point L514(lines 514 582) no Hoare annotation was computed. [2021-01-06 13:32:03,368 INFO L189 CegarLoopUtils]: For program point L481(lines 481 582) no Hoare annotation was computed. [2021-01-06 13:32:03,368 INFO L189 CegarLoopUtils]: For program point L316(lines 316 582) no Hoare annotation was computed. [2021-01-06 13:32:03,368 INFO L189 CegarLoopUtils]: For program point L184-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,368 INFO L189 CegarLoopUtils]: For program point L151-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,368 INFO L189 CegarLoopUtils]: For program point L118-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,369 INFO L189 CegarLoopUtils]: For program point L85-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,369 INFO L189 CegarLoopUtils]: For program point L52-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,369 INFO L189 CegarLoopUtils]: For program point L350(lines 350 582) no Hoare annotation was computed. [2021-01-06 13:32:03,369 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 13:32:03,369 INFO L189 CegarLoopUtils]: For program point L185(line 185) no Hoare annotation was computed. [2021-01-06 13:32:03,369 INFO L189 CegarLoopUtils]: For program point L152(line 152) no Hoare annotation was computed. [2021-01-06 13:32:03,369 INFO L189 CegarLoopUtils]: For program point L119(line 119) no Hoare annotation was computed. [2021-01-06 13:32:03,369 INFO L189 CegarLoopUtils]: For program point L86(line 86) no Hoare annotation was computed. [2021-01-06 13:32:03,369 INFO L189 CegarLoopUtils]: For program point L53(line 53) no Hoare annotation was computed. [2021-01-06 13:32:03,370 INFO L185 CegarLoopUtils]: At program point L583(lines 30 584) the Hoare annotation is: (let ((.cse1 (< (div (+ (* ~a1~0 (- 1)) 206) (- 89)) 1)) (.cse5 (<= 8 ~a19~0)) (.cse4 (= ~a10~0 1)) (.cse7 (<= 9 ~a19~0)) (.cse0 (= 14 ~a4~0)) (.cse6 (= ~a10~0 0)) (.cse2 (= ~a12~0 0)) (.cse3 (<= ~a19~0 9))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 218 ~a1~0) .cse4 .cse0 .cse2) (and .cse5 .cse0 (= ~a10~0 2) .cse2 .cse3) (and .cse0 .cse6 .cse1 .cse2) (and .cse7 .cse0 .cse2 .cse3) (and .cse5 .cse0 .cse2 .cse3 (= ~a10~0 4)) (and (= ~a19~0 8) .cse4 .cse0 .cse2) (and .cse4 .cse7 .cse0 .cse2) (and .cse0 .cse6 .cse2 .cse3))) [2021-01-06 13:32:03,370 INFO L189 CegarLoopUtils]: For program point L550(lines 550 582) no Hoare annotation was computed. [2021-01-06 13:32:03,370 INFO L189 CegarLoopUtils]: For program point L418(lines 418 582) no Hoare annotation was computed. [2021-01-06 13:32:03,370 INFO L189 CegarLoopUtils]: For program point L385(lines 385 582) no Hoare annotation was computed. [2021-01-06 13:32:03,370 INFO L189 CegarLoopUtils]: For program point L220(lines 220 582) no Hoare annotation was computed. [2021-01-06 13:32:03,370 INFO L189 CegarLoopUtils]: For program point L187-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,370 INFO L189 CegarLoopUtils]: For program point L154-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,370 INFO L189 CegarLoopUtils]: For program point L121-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,371 INFO L189 CegarLoopUtils]: For program point L88-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,371 INFO L189 CegarLoopUtils]: For program point L55-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,371 INFO L189 CegarLoopUtils]: For program point L452(lines 452 582) no Hoare annotation was computed. [2021-01-06 13:32:03,371 INFO L189 CegarLoopUtils]: For program point L287(lines 287 582) no Hoare annotation was computed. [2021-01-06 13:32:03,371 INFO L189 CegarLoopUtils]: For program point L254(lines 254 582) no Hoare annotation was computed. [2021-01-06 13:32:03,371 INFO L189 CegarLoopUtils]: For program point L188(line 188) no Hoare annotation was computed. [2021-01-06 13:32:03,371 INFO L189 CegarLoopUtils]: For program point L155(line 155) no Hoare annotation was computed. [2021-01-06 13:32:03,371 INFO L189 CegarLoopUtils]: For program point L122(line 122) no Hoare annotation was computed. [2021-01-06 13:32:03,372 INFO L189 CegarLoopUtils]: For program point L89(line 89) no Hoare annotation was computed. [2021-01-06 13:32:03,372 INFO L189 CegarLoopUtils]: For program point L56(line 56) no Hoare annotation was computed. [2021-01-06 13:32:03,372 INFO L189 CegarLoopUtils]: For program point L519(lines 519 582) no Hoare annotation was computed. [2021-01-06 13:32:03,372 INFO L189 CegarLoopUtils]: For program point L486(lines 486 582) no Hoare annotation was computed. [2021-01-06 13:32:03,372 INFO L192 CegarLoopUtils]: At program point L586(lines 586 602) the Hoare annotation is: true [2021-01-06 13:32:03,372 INFO L189 CegarLoopUtils]: For program point L388(lines 388 582) no Hoare annotation was computed. [2021-01-06 13:32:03,372 INFO L189 CegarLoopUtils]: For program point L355(lines 355 582) no Hoare annotation was computed. [2021-01-06 13:32:03,373 INFO L189 CegarLoopUtils]: For program point L322(lines 322 582) no Hoare annotation was computed. [2021-01-06 13:32:03,373 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 13:32:03,373 INFO L189 CegarLoopUtils]: For program point L190-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,373 INFO L189 CegarLoopUtils]: For program point L157-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,373 INFO L189 CegarLoopUtils]: For program point L124-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,373 INFO L189 CegarLoopUtils]: For program point L91-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,373 INFO L189 CegarLoopUtils]: For program point L58-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,374 INFO L189 CegarLoopUtils]: For program point L191(line 191) no Hoare annotation was computed. [2021-01-06 13:32:03,374 INFO L189 CegarLoopUtils]: For program point L158(line 158) no Hoare annotation was computed. [2021-01-06 13:32:03,374 INFO L189 CegarLoopUtils]: For program point L125(line 125) no Hoare annotation was computed. [2021-01-06 13:32:03,374 INFO L189 CegarLoopUtils]: For program point L92(line 92) no Hoare annotation was computed. [2021-01-06 13:32:03,374 INFO L189 CegarLoopUtils]: For program point L59(line 59) no Hoare annotation was computed. [2021-01-06 13:32:03,374 INFO L189 CegarLoopUtils]: For program point L555(lines 555 582) no Hoare annotation was computed. [2021-01-06 13:32:03,374 INFO L189 CegarLoopUtils]: For program point L225(lines 225 582) no Hoare annotation was computed. [2021-01-06 13:32:03,374 INFO L189 CegarLoopUtils]: For program point L424(lines 424 582) no Hoare annotation was computed. [2021-01-06 13:32:03,374 INFO L189 CegarLoopUtils]: For program point L259(lines 259 582) no Hoare annotation was computed. [2021-01-06 13:32:03,374 INFO L189 CegarLoopUtils]: For program point L193-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,374 INFO L189 CegarLoopUtils]: For program point L160-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,374 INFO L189 CegarLoopUtils]: For program point L127-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,374 INFO L189 CegarLoopUtils]: For program point L94-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,375 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 13:32:03,375 INFO L189 CegarLoopUtils]: For program point L61-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,375 INFO L189 CegarLoopUtils]: For program point L524(lines 524 582) no Hoare annotation was computed. [2021-01-06 13:32:03,375 INFO L189 CegarLoopUtils]: For program point L491(lines 491 582) no Hoare annotation was computed. [2021-01-06 13:32:03,375 INFO L189 CegarLoopUtils]: For program point L458(lines 458 582) no Hoare annotation was computed. [2021-01-06 13:32:03,375 INFO L189 CegarLoopUtils]: For program point L293(lines 293 582) no Hoare annotation was computed. [2021-01-06 13:32:03,375 INFO L189 CegarLoopUtils]: For program point L194(line 194) no Hoare annotation was computed. [2021-01-06 13:32:03,375 INFO L189 CegarLoopUtils]: For program point L161(line 161) no Hoare annotation was computed. [2021-01-06 13:32:03,376 INFO L189 CegarLoopUtils]: For program point L128(line 128) no Hoare annotation was computed. [2021-01-06 13:32:03,376 INFO L189 CegarLoopUtils]: For program point L95(line 95) no Hoare annotation was computed. [2021-01-06 13:32:03,376 INFO L189 CegarLoopUtils]: For program point L62(line 62) no Hoare annotation was computed. [2021-01-06 13:32:03,376 INFO L189 CegarLoopUtils]: For program point L558(lines 558 582) no Hoare annotation was computed. [2021-01-06 13:32:03,376 INFO L189 CegarLoopUtils]: For program point L393(lines 393 582) no Hoare annotation was computed. [2021-01-06 13:32:03,376 INFO L189 CegarLoopUtils]: For program point L327(lines 327 582) no Hoare annotation was computed. [2021-01-06 13:32:03,376 INFO L185 CegarLoopUtils]: At program point L592-2(lines 592 601) the Hoare annotation is: (let ((.cse1 (< (div (+ (* ~a1~0 (- 1)) 206) (- 89)) 1)) (.cse5 (<= 8 ~a19~0)) (.cse4 (= ~a10~0 1)) (.cse7 (<= 9 ~a19~0)) (.cse0 (= 14 ~a4~0)) (.cse6 (= ~a10~0 0)) (.cse2 (= ~a12~0 0)) (.cse3 (<= ~a19~0 9))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 218 ~a1~0) .cse4 .cse0 .cse2) (and .cse5 .cse0 (= ~a10~0 2) .cse2 .cse3) (and .cse0 .cse6 .cse1 .cse2) (and .cse7 .cse0 .cse2 .cse3) (and .cse5 .cse0 .cse2 .cse3 (= ~a10~0 4)) (and (= ~a19~0 8) .cse4 .cse0 .cse2) (and .cse4 .cse7 .cse0 .cse2) (and .cse0 .cse6 .cse2 .cse3))) [2021-01-06 13:32:03,377 INFO L189 CegarLoopUtils]: For program point L361(lines 361 582) no Hoare annotation was computed. [2021-01-06 13:32:03,377 INFO L189 CegarLoopUtils]: For program point L196-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,377 INFO L189 CegarLoopUtils]: For program point L163-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,377 INFO L189 CegarLoopUtils]: For program point L130-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,377 INFO L189 CegarLoopUtils]: For program point L97-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,377 INFO L189 CegarLoopUtils]: For program point L31(lines 31 33) no Hoare annotation was computed. [2021-01-06 13:32:03,377 INFO L189 CegarLoopUtils]: For program point L64-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,377 INFO L189 CegarLoopUtils]: For program point L31-2(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,377 INFO L189 CegarLoopUtils]: For program point L527(lines 527 582) no Hoare annotation was computed. [2021-01-06 13:32:03,378 INFO L189 CegarLoopUtils]: For program point L296(lines 296 582) no Hoare annotation was computed. [2021-01-06 13:32:03,378 INFO L189 CegarLoopUtils]: For program point L230(lines 230 582) no Hoare annotation was computed. [2021-01-06 13:32:03,378 INFO L189 CegarLoopUtils]: For program point L197(line 197) no Hoare annotation was computed. [2021-01-06 13:32:03,378 INFO L189 CegarLoopUtils]: For program point L164(line 164) no Hoare annotation was computed. [2021-01-06 13:32:03,378 INFO L189 CegarLoopUtils]: For program point L131(line 131) no Hoare annotation was computed. [2021-01-06 13:32:03,378 INFO L189 CegarLoopUtils]: For program point L98(line 98) no Hoare annotation was computed. [2021-01-06 13:32:03,378 INFO L189 CegarLoopUtils]: For program point L65(line 65) no Hoare annotation was computed. [2021-01-06 13:32:03,378 INFO L189 CegarLoopUtils]: For program point L32(line 32) no Hoare annotation was computed. [2021-01-06 13:32:03,378 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 13:32:03,379 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 116) no Hoare annotation was computed. [2021-01-06 13:32:03,379 INFO L189 CegarLoopUtils]: For program point L429(lines 429 582) no Hoare annotation was computed. [2021-01-06 13:32:03,379 INFO L189 CegarLoopUtils]: For program point L330(lines 330 582) no Hoare annotation was computed. [2021-01-06 13:32:03,379 INFO L189 CegarLoopUtils]: For program point L264(lines 264 582) no Hoare annotation was computed. [2021-01-06 13:32:03,379 INFO L189 CegarLoopUtils]: For program point L364(lines 364 582) no Hoare annotation was computed. [2021-01-06 13:32:03,379 INFO L189 CegarLoopUtils]: For program point L199-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,379 INFO L189 CegarLoopUtils]: For program point L166-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,379 INFO L189 CegarLoopUtils]: For program point L133-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,380 INFO L189 CegarLoopUtils]: For program point L100-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,380 INFO L189 CegarLoopUtils]: For program point L67-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,380 INFO L189 CegarLoopUtils]: For program point L34-1(lines 30 584) no Hoare annotation was computed. [2021-01-06 13:32:03,380 INFO L189 CegarLoopUtils]: For program point L497(lines 497 582) no Hoare annotation was computed. [2021-01-06 13:32:03,380 INFO L189 CegarLoopUtils]: For program point L464(lines 464 582) no Hoare annotation was computed. [2021-01-06 13:32:03,380 INFO L189 CegarLoopUtils]: For program point L398(lines 398 582) no Hoare annotation was computed. [2021-01-06 13:32:03,380 INFO L189 CegarLoopUtils]: For program point L200(line 200) no Hoare annotation was computed. [2021-01-06 13:32:03,380 INFO L189 CegarLoopUtils]: For program point L167(line 167) no Hoare annotation was computed. [2021-01-06 13:32:03,380 INFO L189 CegarLoopUtils]: For program point L134(line 134) no Hoare annotation was computed. [2021-01-06 13:32:03,381 INFO L189 CegarLoopUtils]: For program point L101(line 101) no Hoare annotation was computed. [2021-01-06 13:32:03,381 INFO L189 CegarLoopUtils]: For program point L68(line 68) no Hoare annotation was computed. [2021-01-06 13:32:03,381 INFO L189 CegarLoopUtils]: For program point L35(line 35) no Hoare annotation was computed. [2021-01-06 13:32:03,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 01:32:03 BoogieIcfgContainer [2021-01-06 13:32:03,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 13:32:03,409 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 13:32:03,409 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 13:32:03,409 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 13:32:03,410 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:31:45" (3/4) ... [2021-01-06 13:32:03,414 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 13:32:03,455 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-01-06 13:32:03,457 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 13:32:03,458 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 13:32:03,459 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 13:32:03,647 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/eca-rers2012/Problem10_label30.c-witness.graphml [2021-01-06 13:32:03,647 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 13:32:03,649 INFO L168 Benchmark]: Toolchain (without parser) took 20856.02 ms. Allocated memory was 152.0 MB in the beginning and 450.9 MB in the end (delta: 298.8 MB). Free memory was 125.6 MB in the beginning and 358.2 MB in the end (delta: -232.7 MB). Peak memory consumption was 67.1 MB. Max. memory is 8.0 GB. [2021-01-06 13:32:03,649 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 152.0 MB. Free memory is still 124.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 13:32:03,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.14 ms. Allocated memory is still 152.0 MB. Free memory was 125.4 MB in the beginning and 132.2 MB in the end (delta: -6.8 MB). Peak memory consumption was 32.5 MB. Max. memory is 8.0 GB. [2021-01-06 13:32:03,650 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.99 ms. Allocated memory is still 152.0 MB. Free memory was 132.2 MB in the beginning and 124.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2021-01-06 13:32:03,651 INFO L168 Benchmark]: Boogie Preprocessor took 96.74 ms. Allocated memory is still 152.0 MB. Free memory was 124.4 MB in the beginning and 119.1 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2021-01-06 13:32:03,651 INFO L168 Benchmark]: RCFGBuilder took 1761.38 ms. Allocated memory was 152.0 MB in the beginning and 197.1 MB in the end (delta: 45.1 MB). Free memory was 119.1 MB in the beginning and 132.8 MB in the end (delta: -13.7 MB). Peak memory consumption was 71.2 MB. Max. memory is 8.0 GB. [2021-01-06 13:32:03,652 INFO L168 Benchmark]: TraceAbstraction took 17888.21 ms. Allocated memory was 197.1 MB in the beginning and 450.9 MB in the end (delta: 253.8 MB). Free memory was 132.3 MB in the beginning and 372.9 MB in the end (delta: -240.6 MB). Peak memory consumption was 233.3 MB. Max. memory is 8.0 GB. [2021-01-06 13:32:03,652 INFO L168 Benchmark]: Witness Printer took 238.09 ms. Allocated memory is still 450.9 MB. Free memory was 372.9 MB in the beginning and 358.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-01-06 13:32:03,655 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 152.0 MB. Free memory is still 124.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 749.14 ms. Allocated memory is still 152.0 MB. Free memory was 125.4 MB in the beginning and 132.2 MB in the end (delta: -6.8 MB). Peak memory consumption was 32.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 112.99 ms. Allocated memory is still 152.0 MB. Free memory was 132.2 MB in the beginning and 124.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 96.74 ms. Allocated memory is still 152.0 MB. Free memory was 124.4 MB in the beginning and 119.1 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1761.38 ms. Allocated memory was 152.0 MB in the beginning and 197.1 MB in the end (delta: 45.1 MB). Free memory was 119.1 MB in the beginning and 132.8 MB in the end (delta: -13.7 MB). Peak memory consumption was 71.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 17888.21 ms. Allocated memory was 197.1 MB in the beginning and 450.9 MB in the end (delta: 253.8 MB). Free memory was 132.3 MB in the beginning and 372.9 MB in the end (delta: -240.6 MB). Peak memory consumption was 233.3 MB. Max. memory is 8.0 GB. * Witness Printer took 238.09 ms. Allocated memory is still 450.9 MB. Free memory was 372.9 MB in the beginning and 358.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 116]: 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: 592]: Loop Invariant Derived loop invariant: ((((((((((14 == a4 && (a1 * -1 + 206) / -89 < 1) && a12 == 0) && a19 <= 9) || (((218 < a1 && a10 == 1) && 14 == a4) && a12 == 0)) || ((((8 <= a19 && 14 == a4) && a10 == 2) && a12 == 0) && a19 <= 9)) || (((14 == a4 && a10 == 0) && (a1 * -1 + 206) / -89 < 1) && a12 == 0)) || (((9 <= a19 && 14 == a4) && a12 == 0) && a19 <= 9)) || ((((8 <= a19 && 14 == a4) && a12 == 0) && a19 <= 9) && a10 == 4)) || (((a19 == 8 && a10 == 1) && 14 == a4) && a12 == 0)) || (((a10 == 1 && 9 <= a19) && 14 == a4) && a12 == 0)) || (((14 == a4 && a10 == 0) && a12 == 0) && a19 <= 9) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((14 == a4 && (a1 * -1 + 206) / -89 < 1) && a12 == 0) && a19 <= 9) || (((218 < a1 && a10 == 1) && 14 == a4) && a12 == 0)) || ((((8 <= a19 && 14 == a4) && a10 == 2) && a12 == 0) && a19 <= 9)) || (((14 == a4 && a10 == 0) && (a1 * -1 + 206) / -89 < 1) && a12 == 0)) || (((9 <= a19 && 14 == a4) && a12 == 0) && a19 <= 9)) || ((((8 <= a19 && 14 == a4) && a12 == 0) && a19 <= 9) && a10 == 4)) || (((a19 == 8 && a10 == 1) && 14 == a4) && a12 == 0)) || (((a10 == 1 && 9 <= a19) && 14 == a4) && a12 == 0)) || (((14 == a4 && a10 == 0) && a12 == 0) && a19 <= 9) - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 17.0s, OverallIterations: 12, TraceHistogramMax: 4, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 947 SDtfs, 1437 SDslu, 58 SDs, 0 SdLazy, 4654 SolverSat, 718 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 964 GetRequests, 935 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2367occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 1946 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 49 NumberOfFragments, 273 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1700 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 282 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 3159 NumberOfCodeBlocks, 3159 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3143 ConstructedInterpolants, 0 QuantifiedInterpolants, 3479805 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1424 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 2154/2553 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...