./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0658a835d559c56129f1a85a00e9d3bbd205d66ef64b5c7d14ae72b3d1b496e0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:00:46,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:00:46,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:00:46,109 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:00:46,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:00:46,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:00:46,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:00:46,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:00:46,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:00:46,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:00:46,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:00:46,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:00:46,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:00:46,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:00:46,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:00:46,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:00:46,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:00:46,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:00:46,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:00:46,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:00:46,144 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:00:46,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:00:46,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:00:46,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:00:46,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:00:46,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:00:46,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:00:46,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:00:46,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:00:46,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:00:46,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:00:46,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:00:46,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:00:46,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:00:46,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:00:46,157 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:00:46,157 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:00:46,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:00:46,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:00:46,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:00:46,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:00:46,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:00:46,160 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:00:46,182 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:00:46,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:00:46,183 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:00:46,183 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:00:46,184 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:00:46,184 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:00:46,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:00:46,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:00:46,185 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:00:46,186 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:00:46,186 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:00:46,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:00:46,187 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:00:46,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:00:46,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:00:46,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:00:46,188 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:00:46,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:00:46,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:00:46,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:00:46,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:00:46,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:00:46,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:00:46,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:00:46,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:00:46,189 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:00:46,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:00:46,190 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:00:46,198 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:00:46,198 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:00:46,199 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/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0658a835d559c56129f1a85a00e9d3bbd205d66ef64b5c7d14ae72b3d1b496e0 [2022-07-12 11:00:46,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:00:46,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:00:46,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:00:46,476 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:00:46,476 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:00:46,478 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_harness.i [2022-07-12 11:00:46,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeffc4142/649b39cc47f54e0586f813ccf04e7e72/FLAGab2bb0c50 [2022-07-12 11:00:47,295 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:00:47,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_harness.i [2022-07-12 11:00:47,336 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeffc4142/649b39cc47f54e0586f813ccf04e7e72/FLAGab2bb0c50 [2022-07-12 11:00:47,511 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeffc4142/649b39cc47f54e0586f813ccf04e7e72 [2022-07-12 11:00:47,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:00:47,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:00:47,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:00:47,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:00:47,522 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:00:47,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:00:47" (1/1) ... [2022-07-12 11:00:47,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d1f8c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:47, skipping insertion in model container [2022-07-12 11:00:47,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:00:47" (1/1) ... [2022-07-12 11:00:47,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:00:47,621 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:00:47,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_harness.i[4504,4517] [2022-07-12 11:00:47,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_harness.i[4564,4577] [2022-07-12 11:00:48,552 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:48,559 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:48,565 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:48,565 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:48,566 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:48,579 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:48,582 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:48,584 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:48,584 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:48,834 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:00:48,835 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:00:48,836 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:00:48,837 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:00:48,838 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:00:48,839 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:00:48,839 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:00:48,840 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:00:48,840 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:00:48,841 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:00:48,944 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:00:49,014 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:49,015 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:49,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:00:49,153 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:00:49,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_harness.i[4504,4517] [2022-07-12 11:00:49,176 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_harness.i[4564,4577] [2022-07-12 11:00:49,218 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:49,218 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:49,219 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:49,220 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:49,220 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:49,232 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:49,233 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:49,235 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:49,236 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:49,275 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:00:49,276 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:00:49,277 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:00:49,277 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:00:49,278 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:00:49,278 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:00:49,279 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:00:49,279 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:00:49,279 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:00:49,280 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:00:49,300 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:00:49,360 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:49,361 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:00:49,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:00:49,603 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:00:49,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:49 WrapperNode [2022-07-12 11:00:49,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:00:49,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:00:49,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:00:49,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:00:49,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:49" (1/1) ... [2022-07-12 11:00:49,706 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:49" (1/1) ... [2022-07-12 11:00:49,781 INFO L137 Inliner]: procedures = 691, calls = 2649, calls flagged for inlining = 58, calls inlined = 4, statements flattened = 829 [2022-07-12 11:00:49,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:00:49,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:00:49,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:00:49,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:00:49,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:49" (1/1) ... [2022-07-12 11:00:49,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:49" (1/1) ... [2022-07-12 11:00:49,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:49" (1/1) ... [2022-07-12 11:00:49,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:49" (1/1) ... [2022-07-12 11:00:49,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:49" (1/1) ... [2022-07-12 11:00:49,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:49" (1/1) ... [2022-07-12 11:00:49,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:49" (1/1) ... [2022-07-12 11:00:49,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:00:49,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:00:49,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:00:49,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:00:49,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:49" (1/1) ... [2022-07-12 11:00:49,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:00:49,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:00:49,913 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 11:00:49,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 11:00:49,956 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-12 11:00:49,956 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-12 11:00:49,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:00:49,957 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 11:00:49,957 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 11:00:49,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:00:49,958 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_bounded [2022-07-12 11:00:49,958 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_bounded [2022-07-12 11:00:49,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 11:00:49,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 11:00:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:00:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:00:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2022-07-12 11:00:49,960 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2022-07-12 11:00:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:00:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:00:49,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:00:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 11:00:49,961 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 11:00:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-12 11:00:49,961 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-12 11:00:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 11:00:49,961 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 11:00:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:00:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:00:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:00:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:00:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_byte_cursor_has_allocated_buffer_member [2022-07-12 11:00:49,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_byte_cursor_has_allocated_buffer_member [2022-07-12 11:00:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_compare_lookup [2022-07-12 11:00:49,964 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_compare_lookup [2022-07-12 11:00:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:00:50,260 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:00:50,261 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:00:51,182 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:00:51,191 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:00:51,191 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 11:00:51,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:00:51 BoogieIcfgContainer [2022-07-12 11:00:51,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:00:51,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:00:51,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:00:51,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:00:51,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:00:47" (1/3) ... [2022-07-12 11:00:51,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eab313b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:00:51, skipping insertion in model container [2022-07-12 11:00:51,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:00:49" (2/3) ... [2022-07-12 11:00:51,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eab313b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:00:51, skipping insertion in model container [2022-07-12 11:00:51,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:00:51" (3/3) ... [2022-07-12 11:00:51,202 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_compare_lookup_harness.i [2022-07-12 11:00:51,213 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:00:51,214 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:00:51,261 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:00:51,266 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@87e167d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c0253a4 [2022-07-12 11:00:51,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:00:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 80 states have (on average 1.2625) internal successors, (101), 81 states have internal predecessors, (101), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-07-12 11:00:51,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-12 11:00:51,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:51,282 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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] [2022-07-12 11:00:51,282 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:51,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:51,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1628753842, now seen corresponding path program 1 times [2022-07-12 11:00:51,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:51,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77344701] [2022-07-12 11:00:51,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:51,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:00:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:00:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:00:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:00:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:00:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:00:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:00:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:00:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:00:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:51,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:00:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:00:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 11:00:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:00:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:00:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:00:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,052 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-12 11:00:52,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:52,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77344701] [2022-07-12 11:00:52,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77344701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:00:52,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:00:52,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:00:52,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604223496] [2022-07-12 11:00:52,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:00:52,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:00:52,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:00:52,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:00:52,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:00:52,086 INFO L87 Difference]: Start difference. First operand has 133 states, 80 states have (on average 1.2625) internal successors, (101), 81 states have internal predecessors, (101), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 11:00:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:00:52,445 INFO L93 Difference]: Finished difference Result 265 states and 391 transitions. [2022-07-12 11:00:52,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:00:52,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 95 [2022-07-12 11:00:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:00:52,464 INFO L225 Difference]: With dead ends: 265 [2022-07-12 11:00:52,464 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 11:00:52,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:00:52,480 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 63 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:00:52,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 201 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:00:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 11:00:52,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-07-12 11:00:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 76 states have internal predecessors, (92), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-07-12 11:00:52,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 173 transitions. [2022-07-12 11:00:52,541 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 173 transitions. Word has length 95 [2022-07-12 11:00:52,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:00:52,542 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 173 transitions. [2022-07-12 11:00:52,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 11:00:52,542 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 173 transitions. [2022-07-12 11:00:52,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-12 11:00:52,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:52,552 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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] [2022-07-12 11:00:52,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:00:52,553 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:52,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:52,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1573250628, now seen corresponding path program 1 times [2022-07-12 11:00:52,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:52,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502622548] [2022-07-12 11:00:52,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:52,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:00:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:00:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:00:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:00:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:00:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:00:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:00:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:00:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:00:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:00:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:00:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 11:00:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:00:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:00:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:00:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-12 11:00:52,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:52,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502622548] [2022-07-12 11:00:52,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502622548] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:00:52,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540414649] [2022-07-12 11:00:52,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:52,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:52,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:00:52,977 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:00:52,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 11:00:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:53,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 2650 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 11:00:53,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:00:53,630 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 11:00:53,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:00:53,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540414649] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:00:53,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:00:53,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-07-12 11:00:53,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308598788] [2022-07-12 11:00:53,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:00:53,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:00:53,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:00:53,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:00:53,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:00:53,634 INFO L87 Difference]: Start difference. First operand 127 states and 173 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-12 11:00:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:00:53,847 INFO L93 Difference]: Finished difference Result 250 states and 347 transitions. [2022-07-12 11:00:53,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:00:53,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 95 [2022-07-12 11:00:53,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:00:53,849 INFO L225 Difference]: With dead ends: 250 [2022-07-12 11:00:53,850 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 11:00:53,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:00:53,851 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 187 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:00:53,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 366 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:00:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 11:00:53,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-12 11:00:53,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 41 states have call successors, (41), 10 states have call predecessors, (41), 11 states have return successors, (48), 40 states have call predecessors, (48), 40 states have call successors, (48) [2022-07-12 11:00:53,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 183 transitions. [2022-07-12 11:00:53,867 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 183 transitions. Word has length 95 [2022-07-12 11:00:53,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:00:53,867 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 183 transitions. [2022-07-12 11:00:53,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-12 11:00:53,868 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 183 transitions. [2022-07-12 11:00:53,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-12 11:00:53,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:53,869 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:00:53,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 11:00:54,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:54,084 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:54,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:54,084 INFO L85 PathProgramCache]: Analyzing trace with hash -513109833, now seen corresponding path program 1 times [2022-07-12 11:00:54,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:54,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469117916] [2022-07-12 11:00:54,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:54,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:54,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:00:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:54,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:00:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:54,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:00:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:54,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:00:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:54,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:00:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:54,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:00:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:54,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:00:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:54,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:00:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:54,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:00:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:54,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:00:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:54,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:00:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:54,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:00:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:54,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:00:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:54,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:00:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:54,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:00:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-12 11:00:54,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:54,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469117916] [2022-07-12 11:00:54,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469117916] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:00:54,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95844893] [2022-07-12 11:00:54,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:54,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:54,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:00:54,572 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:00:54,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 11:00:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:55,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 2655 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 11:00:55,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:00:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-12 11:00:55,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:00:55,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95844893] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:00:55,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:00:55,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2022-07-12 11:00:55,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95575514] [2022-07-12 11:00:55,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:00:55,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:00:55,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:00:55,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:00:55,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-07-12 11:00:55,163 INFO L87 Difference]: Start difference. First operand 130 states and 183 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-12 11:00:55,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:00:55,515 INFO L93 Difference]: Finished difference Result 210 states and 301 transitions. [2022-07-12 11:00:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:00:55,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 97 [2022-07-12 11:00:55,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:00:55,517 INFO L225 Difference]: With dead ends: 210 [2022-07-12 11:00:55,517 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 11:00:55,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-07-12 11:00:55,519 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 204 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:00:55,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 636 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:00:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 11:00:55,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-12 11:00:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 41 states have call successors, (41), 10 states have call predecessors, (41), 11 states have return successors, (45), 40 states have call predecessors, (45), 40 states have call successors, (45) [2022-07-12 11:00:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 180 transitions. [2022-07-12 11:00:55,532 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 180 transitions. Word has length 97 [2022-07-12 11:00:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:00:55,532 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 180 transitions. [2022-07-12 11:00:55,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-12 11:00:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 180 transitions. [2022-07-12 11:00:55,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 11:00:55,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:55,534 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:00:55,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 11:00:55,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-12 11:00:55,748 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:55,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:55,748 INFO L85 PathProgramCache]: Analyzing trace with hash -199598313, now seen corresponding path program 2 times [2022-07-12 11:00:55,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:55,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293336514] [2022-07-12 11:00:55,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:55,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:55,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:00:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:55,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:00:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:55,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:00:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:55,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:00:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:55,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:00:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:55,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:00:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:00:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:00:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:00:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:00:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:00:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:00:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:00:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:00:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:00:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-12 11:00:56,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:56,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293336514] [2022-07-12 11:00:56,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293336514] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:00:56,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833120161] [2022-07-12 11:00:56,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:00:56,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:56,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:00:56,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:00:56,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 11:00:56,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 11:00:56,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:00:56,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 2337 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 11:00:56,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:00:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-12 11:00:56,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:00:56,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833120161] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:00:56,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:00:56,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-07-12 11:00:56,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604870774] [2022-07-12 11:00:56,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:00:56,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:00:56,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:00:56,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:00:56,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:00:56,675 INFO L87 Difference]: Start difference. First operand 130 states and 180 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-12 11:00:56,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:00:56,752 INFO L93 Difference]: Finished difference Result 142 states and 201 transitions. [2022-07-12 11:00:56,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:00:56,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2022-07-12 11:00:56,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:00:56,755 INFO L225 Difference]: With dead ends: 142 [2022-07-12 11:00:56,755 INFO L226 Difference]: Without dead ends: 140 [2022-07-12 11:00:56,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:00:56,756 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 16 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:00:56,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1200 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:00:56,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-12 11:00:56,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2022-07-12 11:00:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 86 states have internal predecessors, (100), 42 states have call successors, (42), 11 states have call predecessors, (42), 13 states have return successors, (56), 41 states have call predecessors, (56), 41 states have call successors, (56) [2022-07-12 11:00:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 198 transitions. [2022-07-12 11:00:56,772 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 198 transitions. Word has length 101 [2022-07-12 11:00:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:00:56,773 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 198 transitions. [2022-07-12 11:00:56,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-12 11:00:56,773 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 198 transitions. [2022-07-12 11:00:56,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 11:00:56,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:56,775 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:00:56,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 11:00:56,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:56,996 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:56,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:56,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1826692575, now seen corresponding path program 1 times [2022-07-12 11:00:56,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:56,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736678329] [2022-07-12 11:00:56,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:56,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:57,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:00:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:57,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:00:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:57,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:00:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:57,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:00:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:57,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:00:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:57,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:00:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:57,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:00:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:57,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:00:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:57,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:00:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:57,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:00:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:57,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:00:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:57,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:00:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:57,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:00:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:57,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:00:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:57,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:00:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-12 11:00:57,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:57,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736678329] [2022-07-12 11:00:57,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736678329] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:00:57,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746999065] [2022-07-12 11:00:57,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:57,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:57,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:00:57,344 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:00:57,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 11:00:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:57,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 2674 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 11:00:57,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:00:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-12 11:00:58,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:00:58,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746999065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:00:58,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:00:58,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-07-12 11:00:58,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305500679] [2022-07-12 11:00:58,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:00:58,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:00:58,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:00:58,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:00:58,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:00:58,006 INFO L87 Difference]: Start difference. First operand 139 states and 198 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-12 11:00:58,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:00:58,316 INFO L93 Difference]: Finished difference Result 272 states and 404 transitions. [2022-07-12 11:00:58,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:00:58,317 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 101 [2022-07-12 11:00:58,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:00:58,326 INFO L225 Difference]: With dead ends: 272 [2022-07-12 11:00:58,327 INFO L226 Difference]: Without dead ends: 168 [2022-07-12 11:00:58,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-07-12 11:00:58,329 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 249 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:00:58,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 624 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:00:58,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-12 11:00:58,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-12 11:00:58,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 100 states have internal predecessors, (119), 56 states have call successors, (56), 12 states have call predecessors, (56), 14 states have return successors, (74), 55 states have call predecessors, (74), 55 states have call successors, (74) [2022-07-12 11:00:58,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2022-07-12 11:00:58,354 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 101 [2022-07-12 11:00:58,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:00:58,355 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2022-07-12 11:00:58,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-12 11:00:58,355 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2022-07-12 11:00:58,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 11:00:58,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:58,357 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2022-07-12 11:00:58,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 11:00:58,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:58,576 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:58,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:58,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1515977756, now seen corresponding path program 1 times [2022-07-12 11:00:58,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:58,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389205500] [2022-07-12 11:00:58,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:58,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:58,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:00:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:58,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:00:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:58,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:00:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:58,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:00:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:58,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:00:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:58,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:00:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:58,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:00:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:58,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:00:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:58,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:00:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:58,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:00:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:58,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:00:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:58,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:00:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:58,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:00:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:58,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:00:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:58,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:00:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-12 11:00:59,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:59,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389205500] [2022-07-12 11:00:59,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389205500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:00:59,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:00:59,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:00:59,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947311126] [2022-07-12 11:00:59,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:00:59,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:00:59,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:00:59,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:00:59,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:00:59,013 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-12 11:00:59,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:00:59,725 INFO L93 Difference]: Finished difference Result 181 states and 264 transitions. [2022-07-12 11:00:59,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:00:59,726 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2022-07-12 11:00:59,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:00:59,727 INFO L225 Difference]: With dead ends: 181 [2022-07-12 11:00:59,728 INFO L226 Difference]: Without dead ends: 179 [2022-07-12 11:00:59,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:00:59,729 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 80 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:00:59,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 528 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 11:00:59,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-12 11:00:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 174. [2022-07-12 11:00:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 100 states have (on average 1.22) internal successors, (122), 103 states have internal predecessors, (122), 58 states have call successors, (58), 13 states have call predecessors, (58), 15 states have return successors, (76), 57 states have call predecessors, (76), 57 states have call successors, (76) [2022-07-12 11:00:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 256 transitions. [2022-07-12 11:00:59,756 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 256 transitions. Word has length 103 [2022-07-12 11:00:59,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:00:59,757 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 256 transitions. [2022-07-12 11:00:59,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-12 11:00:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 256 transitions. [2022-07-12 11:00:59,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 11:00:59,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:59,762 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:00:59,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 11:00:59,762 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:59,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:59,763 INFO L85 PathProgramCache]: Analyzing trace with hash 101250906, now seen corresponding path program 1 times [2022-07-12 11:00:59,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:59,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389758598] [2022-07-12 11:00:59,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:59,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:01:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:01:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:01:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:01:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:01:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:01:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 11:01:00,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:00,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389758598] [2022-07-12 11:01:00,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389758598] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:00,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366401876] [2022-07-12 11:01:00,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:00,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:00,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:00,317 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:00,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 11:01:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:00,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 2682 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-12 11:01:00,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:00,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 11:01:01,129 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 11:01:01,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2022-07-12 11:01:09,165 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 48 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 11:01:09,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:01:10,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.offset| Int) (v_ArrVal_490 Int)) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base|) |ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.offset|)) (+ |ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.offset| 8) v_ArrVal_490)) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.offset|))) (<= .cse0 (* (div .cse0 18446744073709551616) 18446744073709551616)))) is different from false [2022-07-12 11:01:10,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366401876] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:10,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:01:10,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 25 [2022-07-12 11:01:10,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128526715] [2022-07-12 11:01:10,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:01:10,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 11:01:10,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:10,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 11:01:10,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=753, Unknown=1, NotChecked=56, Total=930 [2022-07-12 11:01:10,838 INFO L87 Difference]: Start difference. First operand 174 states and 256 transitions. Second operand has 25 states, 24 states have (on average 3.875) internal successors, (93), 22 states have internal predecessors, (93), 9 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (29), 8 states have call predecessors, (29), 7 states have call successors, (29) [2022-07-12 11:01:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:13,062 INFO L93 Difference]: Finished difference Result 443 states and 678 transitions. [2022-07-12 11:01:13,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-12 11:01:13,062 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.875) internal successors, (93), 22 states have internal predecessors, (93), 9 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (29), 8 states have call predecessors, (29), 7 states have call successors, (29) Word has length 107 [2022-07-12 11:01:13,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:13,065 INFO L225 Difference]: With dead ends: 443 [2022-07-12 11:01:13,065 INFO L226 Difference]: Without dead ends: 322 [2022-07-12 11:01:13,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 175 SyntacticMatches, 21 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=250, Invalid=1474, Unknown=2, NotChecked=80, Total=1806 [2022-07-12 11:01:13,067 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 213 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 843 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:13,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 908 Invalid, 2305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1351 Invalid, 0 Unknown, 843 Unchecked, 1.2s Time] [2022-07-12 11:01:13,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-07-12 11:01:13,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 265. [2022-07-12 11:01:13,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 157 states have (on average 1.21656050955414) internal successors, (191), 162 states have internal predecessors, (191), 85 states have call successors, (85), 19 states have call predecessors, (85), 22 states have return successors, (118), 83 states have call predecessors, (118), 84 states have call successors, (118) [2022-07-12 11:01:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 394 transitions. [2022-07-12 11:01:13,101 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 394 transitions. Word has length 107 [2022-07-12 11:01:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:13,102 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 394 transitions. [2022-07-12 11:01:13,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.875) internal successors, (93), 22 states have internal predecessors, (93), 9 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (29), 8 states have call predecessors, (29), 7 states have call successors, (29) [2022-07-12 11:01:13,102 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 394 transitions. [2022-07-12 11:01:13,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 11:01:13,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:13,104 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 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] [2022-07-12 11:01:13,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:13,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:13,320 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:13,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:13,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1582523535, now seen corresponding path program 1 times [2022-07-12 11:01:13,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:13,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754672784] [2022-07-12 11:01:13,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:13,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:13,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:13,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:13,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:13,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:13,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:13,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:13,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:13,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:13,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:13,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:01:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:13,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:01:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:13,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:01:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:13,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:01:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:13,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:01:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:13,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:01:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:13,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:01:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-12 11:01:13,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:13,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754672784] [2022-07-12 11:01:13,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754672784] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:13,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062116743] [2022-07-12 11:01:13,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:13,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:13,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:13,896 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:13,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 11:01:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:14,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 2748 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 11:01:14,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-12 11:01:14,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:14,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062116743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:14,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:14,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 21 [2022-07-12 11:01:14,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735843723] [2022-07-12 11:01:14,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:14,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:01:14,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:14,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:01:14,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:01:14,477 INFO L87 Difference]: Start difference. First operand 265 states and 394 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-12 11:01:14,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:14,635 INFO L93 Difference]: Finished difference Result 460 states and 708 transitions. [2022-07-12 11:01:14,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:01:14,636 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 118 [2022-07-12 11:01:14,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:14,638 INFO L225 Difference]: With dead ends: 460 [2022-07-12 11:01:14,638 INFO L226 Difference]: Without dead ends: 270 [2022-07-12 11:01:14,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2022-07-12 11:01:14,640 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 12 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:14,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1314 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:01:14,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-07-12 11:01:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-07-12 11:01:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 161 states have (on average 1.2111801242236024) internal successors, (195), 167 states have internal predecessors, (195), 85 states have call successors, (85), 19 states have call predecessors, (85), 23 states have return successors, (135), 83 states have call predecessors, (135), 84 states have call successors, (135) [2022-07-12 11:01:14,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 415 transitions. [2022-07-12 11:01:14,671 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 415 transitions. Word has length 118 [2022-07-12 11:01:14,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:14,671 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 415 transitions. [2022-07-12 11:01:14,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-12 11:01:14,672 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 415 transitions. [2022-07-12 11:01:14,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 11:01:14,673 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:14,674 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:14,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:14,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:14,885 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:14,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:14,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1705417372, now seen corresponding path program 1 times [2022-07-12 11:01:14,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:14,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997492856] [2022-07-12 11:01:14,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:14,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:01:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:01:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:01:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:01:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:01:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:01:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-12 11:01:15,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:15,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997492856] [2022-07-12 11:01:15,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997492856] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:15,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283273087] [2022-07-12 11:01:15,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:15,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:15,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:15,248 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:15,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 11:01:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:15,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 2691 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 11:01:15,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:15,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:01:15,966 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 11:01:15,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2022-07-12 11:01:16,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 42 [2022-07-12 11:01:16,598 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-12 11:01:16,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:01:17,264 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 11:01:17,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-12 11:01:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-12 11:01:17,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283273087] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:01:17,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:01:17,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 11] total 27 [2022-07-12 11:01:17,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643711720] [2022-07-12 11:01:17,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:01:17,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 11:01:17,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:17,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 11:01:17,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2022-07-12 11:01:17,289 INFO L87 Difference]: Start difference. First operand 270 states and 415 transitions. Second operand has 27 states, 26 states have (on average 4.0) internal successors, (104), 23 states have internal predecessors, (104), 11 states have call successors, (43), 9 states have call predecessors, (43), 7 states have return successors, (39), 10 states have call predecessors, (39), 11 states have call successors, (39) [2022-07-12 11:01:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:20,838 INFO L93 Difference]: Finished difference Result 705 states and 1124 transitions. [2022-07-12 11:01:20,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-12 11:01:20,839 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.0) internal successors, (104), 23 states have internal predecessors, (104), 11 states have call successors, (43), 9 states have call predecessors, (43), 7 states have return successors, (39), 10 states have call predecessors, (39), 11 states have call successors, (39) Word has length 107 [2022-07-12 11:01:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:20,842 INFO L225 Difference]: With dead ends: 705 [2022-07-12 11:01:20,843 INFO L226 Difference]: Without dead ends: 546 [2022-07-12 11:01:20,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 222 SyntacticMatches, 16 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=458, Invalid=2841, Unknown=7, NotChecked=0, Total=3306 [2022-07-12 11:01:20,846 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 500 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 2672 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 4049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 2672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 936 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:20,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 672 Invalid, 4049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 2672 Invalid, 0 Unknown, 936 Unchecked, 2.3s Time] [2022-07-12 11:01:20,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-07-12 11:01:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 439. [2022-07-12 11:01:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 269 states have (on average 1.2230483271375465) internal successors, (329), 277 states have internal predecessors, (329), 137 states have call successors, (137), 26 states have call predecessors, (137), 32 states have return successors, (213), 135 states have call predecessors, (213), 136 states have call successors, (213) [2022-07-12 11:01:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 679 transitions. [2022-07-12 11:01:20,911 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 679 transitions. Word has length 107 [2022-07-12 11:01:20,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:20,913 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 679 transitions. [2022-07-12 11:01:20,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.0) internal successors, (104), 23 states have internal predecessors, (104), 11 states have call successors, (43), 9 states have call predecessors, (43), 7 states have return successors, (39), 10 states have call predecessors, (39), 11 states have call successors, (39) [2022-07-12 11:01:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 679 transitions. [2022-07-12 11:01:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-12 11:01:20,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:20,916 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:20,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:21,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:21,143 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:21,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:21,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1355654111, now seen corresponding path program 1 times [2022-07-12 11:01:21,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:21,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743193574] [2022-07-12 11:01:21,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:21,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:01:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:01:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:01:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:01:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:01:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:01:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,627 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-12 11:01:21,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:21,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743193574] [2022-07-12 11:01:21,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743193574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:21,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:01:21,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 11:01:21,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038199558] [2022-07-12 11:01:21,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:21,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 11:01:21,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:21,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 11:01:21,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:01:21,629 INFO L87 Difference]: Start difference. First operand 439 states and 679 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-12 11:01:22,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:22,455 INFO L93 Difference]: Finished difference Result 480 states and 752 transitions. [2022-07-12 11:01:22,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 11:01:22,456 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2022-07-12 11:01:22,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:22,459 INFO L225 Difference]: With dead ends: 480 [2022-07-12 11:01:22,459 INFO L226 Difference]: Without dead ends: 478 [2022-07-12 11:01:22,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:01:22,461 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 152 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:22,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 622 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 11:01:22,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-07-12 11:01:22,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 447. [2022-07-12 11:01:22,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 276 states have (on average 1.2173913043478262) internal successors, (336), 285 states have internal predecessors, (336), 137 states have call successors, (137), 26 states have call predecessors, (137), 33 states have return successors, (236), 135 states have call predecessors, (236), 136 states have call successors, (236) [2022-07-12 11:01:22,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 709 transitions. [2022-07-12 11:01:22,531 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 709 transitions. Word has length 109 [2022-07-12 11:01:22,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:22,532 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 709 transitions. [2022-07-12 11:01:22,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-12 11:01:22,532 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 709 transitions. [2022-07-12 11:01:22,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-12 11:01:22,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:22,535 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:22,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 11:01:22,535 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:22,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:22,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2056718689, now seen corresponding path program 1 times [2022-07-12 11:01:22,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:22,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185741191] [2022-07-12 11:01:22,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:22,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:01:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:01:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:01:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:01:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:01:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:01:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-12 11:01:22,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:22,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185741191] [2022-07-12 11:01:22,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185741191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:22,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:01:22,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 11:01:22,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474784360] [2022-07-12 11:01:22,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:22,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 11:01:22,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:22,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 11:01:22,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:01:22,905 INFO L87 Difference]: Start difference. First operand 447 states and 709 transitions. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-12 11:01:24,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:24,002 INFO L93 Difference]: Finished difference Result 467 states and 733 transitions. [2022-07-12 11:01:24,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 11:01:24,002 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2022-07-12 11:01:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:24,006 INFO L225 Difference]: With dead ends: 467 [2022-07-12 11:01:24,006 INFO L226 Difference]: Without dead ends: 465 [2022-07-12 11:01:24,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2022-07-12 11:01:24,007 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 168 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:24,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 724 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 11:01:24,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-07-12 11:01:24,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 435. [2022-07-12 11:01:24,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 266 states have (on average 1.2255639097744362) internal successors, (326), 273 states have internal predecessors, (326), 137 states have call successors, (137), 26 states have call predecessors, (137), 31 states have return successors, (212), 135 states have call predecessors, (212), 136 states have call successors, (212) [2022-07-12 11:01:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 675 transitions. [2022-07-12 11:01:24,049 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 675 transitions. Word has length 109 [2022-07-12 11:01:24,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:24,050 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 675 transitions. [2022-07-12 11:01:24,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-12 11:01:24,050 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 675 transitions. [2022-07-12 11:01:24,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 11:01:24,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:24,058 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 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] [2022-07-12 11:01:24,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 11:01:24,058 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:24,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:24,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1757380781, now seen corresponding path program 1 times [2022-07-12 11:01:24,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:24,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396421695] [2022-07-12 11:01:24,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:24,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:01:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:01:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:01:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:01:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:01:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 11:01:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-12 11:01:24,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:24,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396421695] [2022-07-12 11:01:24,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396421695] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:24,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723827509] [2022-07-12 11:01:24,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:24,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:24,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:24,469 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:24,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 11:01:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 2699 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 11:01:24,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-12 11:01:25,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:25,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723827509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:25,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:25,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2022-07-12 11:01:25,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121868017] [2022-07-12 11:01:25,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:25,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:01:25,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:25,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:01:25,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:01:25,007 INFO L87 Difference]: Start difference. First operand 435 states and 675 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 11:01:25,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:25,188 INFO L93 Difference]: Finished difference Result 812 states and 1309 transitions. [2022-07-12 11:01:25,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:01:25,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 113 [2022-07-12 11:01:25,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:25,192 INFO L225 Difference]: With dead ends: 812 [2022-07-12 11:01:25,192 INFO L226 Difference]: Without dead ends: 439 [2022-07-12 11:01:25,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:01:25,195 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 17 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:25,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 619 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 35 Unchecked, 0.1s Time] [2022-07-12 11:01:25,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-07-12 11:01:25,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 435. [2022-07-12 11:01:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 266 states have (on average 1.2067669172932332) internal successors, (321), 273 states have internal predecessors, (321), 137 states have call successors, (137), 26 states have call predecessors, (137), 31 states have return successors, (212), 135 states have call predecessors, (212), 136 states have call successors, (212) [2022-07-12 11:01:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 670 transitions. [2022-07-12 11:01:25,233 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 670 transitions. Word has length 113 [2022-07-12 11:01:25,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:25,233 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 670 transitions. [2022-07-12 11:01:25,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 11:01:25,233 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 670 transitions. [2022-07-12 11:01:25,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 11:01:25,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:25,235 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 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] [2022-07-12 11:01:25,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-12 11:01:25,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 11:01:25,448 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:25,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:25,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1276300523, now seen corresponding path program 1 times [2022-07-12 11:01:25,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:25,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815550020] [2022-07-12 11:01:25,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:25,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:01:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:01:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:01:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:01:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:01:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 11:01:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 11:01:26,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:26,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815550020] [2022-07-12 11:01:26,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815550020] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:26,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609243407] [2022-07-12 11:01:26,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:26,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:26,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:26,192 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:26,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 11:01:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 2704 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-12 11:01:26,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:26,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 11:01:27,020 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 11:01:27,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2022-07-12 11:01:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 65 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 11:01:27,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:01:29,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.offset| Int) (v_ArrVal_953 Int)) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base|) |ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.offset|)) (+ |ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.offset| 8) v_ArrVal_953)) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.offset|) 18446744073709551616) 0)) is different from false [2022-07-12 11:01:29,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609243407] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:29,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:01:29,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2022-07-12 11:01:29,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630305489] [2022-07-12 11:01:29,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:01:29,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 11:01:29,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:29,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 11:01:29,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1194, Unknown=1, NotChecked=70, Total=1406 [2022-07-12 11:01:29,088 INFO L87 Difference]: Start difference. First operand 435 states and 670 transitions. Second operand has 31 states, 26 states have (on average 3.8846153846153846) internal successors, (101), 26 states have internal predecessors, (101), 14 states have call successors, (32), 9 states have call predecessors, (32), 7 states have return successors, (29), 9 states have call predecessors, (29), 12 states have call successors, (29) [2022-07-12 11:01:32,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:32,872 INFO L93 Difference]: Finished difference Result 654 states and 964 transitions. [2022-07-12 11:01:32,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 11:01:32,873 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 3.8846153846153846) internal successors, (101), 26 states have internal predecessors, (101), 14 states have call successors, (32), 9 states have call predecessors, (32), 7 states have return successors, (29), 9 states have call predecessors, (29), 12 states have call successors, (29) Word has length 113 [2022-07-12 11:01:32,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:32,876 INFO L225 Difference]: With dead ends: 654 [2022-07-12 11:01:32,876 INFO L226 Difference]: Without dead ends: 492 [2022-07-12 11:01:32,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 197 SyntacticMatches, 14 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=424, Invalid=2769, Unknown=3, NotChecked=110, Total=3306 [2022-07-12 11:01:32,878 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 298 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 2375 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 4481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 2375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1857 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:32,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 734 Invalid, 4481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 2375 Invalid, 0 Unknown, 1857 Unchecked, 1.6s Time] [2022-07-12 11:01:32,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-07-12 11:01:32,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 452. [2022-07-12 11:01:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 281 states have (on average 1.206405693950178) internal successors, (339), 286 states have internal predecessors, (339), 137 states have call successors, (137), 29 states have call predecessors, (137), 33 states have return successors, (206), 136 states have call predecessors, (206), 136 states have call successors, (206) [2022-07-12 11:01:32,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 682 transitions. [2022-07-12 11:01:32,918 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 682 transitions. Word has length 113 [2022-07-12 11:01:32,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:32,919 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 682 transitions. [2022-07-12 11:01:32,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 3.8846153846153846) internal successors, (101), 26 states have internal predecessors, (101), 14 states have call successors, (32), 9 states have call predecessors, (32), 7 states have return successors, (29), 9 states have call predecessors, (29), 12 states have call successors, (29) [2022-07-12 11:01:32,919 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 682 transitions. [2022-07-12 11:01:32,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 11:01:32,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:32,922 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 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] [2022-07-12 11:01:32,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:33,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 11:01:33,144 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:33,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:33,144 INFO L85 PathProgramCache]: Analyzing trace with hash -435723647, now seen corresponding path program 1 times [2022-07-12 11:01:33,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:33,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754072346] [2022-07-12 11:01:33,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:33,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:01:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:01:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:01:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:01:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:01:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:01:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 11:01:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 11:01:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:01:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-07-12 11:01:33,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:33,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754072346] [2022-07-12 11:01:33,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754072346] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:33,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:01:33,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:01:33,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882403049] [2022-07-12 11:01:33,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:33,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:01:33,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:33,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:01:33,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:01:33,518 INFO L87 Difference]: Start difference. First operand 452 states and 682 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-12 11:01:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:34,211 INFO L93 Difference]: Finished difference Result 469 states and 701 transitions. [2022-07-12 11:01:34,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:01:34,211 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2022-07-12 11:01:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:34,214 INFO L225 Difference]: With dead ends: 469 [2022-07-12 11:01:34,215 INFO L226 Difference]: Without dead ends: 467 [2022-07-12 11:01:34,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:01:34,216 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 78 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:34,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 527 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 11:01:34,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-07-12 11:01:34,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 459. [2022-07-12 11:01:34,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 284 states have (on average 1.204225352112676) internal successors, (342), 289 states have internal predecessors, (342), 140 states have call successors, (140), 30 states have call predecessors, (140), 34 states have return successors, (209), 139 states have call predecessors, (209), 139 states have call successors, (209) [2022-07-12 11:01:34,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 691 transitions. [2022-07-12 11:01:34,257 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 691 transitions. Word has length 124 [2022-07-12 11:01:34,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:34,257 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 691 transitions. [2022-07-12 11:01:34,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-12 11:01:34,258 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 691 transitions. [2022-07-12 11:01:34,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 11:01:34,259 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:34,259 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 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] [2022-07-12 11:01:34,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 11:01:34,260 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:34,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1375218206, now seen corresponding path program 1 times [2022-07-12 11:01:34,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:34,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590156193] [2022-07-12 11:01:34,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:34,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:01:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:01:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:01:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:01:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:01:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 11:01:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 11:01:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,741 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-12 11:01:34,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:34,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590156193] [2022-07-12 11:01:34,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590156193] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:34,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908855911] [2022-07-12 11:01:34,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:34,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:34,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:34,743 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:34,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 11:01:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 2749 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 11:01:35,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:35,400 INFO L356 Elim1Store]: treesize reduction 70, result has 26.3 percent of original size [2022-07-12 11:01:35,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 45 [2022-07-12 11:01:35,476 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 11:01:35,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 24 [2022-07-12 11:01:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 64 proven. 8 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-12 11:01:35,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:01:35,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-12 11:01:35,817 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 11:01:35,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-12 11:01:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 11:01:35,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908855911] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:01:35,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:01:35,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 21 [2022-07-12 11:01:35,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455819279] [2022-07-12 11:01:35,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:01:35,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 11:01:35,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:35,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 11:01:35,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:01:35,842 INFO L87 Difference]: Start difference. First operand 459 states and 691 transitions. Second operand has 21 states, 20 states have (on average 4.75) internal successors, (95), 19 states have internal predecessors, (95), 10 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (31), 8 states have call predecessors, (31), 10 states have call successors, (31) [2022-07-12 11:01:37,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:37,225 INFO L93 Difference]: Finished difference Result 735 states and 1137 transitions. [2022-07-12 11:01:37,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 11:01:37,226 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.75) internal successors, (95), 19 states have internal predecessors, (95), 10 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (31), 8 states have call predecessors, (31), 10 states have call successors, (31) Word has length 120 [2022-07-12 11:01:37,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:37,229 INFO L225 Difference]: With dead ends: 735 [2022-07-12 11:01:37,229 INFO L226 Difference]: Without dead ends: 499 [2022-07-12 11:01:37,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 254 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=793, Unknown=1, NotChecked=0, Total=930 [2022-07-12 11:01:37,231 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 151 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 441 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:37,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 562 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1396 Invalid, 0 Unknown, 441 Unchecked, 1.0s Time] [2022-07-12 11:01:37,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-07-12 11:01:37,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 459. [2022-07-12 11:01:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 284 states have (on average 1.204225352112676) internal successors, (342), 289 states have internal predecessors, (342), 140 states have call successors, (140), 30 states have call predecessors, (140), 34 states have return successors, (207), 139 states have call predecessors, (207), 139 states have call successors, (207) [2022-07-12 11:01:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 689 transitions. [2022-07-12 11:01:37,278 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 689 transitions. Word has length 120 [2022-07-12 11:01:37,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:37,279 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 689 transitions. [2022-07-12 11:01:37,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.75) internal successors, (95), 19 states have internal predecessors, (95), 10 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (31), 8 states have call predecessors, (31), 10 states have call successors, (31) [2022-07-12 11:01:37,279 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 689 transitions. [2022-07-12 11:01:37,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 11:01:37,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:37,281 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-07-12 11:01:37,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:37,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 11:01:37,508 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:37,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:37,508 INFO L85 PathProgramCache]: Analyzing trace with hash 622395683, now seen corresponding path program 2 times [2022-07-12 11:01:37,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:37,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194161281] [2022-07-12 11:01:37,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:37,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:01:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:01:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:01:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:01:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:01:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:01:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:01:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:01:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:01:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:01:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-12 11:01:37,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:37,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194161281] [2022-07-12 11:01:37,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194161281] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:37,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739806809] [2022-07-12 11:01:37,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:01:37,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:37,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:37,866 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:37,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 11:01:38,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:01:38,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:01:38,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 2716 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 11:01:38,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:38,691 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-12 11:01:38,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:38,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739806809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:38,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:38,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2022-07-12 11:01:38,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206596239] [2022-07-12 11:01:38,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:38,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:01:38,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:38,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:01:38,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:01:38,694 INFO L87 Difference]: Start difference. First operand 459 states and 689 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-12 11:01:38,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:38,855 INFO L93 Difference]: Finished difference Result 803 states and 1229 transitions. [2022-07-12 11:01:38,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:01:38,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 117 [2022-07-12 11:01:38,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:38,858 INFO L225 Difference]: With dead ends: 803 [2022-07-12 11:01:38,859 INFO L226 Difference]: Without dead ends: 464 [2022-07-12 11:01:38,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:01:38,861 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 11 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:38,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1291 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:01:38,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-07-12 11:01:38,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 459. [2022-07-12 11:01:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 284 states have (on average 1.204225352112676) internal successors, (342), 289 states have internal predecessors, (342), 140 states have call successors, (140), 30 states have call predecessors, (140), 34 states have return successors, (206), 139 states have call predecessors, (206), 139 states have call successors, (206) [2022-07-12 11:01:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 688 transitions. [2022-07-12 11:01:38,902 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 688 transitions. Word has length 117 [2022-07-12 11:01:38,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:38,903 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 688 transitions. [2022-07-12 11:01:38,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-12 11:01:38,903 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 688 transitions. [2022-07-12 11:01:38,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 11:01:38,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:38,905 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 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] [2022-07-12 11:01:38,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-12 11:01:39,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 11:01:39,132 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:39,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:39,132 INFO L85 PathProgramCache]: Analyzing trace with hash -440949530, now seen corresponding path program 2 times [2022-07-12 11:01:39,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:39,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534728937] [2022-07-12 11:01:39,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:39,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:01:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:01:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:01:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:39,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:01:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:40,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:01:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:40,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:01:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:40,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 11:01:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:40,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 11:01:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:40,026 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-07-12 11:01:40,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:40,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534728937] [2022-07-12 11:01:40,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534728937] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:40,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429957099] [2022-07-12 11:01:40,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:01:40,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:40,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:40,028 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:40,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 11:01:41,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:01:41,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:01:41,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 2749 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 11:01:41,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:41,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 11:01:41,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 11:01:41,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-12 11:01:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-12 11:01:41,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:01:41,804 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1372 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base| v_ArrVal_1372) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.offset|) 18446744073709551616) 0)) is different from false [2022-07-12 11:01:41,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429957099] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:41,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:01:41,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2022-07-12 11:01:41,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191446158] [2022-07-12 11:01:41,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:01:41,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 11:01:41,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:41,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 11:01:41,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=727, Unknown=1, NotChecked=54, Total=870 [2022-07-12 11:01:41,813 INFO L87 Difference]: Start difference. First operand 459 states and 688 transitions. Second operand has 27 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 11 states have call successors, (34), 5 states have call predecessors, (34), 8 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) [2022-07-12 11:01:45,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:45,534 INFO L93 Difference]: Finished difference Result 938 states and 1472 transitions. [2022-07-12 11:01:45,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-12 11:01:45,535 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 11 states have call successors, (34), 5 states have call predecessors, (34), 8 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) Word has length 120 [2022-07-12 11:01:45,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:45,541 INFO L225 Difference]: With dead ends: 938 [2022-07-12 11:01:45,542 INFO L226 Difference]: Without dead ends: 684 [2022-07-12 11:01:45,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 220 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=299, Invalid=2356, Unknown=1, NotChecked=100, Total=2756 [2022-07-12 11:01:45,544 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 289 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 3959 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 4638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 3959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 356 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:45,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 663 Invalid, 4638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 3959 Invalid, 0 Unknown, 356 Unchecked, 2.8s Time] [2022-07-12 11:01:45,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-07-12 11:01:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 475. [2022-07-12 11:01:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 294 states have (on average 1.2006802721088434) internal successors, (353), 298 states have internal predecessors, (353), 145 states have call successors, (145), 32 states have call predecessors, (145), 35 states have return successors, (214), 144 states have call predecessors, (214), 144 states have call successors, (214) [2022-07-12 11:01:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 712 transitions. [2022-07-12 11:01:45,591 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 712 transitions. Word has length 120 [2022-07-12 11:01:45,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:45,591 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 712 transitions. [2022-07-12 11:01:45,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 11 states have call successors, (34), 5 states have call predecessors, (34), 8 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) [2022-07-12 11:01:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 712 transitions. [2022-07-12 11:01:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-12 11:01:45,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:45,593 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2022-07-12 11:01:45,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:45,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 11:01:45,808 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:45,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:45,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1937889046, now seen corresponding path program 1 times [2022-07-12 11:01:45,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:45,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676728954] [2022-07-12 11:01:45,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:45,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:01:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:01:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:01:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:01:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:01:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:01:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 11:01:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:01:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-12 11:01:46,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:46,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676728954] [2022-07-12 11:01:46,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676728954] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:46,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379122696] [2022-07-12 11:01:46,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:46,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:46,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:46,310 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:46,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 11:01:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:46,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 2714 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-12 11:01:46,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:47,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:01:47,111 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 11:01:47,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2022-07-12 11:01:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 45 proven. 22 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-12 11:01:48,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:01:48,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-12 11:01:48,576 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 11:01:48,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-12 11:01:48,600 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-12 11:01:48,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379122696] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:01:48,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:01:48,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 13] total 30 [2022-07-12 11:01:48,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388206671] [2022-07-12 11:01:48,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:01:48,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 11:01:48,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:48,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 11:01:48,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2022-07-12 11:01:48,602 INFO L87 Difference]: Start difference. First operand 475 states and 712 transitions. Second operand has 30 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 26 states have internal predecessors, (104), 11 states have call successors, (39), 9 states have call predecessors, (39), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) [2022-07-12 11:01:50,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:50,171 INFO L93 Difference]: Finished difference Result 855 states and 1246 transitions. [2022-07-12 11:01:50,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 11:01:50,171 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 26 states have internal predecessors, (104), 11 states have call successors, (39), 9 states have call predecessors, (39), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) Word has length 121 [2022-07-12 11:01:50,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:50,175 INFO L225 Difference]: With dead ends: 855 [2022-07-12 11:01:50,175 INFO L226 Difference]: Without dead ends: 593 [2022-07-12 11:01:50,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 244 SyntacticMatches, 24 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=244, Invalid=1648, Unknown=0, NotChecked=0, Total=1892 [2022-07-12 11:01:50,177 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 324 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 2743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 933 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:50,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 879 Invalid, 2743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1614 Invalid, 0 Unknown, 933 Unchecked, 1.2s Time] [2022-07-12 11:01:50,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-07-12 11:01:50,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 530. [2022-07-12 11:01:50,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 333 states have (on average 1.1831831831831832) internal successors, (394), 339 states have internal predecessors, (394), 155 states have call successors, (155), 36 states have call predecessors, (155), 41 states have return successors, (226), 154 states have call predecessors, (226), 154 states have call successors, (226) [2022-07-12 11:01:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 775 transitions. [2022-07-12 11:01:50,228 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 775 transitions. Word has length 121 [2022-07-12 11:01:50,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:50,228 INFO L495 AbstractCegarLoop]: Abstraction has 530 states and 775 transitions. [2022-07-12 11:01:50,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 26 states have internal predecessors, (104), 11 states have call successors, (39), 9 states have call predecessors, (39), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) [2022-07-12 11:01:50,229 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 775 transitions. [2022-07-12 11:01:50,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-12 11:01:50,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:50,231 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-07-12 11:01:50,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:50,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 11:01:50,448 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:50,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:50,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1718564348, now seen corresponding path program 3 times [2022-07-12 11:01:50,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:50,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542701435] [2022-07-12 11:01:50,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:50,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:50,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:50,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:50,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:50,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:50,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:50,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:50,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:50,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:50,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:01:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:50,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:01:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:50,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:01:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:50,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:01:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:50,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:01:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:50,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:01:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:50,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 11:01:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-12 11:01:50,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:50,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542701435] [2022-07-12 11:01:50,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542701435] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:50,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523643772] [2022-07-12 11:01:50,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 11:01:50,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:50,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:50,964 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:50,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 11:01:52,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-12 11:01:52,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:01:52,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 2566 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 11:01:52,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:53,229 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 11:01:53,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:01:53,662 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-12 11:01:53,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-12 11:01:53,668 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-07-12 11:01:53,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-07-12 11:01:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-12 11:01:53,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523643772] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:01:53,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:01:53,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 35 [2022-07-12 11:01:53,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900203699] [2022-07-12 11:01:53,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:01:53,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-12 11:01:53,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:53,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-12 11:01:53,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1085, Unknown=0, NotChecked=0, Total=1190 [2022-07-12 11:01:53,699 INFO L87 Difference]: Start difference. First operand 530 states and 775 transitions. Second operand has 35 states, 33 states have (on average 3.9393939393939394) internal successors, (130), 31 states have internal predecessors, (130), 10 states have call successors, (44), 7 states have call predecessors, (44), 8 states have return successors, (40), 8 states have call predecessors, (40), 10 states have call successors, (40) [2022-07-12 11:02:00,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:00,464 INFO L93 Difference]: Finished difference Result 1497 states and 2518 transitions. [2022-07-12 11:02:00,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-07-12 11:02:00,465 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 3.9393939393939394) internal successors, (130), 31 states have internal predecessors, (130), 10 states have call successors, (44), 7 states have call predecessors, (44), 8 states have return successors, (40), 8 states have call predecessors, (40), 10 states have call successors, (40) Word has length 119 [2022-07-12 11:02:00,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:00,471 INFO L225 Difference]: With dead ends: 1497 [2022-07-12 11:02:00,471 INFO L226 Difference]: Without dead ends: 1011 [2022-07-12 11:02:00,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 258 SyntacticMatches, 8 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1896 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1028, Invalid=6804, Unknown=0, NotChecked=0, Total=7832 [2022-07-12 11:02:00,480 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 487 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 6557 mSolverCounterSat, 677 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 7966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 677 IncrementalHoareTripleChecker+Valid, 6557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 732 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:00,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1694 Invalid, 7966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [677 Valid, 6557 Invalid, 0 Unknown, 732 Unchecked, 4.0s Time] [2022-07-12 11:02:00,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-07-12 11:02:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 893. [2022-07-12 11:02:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 540 states have (on average 1.2518518518518518) internal successors, (676), 552 states have internal predecessors, (676), 300 states have call successors, (300), 46 states have call predecessors, (300), 52 states have return successors, (435), 294 states have call predecessors, (435), 299 states have call successors, (435) [2022-07-12 11:02:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1411 transitions. [2022-07-12 11:02:00,593 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1411 transitions. Word has length 119 [2022-07-12 11:02:00,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:00,593 INFO L495 AbstractCegarLoop]: Abstraction has 893 states and 1411 transitions. [2022-07-12 11:02:00,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 3.9393939393939394) internal successors, (130), 31 states have internal predecessors, (130), 10 states have call successors, (44), 7 states have call predecessors, (44), 8 states have return successors, (40), 8 states have call predecessors, (40), 10 states have call successors, (40) [2022-07-12 11:02:00,594 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1411 transitions. [2022-07-12 11:02:00,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-12 11:02:00,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:00,596 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:00,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-12 11:02:00,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:00,824 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:00,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:00,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1826305507, now seen corresponding path program 1 times [2022-07-12 11:02:00,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:00,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898074411] [2022-07-12 11:02:00,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:00,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:00,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:02:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:02:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 11:02:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:02:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:02:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:02:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:02:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:02:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 11:02:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:02:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:01,210 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-12 11:02:01,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:01,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898074411] [2022-07-12 11:02:01,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898074411] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:01,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:01,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 11:02:01,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51151961] [2022-07-12 11:02:01,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:01,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 11:02:01,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:01,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 11:02:01,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:02:01,212 INFO L87 Difference]: Start difference. First operand 893 states and 1411 transitions. Second operand has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-12 11:02:02,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:02,221 INFO L93 Difference]: Finished difference Result 913 states and 1449 transitions. [2022-07-12 11:02:02,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 11:02:02,222 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 123 [2022-07-12 11:02:02,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:02,227 INFO L225 Difference]: With dead ends: 913 [2022-07-12 11:02:02,227 INFO L226 Difference]: Without dead ends: 911 [2022-07-12 11:02:02,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2022-07-12 11:02:02,230 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 155 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:02,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 714 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1422 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 11:02:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2022-07-12 11:02:02,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 901. [2022-07-12 11:02:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 543 states have (on average 1.2504604051565378) internal successors, (679), 555 states have internal predecessors, (679), 304 states have call successors, (304), 47 states have call predecessors, (304), 53 states have return successors, (439), 298 states have call predecessors, (439), 303 states have call successors, (439) [2022-07-12 11:02:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1422 transitions. [2022-07-12 11:02:02,333 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1422 transitions. Word has length 123 [2022-07-12 11:02:02,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:02,335 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 1422 transitions. [2022-07-12 11:02:02,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-12 11:02:02,335 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1422 transitions. [2022-07-12 11:02:02,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-12 11:02:02,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:02,338 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:02,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 11:02:02,338 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:02,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:02,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1292205762, now seen corresponding path program 1 times [2022-07-12 11:02:02,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:02,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272413749] [2022-07-12 11:02:02,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:02,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:02:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:02:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:02:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:02:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:02:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:02:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:02:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:02:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:02:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-07-12 11:02:02,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:02,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272413749] [2022-07-12 11:02:02,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272413749] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:02,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:02,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:02:02,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334645828] [2022-07-12 11:02:02,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:02,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:02:02,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:02,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:02:02,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:02:02,597 INFO L87 Difference]: Start difference. First operand 901 states and 1422 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 11:02:03,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:03,037 INFO L93 Difference]: Finished difference Result 1326 states and 2097 transitions. [2022-07-12 11:02:03,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:02:03,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 128 [2022-07-12 11:02:03,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:03,044 INFO L225 Difference]: With dead ends: 1326 [2022-07-12 11:02:03,044 INFO L226 Difference]: Without dead ends: 923 [2022-07-12 11:02:03,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:02:03,048 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 124 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:03,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 266 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:02:03,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-07-12 11:02:03,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 919. [2022-07-12 11:02:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 556 states have (on average 1.2446043165467626) internal successors, (692), 569 states have internal predecessors, (692), 304 states have call successors, (304), 47 states have call predecessors, (304), 58 states have return successors, (449), 302 states have call predecessors, (449), 303 states have call successors, (449) [2022-07-12 11:02:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1445 transitions. [2022-07-12 11:02:03,151 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1445 transitions. Word has length 128 [2022-07-12 11:02:03,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:03,151 INFO L495 AbstractCegarLoop]: Abstraction has 919 states and 1445 transitions. [2022-07-12 11:02:03,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 11:02:03,152 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1445 transitions. [2022-07-12 11:02:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-12 11:02:03,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:03,154 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-07-12 11:02:03,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 11:02:03,155 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:03,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:03,156 INFO L85 PathProgramCache]: Analyzing trace with hash -171922954, now seen corresponding path program 1 times [2022-07-12 11:02:03,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:03,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104232999] [2022-07-12 11:02:03,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:03,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:02:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:02:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:02:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:02:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:02:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:02:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:02:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:02:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:02:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-07-12 11:02:03,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:03,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104232999] [2022-07-12 11:02:03,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104232999] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:03,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:03,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 11:02:03,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898773409] [2022-07-12 11:02:03,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:03,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 11:02:03,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:03,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 11:02:03,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:02:03,591 INFO L87 Difference]: Start difference. First operand 919 states and 1445 transitions. Second operand has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 11:02:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:04,740 INFO L93 Difference]: Finished difference Result 930 states and 1470 transitions. [2022-07-12 11:02:04,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 11:02:04,742 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2022-07-12 11:02:04,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:04,747 INFO L225 Difference]: With dead ends: 930 [2022-07-12 11:02:04,747 INFO L226 Difference]: Without dead ends: 928 [2022-07-12 11:02:04,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2022-07-12 11:02:04,749 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 92 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:04,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 731 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 11:02:04,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2022-07-12 11:02:04,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 923. [2022-07-12 11:02:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 559 states have (on average 1.2432915921288015) internal successors, (695), 572 states have internal predecessors, (695), 304 states have call successors, (304), 48 states have call predecessors, (304), 59 states have return successors, (449), 302 states have call predecessors, (449), 303 states have call successors, (449) [2022-07-12 11:02:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1448 transitions. [2022-07-12 11:02:04,848 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1448 transitions. Word has length 132 [2022-07-12 11:02:04,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:04,848 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 1448 transitions. [2022-07-12 11:02:04,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 11:02:04,849 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1448 transitions. [2022-07-12 11:02:04,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-12 11:02:04,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:04,851 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:04,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 11:02:04,852 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:04,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:04,852 INFO L85 PathProgramCache]: Analyzing trace with hash -236851265, now seen corresponding path program 1 times [2022-07-12 11:02:04,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:04,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139083239] [2022-07-12 11:02:04,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:04,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:04,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:04,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:04,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:04,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:04,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:04,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:02:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:02:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:02:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:02:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:02:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:02:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:02:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:02:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:02:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-07-12 11:02:05,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:05,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139083239] [2022-07-12 11:02:05,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139083239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:05,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:05,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:02:05,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021646455] [2022-07-12 11:02:05,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:05,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:02:05,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:05,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:02:05,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:02:05,093 INFO L87 Difference]: Start difference. First operand 923 states and 1448 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 11:02:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:05,529 INFO L93 Difference]: Finished difference Result 1352 states and 2126 transitions. [2022-07-12 11:02:05,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:02:05,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 129 [2022-07-12 11:02:05,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:05,537 INFO L225 Difference]: With dead ends: 1352 [2022-07-12 11:02:05,537 INFO L226 Difference]: Without dead ends: 945 [2022-07-12 11:02:05,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:02:05,541 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 62 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:05,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 292 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:02:05,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2022-07-12 11:02:05,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 923. [2022-07-12 11:02:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 559 states have (on average 1.2432915921288015) internal successors, (695), 572 states have internal predecessors, (695), 304 states have call successors, (304), 48 states have call predecessors, (304), 59 states have return successors, (449), 302 states have call predecessors, (449), 303 states have call successors, (449) [2022-07-12 11:02:05,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1448 transitions. [2022-07-12 11:02:05,643 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1448 transitions. Word has length 129 [2022-07-12 11:02:05,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:05,644 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 1448 transitions. [2022-07-12 11:02:05,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 11:02:05,644 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1448 transitions. [2022-07-12 11:02:05,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-12 11:02:05,647 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:05,647 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:05,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 11:02:05,647 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:05,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:05,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2044305728, now seen corresponding path program 1 times [2022-07-12 11:02:05,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:05,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077640530] [2022-07-12 11:02:05,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:05,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:02:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:02:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:02:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:02:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 11:02:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:02:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:02:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:02:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:02:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:02:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-12 11:02:06,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:06,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077640530] [2022-07-12 11:02:06,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077640530] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:06,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090235986] [2022-07-12 11:02:06,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:06,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:06,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:06,297 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:06,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 11:02:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 2727 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-12 11:02:06,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:06,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 11:02:07,118 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 11:02:07,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-07-12 11:02:07,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-07-12 11:02:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 26 proven. 37 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-12 11:02:07,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:02:32,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090235986] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:32,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:02:32,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 33 [2022-07-12 11:02:32,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981730884] [2022-07-12 11:02:32,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:02:32,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 11:02:32,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:32,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 11:02:32,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1266, Unknown=10, NotChecked=0, Total=1406 [2022-07-12 11:02:32,584 INFO L87 Difference]: Start difference. First operand 923 states and 1448 transitions. Second operand has 33 states, 25 states have (on average 3.96) internal successors, (99), 29 states have internal predecessors, (99), 15 states have call successors, (39), 7 states have call predecessors, (39), 8 states have return successors, (37), 9 states have call predecessors, (37), 13 states have call successors, (37) [2022-07-12 11:02:54,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:54,322 INFO L93 Difference]: Finished difference Result 1702 states and 2702 transitions. [2022-07-12 11:02:54,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-12 11:02:54,323 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 25 states have (on average 3.96) internal successors, (99), 29 states have internal predecessors, (99), 15 states have call successors, (39), 7 states have call predecessors, (39), 8 states have return successors, (37), 9 states have call predecessors, (37), 13 states have call successors, (37) Word has length 129 [2022-07-12 11:02:54,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:54,332 INFO L225 Difference]: With dead ends: 1702 [2022-07-12 11:02:54,332 INFO L226 Difference]: Without dead ends: 1252 [2022-07-12 11:02:54,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 242 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 43.7s TimeCoverageRelationStatistics Valid=458, Invalid=4923, Unknown=21, NotChecked=0, Total=5402 [2022-07-12 11:02:54,337 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 489 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 4507 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 6252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 4507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1200 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:54,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1232 Invalid, 6252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 4507 Invalid, 0 Unknown, 1200 Unchecked, 2.9s Time] [2022-07-12 11:02:54,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2022-07-12 11:02:54,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1143. [2022-07-12 11:02:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 688 states have (on average 1.2325581395348837) internal successors, (848), 704 states have internal predecessors, (848), 376 states have call successors, (376), 56 states have call predecessors, (376), 78 states have return successors, (555), 382 states have call predecessors, (555), 374 states have call successors, (555) [2022-07-12 11:02:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1779 transitions. [2022-07-12 11:02:54,503 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1779 transitions. Word has length 129 [2022-07-12 11:02:54,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:54,504 INFO L495 AbstractCegarLoop]: Abstraction has 1143 states and 1779 transitions. [2022-07-12 11:02:54,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 25 states have (on average 3.96) internal successors, (99), 29 states have internal predecessors, (99), 15 states have call successors, (39), 7 states have call predecessors, (39), 8 states have return successors, (37), 9 states have call predecessors, (37), 13 states have call successors, (37) [2022-07-12 11:02:54,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1779 transitions. [2022-07-12 11:02:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-12 11:02:54,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:54,507 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 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] [2022-07-12 11:02:54,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 11:02:54,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:54,724 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:54,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:54,724 INFO L85 PathProgramCache]: Analyzing trace with hash -834241185, now seen corresponding path program 1 times [2022-07-12 11:02:54,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:54,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364666279] [2022-07-12 11:02:54,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:54,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:54,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:54,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:54,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:54,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:54,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:54,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:54,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:54,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:02:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:54,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:02:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:54,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:02:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:54,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:02:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:54,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:02:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:54,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:02:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:02:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:02:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 11:02:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:02:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-12 11:02:55,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:55,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364666279] [2022-07-12 11:02:55,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364666279] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:55,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187488144] [2022-07-12 11:02:55,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:55,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:55,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:55,039 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:55,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 11:02:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:55,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 2748 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 11:02:55,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-12 11:02:55,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:02:55,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187488144] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:55,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:02:55,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2022-07-12 11:02:55,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650647700] [2022-07-12 11:02:55,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:55,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:02:55,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:55,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:02:55,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:02:55,537 INFO L87 Difference]: Start difference. First operand 1143 states and 1779 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 11:02:55,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:55,732 INFO L93 Difference]: Finished difference Result 1765 states and 2759 transitions. [2022-07-12 11:02:55,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:02:55,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 131 [2022-07-12 11:02:55,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:55,737 INFO L225 Difference]: With dead ends: 1765 [2022-07-12 11:02:55,737 INFO L226 Difference]: Without dead ends: 889 [2022-07-12 11:02:55,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:02:55,743 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 11 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:55,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1267 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:02:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2022-07-12 11:02:55,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 879. [2022-07-12 11:02:55,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 537 states have (on average 1.1955307262569832) internal successors, (642), 546 states have internal predecessors, (642), 271 states have call successors, (271), 51 states have call predecessors, (271), 70 states have return successors, (387), 281 states have call predecessors, (387), 269 states have call successors, (387) [2022-07-12 11:02:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1300 transitions. [2022-07-12 11:02:55,845 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1300 transitions. Word has length 131 [2022-07-12 11:02:55,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:55,845 INFO L495 AbstractCegarLoop]: Abstraction has 879 states and 1300 transitions. [2022-07-12 11:02:55,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 11:02:55,845 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1300 transitions. [2022-07-12 11:02:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-12 11:02:55,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:55,848 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 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] [2022-07-12 11:02:55,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-12 11:02:56,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-12 11:02:56,060 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:56,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:56,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1554147384, now seen corresponding path program 2 times [2022-07-12 11:02:56,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:56,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084565336] [2022-07-12 11:02:56,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:56,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:02:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:02:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:02:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:02:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:02:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:02:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:02:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 11:02:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:02:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 11:02:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:56,720 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 34 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-12 11:02:56,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:56,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084565336] [2022-07-12 11:02:56,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084565336] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:56,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688690220] [2022-07-12 11:02:56,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:02:56,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:56,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:56,723 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:56,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-12 11:02:57,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:02:57,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:02:57,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 2758 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-12 11:02:57,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:57,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:02:57,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:02:58,558 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 87 proven. 13 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 11:02:58,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:02:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 42 proven. 16 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-12 11:02:59,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688690220] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:02:59,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:02:59,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 11] total 42 [2022-07-12 11:02:59,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655266946] [2022-07-12 11:02:59,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:02:59,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-12 11:02:59,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:59,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-12 11:02:59,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1579, Unknown=0, NotChecked=0, Total=1722 [2022-07-12 11:02:59,082 INFO L87 Difference]: Start difference. First operand 879 states and 1300 transitions. Second operand has 42 states, 39 states have (on average 3.8461538461538463) internal successors, (150), 38 states have internal predecessors, (150), 12 states have call successors, (53), 8 states have call predecessors, (53), 9 states have return successors, (49), 9 states have call predecessors, (49), 11 states have call successors, (49) [2022-07-12 11:03:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:07,021 INFO L93 Difference]: Finished difference Result 1620 states and 2474 transitions. [2022-07-12 11:03:07,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-07-12 11:03:07,022 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 3.8461538461538463) internal successors, (150), 38 states have internal predecessors, (150), 12 states have call successors, (53), 8 states have call predecessors, (53), 9 states have return successors, (49), 9 states have call predecessors, (49), 11 states have call successors, (49) Word has length 133 [2022-07-12 11:03:07,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:07,026 INFO L225 Difference]: With dead ends: 1620 [2022-07-12 11:03:07,026 INFO L226 Difference]: Without dead ends: 1058 [2022-07-12 11:03:07,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 284 SyntacticMatches, 9 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3045 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1190, Invalid=9730, Unknown=0, NotChecked=0, Total=10920 [2022-07-12 11:03:07,031 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 605 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 6459 mSolverCounterSat, 835 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 8427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 835 IncrementalHoareTripleChecker+Valid, 6459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1133 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:07,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 1162 Invalid, 8427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [835 Valid, 6459 Invalid, 0 Unknown, 1133 Unchecked, 4.8s Time] [2022-07-12 11:03:07,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2022-07-12 11:03:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 909. [2022-07-12 11:03:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 557 states have (on average 1.1759425493716338) internal successors, (655), 571 states have internal predecessors, (655), 270 states have call successors, (270), 63 states have call predecessors, (270), 81 states have return successors, (396), 274 states have call predecessors, (396), 268 states have call successors, (396) [2022-07-12 11:03:07,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1321 transitions. [2022-07-12 11:03:07,185 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1321 transitions. Word has length 133 [2022-07-12 11:03:07,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:07,186 INFO L495 AbstractCegarLoop]: Abstraction has 909 states and 1321 transitions. [2022-07-12 11:03:07,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 3.8461538461538463) internal successors, (150), 38 states have internal predecessors, (150), 12 states have call successors, (53), 8 states have call predecessors, (53), 9 states have return successors, (49), 9 states have call predecessors, (49), 11 states have call successors, (49) [2022-07-12 11:03:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1321 transitions. [2022-07-12 11:03:07,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-12 11:03:07,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:07,189 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:07,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-12 11:03:07,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-12 11:03:07,404 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:07,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:07,404 INFO L85 PathProgramCache]: Analyzing trace with hash -114155574, now seen corresponding path program 1 times [2022-07-12 11:03:07,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:07,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484147544] [2022-07-12 11:03:07,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:07,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:07,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:07,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:07,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:07,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:07,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:03:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:07,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:03:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:07,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:03:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:07,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:03:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:07,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:03:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:07,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:03:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:07,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:03:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:07,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:03:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:07,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:03:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:07,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:03:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:07,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 11:03:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:07,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 11:03:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:07,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:03:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-07-12 11:03:07,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:07,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484147544] [2022-07-12 11:03:07,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484147544] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:07,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:03:07,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:03:07,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137198783] [2022-07-12 11:03:07,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:07,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:03:07,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:07,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:03:07,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:03:07,640 INFO L87 Difference]: Start difference. First operand 909 states and 1321 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-12 11:03:08,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:08,234 INFO L93 Difference]: Finished difference Result 919 states and 1332 transitions. [2022-07-12 11:03:08,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:03:08,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2022-07-12 11:03:08,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:08,238 INFO L225 Difference]: With dead ends: 919 [2022-07-12 11:03:08,238 INFO L226 Difference]: Without dead ends: 917 [2022-07-12 11:03:08,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:03:08,239 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 78 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:08,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 518 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 11:03:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2022-07-12 11:03:08,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 915. [2022-07-12 11:03:08,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 560 states have (on average 1.175) internal successors, (658), 574 states have internal predecessors, (658), 272 states have call successors, (272), 64 states have call predecessors, (272), 82 states have return successors, (398), 276 states have call predecessors, (398), 270 states have call successors, (398) [2022-07-12 11:03:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1328 transitions. [2022-07-12 11:03:08,369 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1328 transitions. Word has length 135 [2022-07-12 11:03:08,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:08,369 INFO L495 AbstractCegarLoop]: Abstraction has 915 states and 1328 transitions. [2022-07-12 11:03:08,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-12 11:03:08,369 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1328 transitions. [2022-07-12 11:03:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-12 11:03:08,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:08,372 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:08,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 11:03:08,373 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:08,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:08,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1719115993, now seen corresponding path program 1 times [2022-07-12 11:03:08,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:08,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252754847] [2022-07-12 11:03:08,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:08,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:03:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:03:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:03:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:03:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:03:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:03:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:03:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:03:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:03:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 11:03:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 11:03:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 11:03:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 11:03:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:03:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:08,689 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-07-12 11:03:08,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:08,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252754847] [2022-07-12 11:03:08,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252754847] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:08,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:03:08,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:03:08,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001245332] [2022-07-12 11:03:08,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:08,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:03:08,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:08,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:03:08,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:03:08,692 INFO L87 Difference]: Start difference. First operand 915 states and 1328 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-12 11:03:09,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:09,115 INFO L93 Difference]: Finished difference Result 1522 states and 2297 transitions. [2022-07-12 11:03:09,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:03:09,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2022-07-12 11:03:09,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:09,119 INFO L225 Difference]: With dead ends: 1522 [2022-07-12 11:03:09,119 INFO L226 Difference]: Without dead ends: 906 [2022-07-12 11:03:09,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:03:09,123 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 69 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:09,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 281 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:03:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-07-12 11:03:09,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 906. [2022-07-12 11:03:09,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 554 states have (on average 1.1714801444043321) internal successors, (649), 567 states have internal predecessors, (649), 270 states have call successors, (270), 64 states have call predecessors, (270), 81 states have return successors, (376), 274 states have call predecessors, (376), 268 states have call successors, (376) [2022-07-12 11:03:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1295 transitions. [2022-07-12 11:03:09,256 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1295 transitions. Word has length 140 [2022-07-12 11:03:09,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:09,256 INFO L495 AbstractCegarLoop]: Abstraction has 906 states and 1295 transitions. [2022-07-12 11:03:09,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-12 11:03:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1295 transitions. [2022-07-12 11:03:09,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-12 11:03:09,259 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:09,259 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:09,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 11:03:09,260 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:09,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:09,260 INFO L85 PathProgramCache]: Analyzing trace with hash 947963267, now seen corresponding path program 1 times [2022-07-12 11:03:09,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:09,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002459414] [2022-07-12 11:03:09,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:09,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:03:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:03:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:03:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:03:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:03:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:03:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:03:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:03:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:03:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 11:03:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 11:03:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:03:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:03:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 11:03:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 26 proven. 33 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-07-12 11:03:09,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:09,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002459414] [2022-07-12 11:03:09,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002459414] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:09,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22008609] [2022-07-12 11:03:09,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:09,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:09,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:09,691 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:09,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-12 11:03:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 2834 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-12 11:03:10,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:10,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:03:10,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:03:10,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-12 11:03:10,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-12 11:03:10,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-12 11:03:10,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-12 11:03:10,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 11:03:10,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 11:03:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 87 proven. 8 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-12 11:03:10,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:03:10,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-07-12 11:03:10,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:03:10,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:03:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-07-12 11:03:10,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22008609] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:03:10,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:03:10,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 11] total 25 [2022-07-12 11:03:10,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135138059] [2022-07-12 11:03:10,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:03:10,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 11:03:10,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:10,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 11:03:10,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2022-07-12 11:03:10,984 INFO L87 Difference]: Start difference. First operand 906 states and 1295 transitions. Second operand has 25 states, 24 states have (on average 5.625) internal successors, (135), 23 states have internal predecessors, (135), 10 states have call successors, (50), 7 states have call predecessors, (50), 9 states have return successors, (47), 9 states have call predecessors, (47), 10 states have call successors, (47) [2022-07-12 11:03:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:13,338 INFO L93 Difference]: Finished difference Result 1463 states and 2133 transitions. [2022-07-12 11:03:13,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 11:03:13,339 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.625) internal successors, (135), 23 states have internal predecessors, (135), 10 states have call successors, (50), 7 states have call predecessors, (50), 9 states have return successors, (47), 9 states have call predecessors, (47), 10 states have call successors, (47) Word has length 146 [2022-07-12 11:03:13,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:13,342 INFO L225 Difference]: With dead ends: 1463 [2022-07-12 11:03:13,343 INFO L226 Difference]: Without dead ends: 892 [2022-07-12 11:03:13,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 312 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=1775, Unknown=0, NotChecked=0, Total=1980 [2022-07-12 11:03:13,346 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 262 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 2850 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 3503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 2850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 411 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:13,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 757 Invalid, 3503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 2850 Invalid, 0 Unknown, 411 Unchecked, 1.8s Time] [2022-07-12 11:03:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2022-07-12 11:03:13,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 786. [2022-07-12 11:03:13,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 493 states have (on average 1.1399594320486814) internal successors, (562), 499 states have internal predecessors, (562), 218 states have call successors, (218), 63 states have call predecessors, (218), 74 states have return successors, (291), 223 states have call predecessors, (291), 217 states have call successors, (291) [2022-07-12 11:03:13,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1071 transitions. [2022-07-12 11:03:13,446 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1071 transitions. Word has length 146 [2022-07-12 11:03:13,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:13,446 INFO L495 AbstractCegarLoop]: Abstraction has 786 states and 1071 transitions. [2022-07-12 11:03:13,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.625) internal successors, (135), 23 states have internal predecessors, (135), 10 states have call successors, (50), 7 states have call predecessors, (50), 9 states have return successors, (47), 9 states have call predecessors, (47), 10 states have call successors, (47) [2022-07-12 11:03:13,447 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1071 transitions. [2022-07-12 11:03:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-12 11:03:13,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:13,449 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2022-07-12 11:03:13,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-12 11:03:13,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-12 11:03:13,676 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:13,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:13,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1640017927, now seen corresponding path program 1 times [2022-07-12 11:03:13,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:13,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838869875] [2022-07-12 11:03:13,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:13,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:03:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:03:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:03:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:03:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:03:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:03:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:03:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:03:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:03:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:03:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 11:03:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:03:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:03:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 11:03:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 11:03:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:14,620 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2022-07-12 11:03:14,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:14,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838869875] [2022-07-12 11:03:14,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838869875] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:14,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483587353] [2022-07-12 11:03:14,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:14,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:14,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:14,624 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:14,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-12 11:03:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:15,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 2901 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-12 11:03:15,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:15,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 11:03:15,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:03:15,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:03:15,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 11:03:15,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 11:03:15,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 11:03:15,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 11:03:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-12 11:03:15,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:03:15,789 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2436 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base| v_ArrVal_2436) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.offset|)) 0)) (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base| v_ArrVal_2434) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.offset|)) 0))) is different from false [2022-07-12 11:03:15,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483587353] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:15,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:03:15,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2022-07-12 11:03:15,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896925815] [2022-07-12 11:03:15,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:03:15,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 11:03:15,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:15,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 11:03:15,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=532, Unknown=1, NotChecked=46, Total=650 [2022-07-12 11:03:15,797 INFO L87 Difference]: Start difference. First operand 786 states and 1071 transitions. Second operand has 23 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 21 states have internal predecessors, (115), 10 states have call successors, (39), 5 states have call predecessors, (39), 7 states have return successors, (37), 9 states have call predecessors, (37), 10 states have call successors, (37) [2022-07-12 11:03:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:17,567 INFO L93 Difference]: Finished difference Result 1435 states and 1979 transitions. [2022-07-12 11:03:17,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-12 11:03:17,567 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 21 states have internal predecessors, (115), 10 states have call successors, (39), 5 states have call predecessors, (39), 7 states have return successors, (37), 9 states have call predecessors, (37), 10 states have call successors, (37) Word has length 159 [2022-07-12 11:03:17,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:17,571 INFO L225 Difference]: With dead ends: 1435 [2022-07-12 11:03:17,571 INFO L226 Difference]: Without dead ends: 804 [2022-07-12 11:03:17,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 294 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=1624, Unknown=1, NotChecked=82, Total=1892 [2022-07-12 11:03:17,574 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 222 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 2837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:17,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 696 Invalid, 2837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 2354 Invalid, 0 Unknown, 276 Unchecked, 1.3s Time] [2022-07-12 11:03:17,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-07-12 11:03:17,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 761. [2022-07-12 11:03:17,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 475 states have (on average 1.1410526315789473) internal successors, (542), 482 states have internal predecessors, (542), 213 states have call successors, (213), 60 states have call predecessors, (213), 72 states have return successors, (284), 218 states have call predecessors, (284), 212 states have call successors, (284) [2022-07-12 11:03:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1039 transitions. [2022-07-12 11:03:17,659 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1039 transitions. Word has length 159 [2022-07-12 11:03:17,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:17,659 INFO L495 AbstractCegarLoop]: Abstraction has 761 states and 1039 transitions. [2022-07-12 11:03:17,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 21 states have internal predecessors, (115), 10 states have call successors, (39), 5 states have call predecessors, (39), 7 states have return successors, (37), 9 states have call predecessors, (37), 10 states have call successors, (37) [2022-07-12 11:03:17,659 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1039 transitions. [2022-07-12 11:03:17,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-12 11:03:17,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:17,662 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 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] [2022-07-12 11:03:17,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-07-12 11:03:17,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:17,875 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:17,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:17,876 INFO L85 PathProgramCache]: Analyzing trace with hash 557126258, now seen corresponding path program 1 times [2022-07-12 11:03:17,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:17,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628090660] [2022-07-12 11:03:17,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:17,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:03:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:03:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:03:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:03:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:03:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:03:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:03:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:03:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:03:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:03:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:03:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:03:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:03:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 11:03:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 11:03:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:03:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 11:03:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 11:03:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2022-07-12 11:03:18,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:18,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628090660] [2022-07-12 11:03:18,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628090660] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:18,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922417792] [2022-07-12 11:03:18,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:18,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:18,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:18,223 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:18,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-12 11:03:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:18,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 2884 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 11:03:18,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-12 11:03:18,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:03:18,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922417792] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:18,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:03:18,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2022-07-12 11:03:18,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164244016] [2022-07-12 11:03:18,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:18,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:03:18,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:18,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:03:18,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:03:18,768 INFO L87 Difference]: Start difference. First operand 761 states and 1039 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-12 11:03:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:18,981 INFO L93 Difference]: Finished difference Result 1224 states and 1703 transitions. [2022-07-12 11:03:18,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:03:18,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 177 [2022-07-12 11:03:18,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:18,986 INFO L225 Difference]: With dead ends: 1224 [2022-07-12 11:03:18,986 INFO L226 Difference]: Without dead ends: 761 [2022-07-12 11:03:18,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:03:18,990 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 10 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:18,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1275 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:03:18,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-07-12 11:03:19,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2022-07-12 11:03:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 475 states have (on average 1.1410526315789473) internal successors, (542), 482 states have internal predecessors, (542), 213 states have call successors, (213), 60 states have call predecessors, (213), 72 states have return successors, (282), 218 states have call predecessors, (282), 212 states have call successors, (282) [2022-07-12 11:03:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1037 transitions. [2022-07-12 11:03:19,079 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1037 transitions. Word has length 177 [2022-07-12 11:03:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:19,079 INFO L495 AbstractCegarLoop]: Abstraction has 761 states and 1037 transitions. [2022-07-12 11:03:19,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-12 11:03:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1037 transitions. [2022-07-12 11:03:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-12 11:03:19,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:19,081 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:19,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-07-12 11:03:19,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-07-12 11:03:19,282 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:19,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:19,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2122119175, now seen corresponding path program 2 times [2022-07-12 11:03:19,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:19,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778930084] [2022-07-12 11:03:19,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:19,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:03:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:03:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:03:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:03:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:03:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:03:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:03:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:03:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:03:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:03:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:03:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 11:03:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:03:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 11:03:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 11:03:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 11:03:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 11:03:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 11:03:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 19 proven. 63 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-12 11:03:19,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:19,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778930084] [2022-07-12 11:03:19,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778930084] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:19,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182654615] [2022-07-12 11:03:19,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:03:19,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:19,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:19,810 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:19,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-12 11:03:21,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:03:21,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:03:21,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 2894 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-12 11:03:21,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:21,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 11:03:21,592 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2588 (Array Int Int))) (= (store |c_old(#memory_int)| |c_ensure_byte_cursor_has_allocated_buffer_member_#in~cursor.base| v_ArrVal_2588) |c_#memory_int|)) is different from true [2022-07-12 11:03:21,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-07-12 11:03:22,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 42 [2022-07-12 11:03:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 125 proven. 21 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-07-12 11:03:22,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:03:22,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2591 (Array Int Int))) (let ((.cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#rhs~0#1.base| v_ArrVal_2591) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_compare_lookup_harness_~#lhs~0#1.offset|) 18446744073709551616))) (or (<= .cse0 0) (not (<= .cse0 9223372036854775807))))) is different from false [2022-07-12 11:03:22,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182654615] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:22,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:03:22,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 28 [2022-07-12 11:03:22,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118858906] [2022-07-12 11:03:22,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:03:22,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 11:03:22,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:22,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 11:03:22,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=886, Unknown=2, NotChecked=122, Total=1122 [2022-07-12 11:03:22,836 INFO L87 Difference]: Start difference. First operand 761 states and 1037 transitions. Second operand has 28 states, 26 states have (on average 4.8076923076923075) internal successors, (125), 24 states have internal predecessors, (125), 12 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (44), 10 states have call predecessors, (44), 12 states have call successors, (44) [2022-07-12 11:03:25,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:25,813 INFO L93 Difference]: Finished difference Result 1375 states and 1924 transitions. [2022-07-12 11:03:25,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-12 11:03:25,814 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 4.8076923076923075) internal successors, (125), 24 states have internal predecessors, (125), 12 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (44), 10 states have call predecessors, (44), 12 states have call successors, (44) Word has length 179 [2022-07-12 11:03:25,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:25,819 INFO L225 Difference]: With dead ends: 1375 [2022-07-12 11:03:25,819 INFO L226 Difference]: Without dead ends: 1018 [2022-07-12 11:03:25,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 309 SyntacticMatches, 24 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=420, Invalid=2639, Unknown=29, NotChecked=218, Total=3306 [2022-07-12 11:03:25,822 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 256 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 3069 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 4372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 3069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1105 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:25,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 652 Invalid, 4372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 3069 Invalid, 0 Unknown, 1105 Unchecked, 2.0s Time] [2022-07-12 11:03:25,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2022-07-12 11:03:25,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 872. [2022-07-12 11:03:25,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 544 states have (on average 1.1286764705882353) internal successors, (614), 549 states have internal predecessors, (614), 248 states have call successors, (248), 71 states have call predecessors, (248), 79 states have return successors, (326), 251 states have call predecessors, (326), 247 states have call successors, (326) [2022-07-12 11:03:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1188 transitions. [2022-07-12 11:03:25,940 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1188 transitions. Word has length 179 [2022-07-12 11:03:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:25,941 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 1188 transitions. [2022-07-12 11:03:25,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 4.8076923076923075) internal successors, (125), 24 states have internal predecessors, (125), 12 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (44), 10 states have call predecessors, (44), 12 states have call successors, (44) [2022-07-12 11:03:25,941 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1188 transitions. [2022-07-12 11:03:25,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-12 11:03:25,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:25,945 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:25,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-12 11:03:26,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:26,167 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:26,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:26,168 INFO L85 PathProgramCache]: Analyzing trace with hash -585263233, now seen corresponding path program 1 times [2022-07-12 11:03:26,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:26,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015626750] [2022-07-12 11:03:26,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:26,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:03:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:03:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:03:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:03:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:03:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:03:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:03:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:03:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:03:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:03:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 11:03:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:03:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:03:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 11:03:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-07-12 11:03:26,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:26,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015626750] [2022-07-12 11:03:26,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015626750] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:26,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483689042] [2022-07-12 11:03:26,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:26,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:26,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:26,952 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:03:26,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-12 11:03:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:27,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 2893 conjuncts, 103 conjunts are in the unsatisfiable core [2022-07-12 11:03:27,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:27,499 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-12 11:03:27,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 27 [2022-07-12 11:03:27,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:03:27,966 INFO L356 Elim1Store]: treesize reduction 60, result has 15.5 percent of original size [2022-07-12 11:03:27,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2022-07-12 11:03:28,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-12 11:03:28,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:03:28,844 INFO L356 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2022-07-12 11:03:28,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 40 [2022-07-12 11:03:28,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-12 11:03:28,974 INFO L356 Elim1Store]: treesize reduction 22, result has 67.2 percent of original size [2022-07-12 11:03:28,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 75 [2022-07-12 11:03:29,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:03:29,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:03:29,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-12 11:03:29,433 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-12 11:03:29,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 46 [2022-07-12 11:03:29,439 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 11:03:29,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-12 11:03:29,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:29,660 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-12 11:03:29,664 INFO L158 Benchmark]: Toolchain (without parser) took 162148.30ms. Allocated memory was 88.1MB in the beginning and 578.8MB in the end (delta: 490.7MB). Free memory was 57.9MB in the beginning and 452.7MB in the end (delta: -394.7MB). Peak memory consumption was 101.7MB. Max. memory is 16.1GB. [2022-07-12 11:03:29,664 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 88.1MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:03:29,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2084.92ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 57.6MB in the beginning and 72.7MB in the end (delta: -15.1MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. [2022-07-12 11:03:29,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 176.97ms. Allocated memory is still 157.3MB. Free memory was 72.7MB in the beginning and 103.3MB in the end (delta: -30.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 11:03:29,664 INFO L158 Benchmark]: Boogie Preprocessor took 96.54ms. Allocated memory is still 157.3MB. Free memory was 103.3MB in the beginning and 96.1MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 11:03:29,664 INFO L158 Benchmark]: RCFGBuilder took 1313.96ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 96.1MB in the beginning and 130.0MB in the end (delta: -33.8MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2022-07-12 11:03:29,664 INFO L158 Benchmark]: TraceAbstraction took 158467.45ms. Allocated memory was 188.7MB in the beginning and 578.8MB in the end (delta: 390.1MB). Free memory was 130.0MB in the beginning and 452.7MB in the end (delta: -322.7MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2022-07-12 11:03:29,665 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.20ms. Allocated memory is still 88.1MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2084.92ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 57.6MB in the beginning and 72.7MB in the end (delta: -15.1MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 176.97ms. Allocated memory is still 157.3MB. Free memory was 72.7MB in the beginning and 103.3MB in the end (delta: -30.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.54ms. Allocated memory is still 157.3MB. Free memory was 103.3MB in the beginning and 96.1MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1313.96ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 96.1MB in the beginning and 130.0MB in the end (delta: -33.8MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. * TraceAbstraction took 158467.45ms. Allocated memory was 188.7MB in the beginning and 578.8MB in the end (delta: 390.1MB). Free memory was 130.0MB in the beginning and 452.7MB in the end (delta: -322.7MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 11:03:29,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0658a835d559c56129f1a85a00e9d3bbd205d66ef64b5c7d14ae72b3d1b496e0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:03:31,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:03:31,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:03:31,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:03:31,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:03:31,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:03:31,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:03:31,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:03:31,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:03:31,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:03:31,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:03:31,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:03:31,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:03:31,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:03:31,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:03:31,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:03:31,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:03:31,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:03:31,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:03:31,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:03:31,638 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:03:31,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:03:31,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:03:31,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:03:31,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:03:31,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:03:31,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:03:31,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:03:31,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:03:31,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:03:31,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:03:31,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:03:31,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:03:31,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:03:31,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:03:31,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:03:31,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:03:31,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:03:31,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:03:31,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:03:31,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:03:31,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:03:31,664 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-12 11:03:31,695 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:03:31,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:03:31,696 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:03:31,696 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:03:31,696 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:03:31,697 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:03:31,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:03:31,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:03:31,698 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:03:31,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:03:31,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:03:31,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:03:31,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:03:31,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:03:31,700 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 11:03:31,700 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 11:03:31,700 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 11:03:31,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:03:31,700 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:03:31,701 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:03:31,701 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:03:31,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:03:31,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:03:31,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:03:31,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:03:31,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:03:31,702 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:03:31,702 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 11:03:31,702 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 11:03:31,702 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:03:31,703 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:03:31,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:03:31,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 11:03:31,703 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0658a835d559c56129f1a85a00e9d3bbd205d66ef64b5c7d14ae72b3d1b496e0 [2022-07-12 11:03:32,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:03:32,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:03:32,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:03:32,036 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:03:32,036 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:03:32,038 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_harness.i [2022-07-12 11:03:32,090 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da2b074af/7d344b1f92e242b9bc87f57ecfbcd2ee/FLAGd4d996095 [2022-07-12 11:03:32,809 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:03:32,809 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_harness.i [2022-07-12 11:03:32,847 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da2b074af/7d344b1f92e242b9bc87f57ecfbcd2ee/FLAGd4d996095 [2022-07-12 11:03:33,066 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da2b074af/7d344b1f92e242b9bc87f57ecfbcd2ee [2022-07-12 11:03:33,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:03:33,070 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:03:33,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:03:33,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:03:33,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:03:33,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:03:33" (1/1) ... [2022-07-12 11:03:33,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d5f9ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:03:33, skipping insertion in model container [2022-07-12 11:03:33,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:03:33" (1/1) ... [2022-07-12 11:03:33,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:03:33,179 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:03:33,454 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_harness.i[4504,4517] [2022-07-12 11:03:33,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_compare_lookup_harness.i[4564,4577] [2022-07-12 11:03:34,054 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:34,054 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:34,057 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:34,058 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:34,059 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:34,078 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:34,079 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:34,081 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:34,084 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:34,324 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:03:34,325 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:03:34,326 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:03:34,327 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:03:34,328 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:03:34,328 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:03:34,329 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:03:34,329 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:03:34,330 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:03:34,330 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:03:34,433 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:03:34,445 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.ArithmeticException: BigInteger out of int range at java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.checkIfNecessaryMemoryModelAdaption(CHandler.java:1009) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1384) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:249) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.translateInitializer(CHandler.java:2978) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleIASTDeclarator(CHandler.java:2836) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2138) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:143) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1135) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:211) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-12 11:03:34,449 INFO L158 Benchmark]: Toolchain (without parser) took 1377.71ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 28.0MB in the beginning and 32.8MB in the end (delta: -4.8MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2022-07-12 11:03:34,449 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 50.3MB. Free memory is still 31.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:03:34,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1374.67ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 27.7MB in the beginning and 32.8MB in the end (delta: -5.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2022-07-12 11:03:34,451 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.20ms. Allocated memory is still 50.3MB. Free memory is still 31.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1374.67ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 27.7MB in the beginning and 32.8MB in the end (delta: -5.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: ArithmeticException: BigInteger out of int range: java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range