./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_ignore_case_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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_buf_eq_ignore_case_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 82914be9df39aade96902f979c145aa97bb18d611f7f0e9a90ee0ab6b53af5a2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 21:57:44,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:57:44,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:57:44,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:57:44,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:57:44,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:57:44,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:57:44,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:57:44,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:57:44,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:57:44,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:57:44,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:57:44,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:57:44,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:57:44,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:57:44,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:57:44,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:57:44,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:57:44,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:57:44,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:57:44,226 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:57:44,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:57:44,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:57:44,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:57:44,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:57:44,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:57:44,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:57:44,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:57:44,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:57:44,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:57:44,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:57:44,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:57:44,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:57:44,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:57:44,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:57:44,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:57:44,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:57:44,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:57:44,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:57:44,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:57:44,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:57:44,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:57:44,246 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 21:57:44,277 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:57:44,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:57:44,278 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:57:44,278 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:57:44,279 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:57:44,279 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:57:44,280 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:57:44,280 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:57:44,280 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:57:44,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:57:44,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 21:57:44,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:57:44,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:57:44,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:57:44,282 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:57:44,282 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:57:44,282 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:57:44,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:57:44,283 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:57:44,283 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:57:44,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:57:44,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:57:44,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:57:44,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:57:44,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:57:44,284 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 21:57:44,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 21:57:44,285 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:57:44,285 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:57:44,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:57:44,285 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 -> 82914be9df39aade96902f979c145aa97bb18d611f7f0e9a90ee0ab6b53af5a2 [2022-07-19 21:57:44,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:57:44,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:57:44,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:57:44,514 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:57:44,514 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:57:44,515 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_ignore_case_harness.i [2022-07-19 21:57:44,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fc67d232/c61db75c3e98488fb53832ee81789fb5/FLAG4265dfb75 [2022-07-19 21:57:45,206 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:57:45,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_ignore_case_harness.i [2022-07-19 21:57:45,240 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fc67d232/c61db75c3e98488fb53832ee81789fb5/FLAG4265dfb75 [2022-07-19 21:57:45,340 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fc67d232/c61db75c3e98488fb53832ee81789fb5 [2022-07-19 21:57:45,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:57:45,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:57:45,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:57:45,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:57:45,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:57:45,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:57:45" (1/1) ... [2022-07-19 21:57:45,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c0039b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:57:45, skipping insertion in model container [2022-07-19 21:57:45,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:57:45" (1/1) ... [2022-07-19 21:57:45,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:57:45,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:57:45,686 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_buf_eq_ignore_case_harness.i[4501,4514] [2022-07-19 21:57:45,694 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_buf_eq_ignore_case_harness.i[4561,4574] [2022-07-19 21:57:46,278 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,281 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,282 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,282 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,283 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,299 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,300 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,301 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,301 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,530 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 21:57:46,531 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 21:57:46,532 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 21:57:46,533 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 21:57:46,534 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 21:57:46,535 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 21:57:46,535 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 21:57:46,536 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 21:57:46,536 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 21:57:46,537 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 21:57:46,646 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 21:57:46,771 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,772 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:57:46,856 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 21:57:46,867 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_buf_eq_ignore_case_harness.i[4501,4514] [2022-07-19 21:57:46,868 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_buf_eq_ignore_case_harness.i[4561,4574] [2022-07-19 21:57:46,891 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,892 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,892 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,892 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,893 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,897 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,898 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,899 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,899 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:46,922 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 21:57:46,923 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 21:57:46,923 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 21:57:46,924 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 21:57:46,925 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 21:57:46,925 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 21:57:46,926 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 21:57:46,926 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 21:57:46,926 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 21:57:46,927 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 21:57:46,948 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 21:57:47,032 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:47,034 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:47,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:57:47,278 INFO L208 MainTranslator]: Completed translation [2022-07-19 21:57:47,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:57:47 WrapperNode [2022-07-19 21:57:47,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 21:57:47,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 21:57:47,280 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 21:57:47,280 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 21:57:47,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:57:47" (1/1) ... [2022-07-19 21:57:47,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:57:47" (1/1) ... [2022-07-19 21:57:47,484 INFO L137 Inliner]: procedures = 691, calls = 2661, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 862 [2022-07-19 21:57:47,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 21:57:47,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 21:57:47,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 21:57:47,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 21:57:47,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:57:47" (1/1) ... [2022-07-19 21:57:47,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:57:47" (1/1) ... [2022-07-19 21:57:47,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:57:47" (1/1) ... [2022-07-19 21:57:47,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:57:47" (1/1) ... [2022-07-19 21:57:47,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:57:47" (1/1) ... [2022-07-19 21:57:47,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:57:47" (1/1) ... [2022-07-19 21:57:47,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:57:47" (1/1) ... [2022-07-19 21:57:47,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 21:57:47,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 21:57:47,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 21:57:47,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 21:57:47,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:57:47" (1/1) ... [2022-07-19 21:57:47,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:57:47,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:57:47,604 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-19 21:57:47,614 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-19 21:57:47,642 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-19 21:57:47,642 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-19 21:57:47,643 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq_ignore_case [2022-07-19 21:57:47,643 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq_ignore_case [2022-07-19 21:57:47,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 21:57:47,643 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-19 21:57:47,644 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-19 21:57:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 21:57:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 21:57:47,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 21:57:47,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 21:57:47,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 21:57:47,646 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2022-07-19 21:57:47,646 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2022-07-19 21:57:47,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 21:57:47,647 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_byte_buf_has_allocated_buffer_member [2022-07-19 21:57:47,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_byte_buf_has_allocated_buffer_member [2022-07-19 21:57:47,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 21:57:47,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 21:57:47,648 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-19 21:57:47,648 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-19 21:57:47,648 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-19 21:57:47,648 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-19 21:57:47,649 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 21:57:47,649 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 21:57:47,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 21:57:47,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 21:57:47,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 21:57:47,650 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-19 21:57:47,650 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-19 21:57:47,651 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_bounded [2022-07-19 21:57:47,651 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_bounded [2022-07-19 21:57:47,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 21:57:47,651 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_buf_equivalence [2022-07-19 21:57:47,652 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_buf_equivalence [2022-07-19 21:57:47,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 21:57:47,912 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 21:57:47,913 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 21:57:49,175 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 21:57:49,182 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 21:57:49,182 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 21:57:49,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:57:49 BoogieIcfgContainer [2022-07-19 21:57:49,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 21:57:49,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 21:57:49,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 21:57:49,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 21:57:49,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:57:45" (1/3) ... [2022-07-19 21:57:49,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e6d558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:57:49, skipping insertion in model container [2022-07-19 21:57:49,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:57:47" (2/3) ... [2022-07-19 21:57:49,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e6d558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:57:49, skipping insertion in model container [2022-07-19 21:57:49,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:57:49" (3/3) ... [2022-07-19 21:57:49,192 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_eq_ignore_case_harness.i [2022-07-19 21:57:49,204 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 21:57:49,205 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 21:57:49,247 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:57:49,252 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@3f544041, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@47c16920 [2022-07-19 21:57:49,252 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 21:57:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 87 states have (on average 1.2413793103448276) internal successors, (108), 88 states have internal predecessors, (108), 42 states have call successors, (42), 12 states have call predecessors, (42), 12 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-07-19 21:57:49,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-19 21:57:49,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:57:49,269 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:57:49,269 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:57:49,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:57:49,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1731481966, now seen corresponding path program 1 times [2022-07-19 21:57:49,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:57:49,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726995558] [2022-07-19 21:57:49,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:57:49,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:57:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:49,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:57:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:49,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:57:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:49,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:57:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:49,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:49,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:57:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:49,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:49,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:57:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:50,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 21:57:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:50,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:57:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:50,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:57:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:50,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:57:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:50,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:57:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:50,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:57:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:50,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 21:57:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:50,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:57:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:50,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:57:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:50,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:50,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:57:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:50,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 21:57:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-07-19 21:57:50,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:57:50,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726995558] [2022-07-19 21:57:50,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726995558] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:57:50,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:57:50,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 21:57:50,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520516336] [2022-07-19 21:57:50,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:57:50,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:57:50,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:57:50,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:57:50,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:57:50,227 INFO L87 Difference]: Start difference. First operand has 143 states, 87 states have (on average 1.2413793103448276) internal successors, (108), 88 states have internal predecessors, (108), 42 states have call successors, (42), 12 states have call predecessors, (42), 12 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 21:57:50,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:57:50,616 INFO L93 Difference]: Finished difference Result 284 states and 410 transitions. [2022-07-19 21:57:50,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:57:50,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 113 [2022-07-19 21:57:50,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:57:50,630 INFO L225 Difference]: With dead ends: 284 [2022-07-19 21:57:50,630 INFO L226 Difference]: Without dead ends: 140 [2022-07-19 21:57:50,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:57:50,643 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 219 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:57:50,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 208 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:57:50,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-19 21:57:50,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2022-07-19 21:57:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 83 states have (on average 1.216867469879518) internal successors, (101), 84 states have internal predecessors, (101), 42 states have call successors, (42), 12 states have call predecessors, (42), 12 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-07-19 21:57:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 184 transitions. [2022-07-19 21:57:50,700 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 184 transitions. Word has length 113 [2022-07-19 21:57:50,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:57:50,700 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 184 transitions. [2022-07-19 21:57:50,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 21:57:50,701 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 184 transitions. [2022-07-19 21:57:50,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-19 21:57:50,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:57:50,704 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:57:50,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 21:57:50,705 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:57:50,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:57:50,706 INFO L85 PathProgramCache]: Analyzing trace with hash 57376236, now seen corresponding path program 1 times [2022-07-19 21:57:50,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:57:50,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053736407] [2022-07-19 21:57:50,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:57:50,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:57:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:50,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:57:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:50,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:57:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:50,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:57:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:50,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:50,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:57:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:51,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:51,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:57:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:51,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 21:57:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:51,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:57:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:51,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:57:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:51,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:57:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:51,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:57:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:51,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:57:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:51,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 21:57:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:51,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:57:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:51,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:57:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:51,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:51,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:57:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:51,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 21:57:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-19 21:57:51,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:57:51,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053736407] [2022-07-19 21:57:51,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053736407] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:57:51,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541245292] [2022-07-19 21:57:51,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:57:51,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:57:51,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:57:51,243 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-19 21:57:51,282 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-19 21:57:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:51,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 2776 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 21:57:51,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:57:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-19 21:57:51,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:57:51,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541245292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:57:51,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:57:51,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-07-19 21:57:51,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159291824] [2022-07-19 21:57:51,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:57:51,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:57:51,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:57:51,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:57:51,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-19 21:57:51,975 INFO L87 Difference]: Start difference. First operand 138 states and 184 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-19 21:57:52,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:57:52,212 INFO L93 Difference]: Finished difference Result 272 states and 367 transitions. [2022-07-19 21:57:52,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 21:57:52,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 113 [2022-07-19 21:57:52,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:57:52,217 INFO L225 Difference]: With dead ends: 272 [2022-07-19 21:57:52,217 INFO L226 Difference]: Without dead ends: 141 [2022-07-19 21:57:52,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:57:52,225 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 196 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 21:57:52,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 407 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 21:57:52,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-19 21:57:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-07-19 21:57:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 87 states have internal predecessors, (103), 42 states have call successors, (42), 12 states have call predecessors, (42), 13 states have return successors, (47), 41 states have call predecessors, (47), 41 states have call successors, (47) [2022-07-19 21:57:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 192 transitions. [2022-07-19 21:57:52,254 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 192 transitions. Word has length 113 [2022-07-19 21:57:52,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:57:52,255 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 192 transitions. [2022-07-19 21:57:52,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-19 21:57:52,256 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 192 transitions. [2022-07-19 21:57:52,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-19 21:57:52,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:57:52,267 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:57:52,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 21:57:52,483 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-19 21:57:52,484 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:57:52,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:57:52,484 INFO L85 PathProgramCache]: Analyzing trace with hash -590863305, now seen corresponding path program 1 times [2022-07-19 21:57:52,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:57:52,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850308105] [2022-07-19 21:57:52,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:57:52,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:57:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:57:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:57:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:57:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:57:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:57:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:57:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:57:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:57:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:57:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:57:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 21:57:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:57:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:57:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:57:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:57:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 21:57:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:52,911 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-19 21:57:52,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:57:52,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850308105] [2022-07-19 21:57:52,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850308105] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:57:52,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721533396] [2022-07-19 21:57:52,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:57:52,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:57:52,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:57:52,914 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-19 21:57:52,947 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-19 21:57:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:53,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 2793 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 21:57:53,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:57:53,607 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-19 21:57:53,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:57:53,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721533396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:57:53,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:57:53,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2022-07-19 21:57:53,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53354181] [2022-07-19 21:57:53,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:57:53,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:57:53,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:57:53,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:57:53,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-19 21:57:53,612 INFO L87 Difference]: Start difference. First operand 141 states and 192 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-19 21:57:53,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:57:53,848 INFO L93 Difference]: Finished difference Result 227 states and 311 transitions. [2022-07-19 21:57:53,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:57:53,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 119 [2022-07-19 21:57:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:57:53,850 INFO L225 Difference]: With dead ends: 227 [2022-07-19 21:57:53,850 INFO L226 Difference]: Without dead ends: 141 [2022-07-19 21:57:53,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-07-19 21:57:53,852 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 203 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 21:57:53,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 533 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 21:57:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-19 21:57:53,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-07-19 21:57:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 87 states have internal predecessors, (103), 42 states have call successors, (42), 12 states have call predecessors, (42), 13 states have return successors, (45), 41 states have call predecessors, (45), 41 states have call successors, (45) [2022-07-19 21:57:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 190 transitions. [2022-07-19 21:57:53,865 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 190 transitions. Word has length 119 [2022-07-19 21:57:53,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:57:53,866 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 190 transitions. [2022-07-19 21:57:53,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-19 21:57:53,866 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 190 transitions. [2022-07-19 21:57:53,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-19 21:57:53,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:57:53,868 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:57:53,898 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-19 21:57:54,095 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-19 21:57:54,096 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:57:54,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:57:54,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1636756019, now seen corresponding path program 2 times [2022-07-19 21:57:54,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:57:54,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358303502] [2022-07-19 21:57:54,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:57:54,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:57:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:57:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:57:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:57:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:57:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:57:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:57:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:57:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:57:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:57:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:57:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:57:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:57:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:57:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 21:57:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:57:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 21:57:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-19 21:57:54,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:57:54,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358303502] [2022-07-19 21:57:54,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358303502] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:57:54,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525284616] [2022-07-19 21:57:54,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:57:54,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:57:54,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:57:54,496 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-19 21:57:54,524 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-19 21:57:54,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 21:57:54,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:57:54,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 2326 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 21:57:54,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:57:55,039 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-07-19 21:57:55,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:57:55,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525284616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:57:55,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:57:55,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-07-19 21:57:55,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684526463] [2022-07-19 21:57:55,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:57:55,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:57:55,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:57:55,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:57:55,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:57:55,041 INFO L87 Difference]: Start difference. First operand 141 states and 190 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (20), 2 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-19 21:57:55,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:57:55,138 INFO L93 Difference]: Finished difference Result 153 states and 209 transitions. [2022-07-19 21:57:55,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:57:55,139 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (20), 2 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 131 [2022-07-19 21:57:55,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:57:55,141 INFO L225 Difference]: With dead ends: 153 [2022-07-19 21:57:55,142 INFO L226 Difference]: Without dead ends: 151 [2022-07-19 21:57:55,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-07-19 21:57:55,143 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 22 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1249 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.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:57:55,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1249 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:57:55,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-19 21:57:55,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2022-07-19 21:57:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 91 states have (on average 1.1978021978021978) internal successors, (109), 94 states have internal predecessors, (109), 43 states have call successors, (43), 13 states have call predecessors, (43), 15 states have return successors, (54), 42 states have call predecessors, (54), 42 states have call successors, (54) [2022-07-19 21:57:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 206 transitions. [2022-07-19 21:57:55,160 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 206 transitions. Word has length 131 [2022-07-19 21:57:55,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:57:55,161 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 206 transitions. [2022-07-19 21:57:55,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (20), 2 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-19 21:57:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 206 transitions. [2022-07-19 21:57:55,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-19 21:57:55,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:57:55,163 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 21:57:55,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-19 21:57:55,374 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-19 21:57:55,374 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:57:55,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:57:55,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1157375339, now seen corresponding path program 1 times [2022-07-19 21:57:55,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:57:55,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442363499] [2022-07-19 21:57:55,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:57:55,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:57:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:57:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:57:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:57:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:57:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:57:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:57:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:57:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:57:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:57:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:57:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:57:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:57:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:57:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 21:57:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:57:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 21:57:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-19 21:57:55,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:57:55,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442363499] [2022-07-19 21:57:55,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442363499] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:57:55,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348754210] [2022-07-19 21:57:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:57:55,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:57:55,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:57:55,764 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-19 21:57:55,766 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-19 21:57:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:56,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 2839 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 21:57:56,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:57:56,375 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-19 21:57:56,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:57:56,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348754210] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:57:56,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:57:56,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2022-07-19 21:57:56,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783442028] [2022-07-19 21:57:56,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:57:56,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:57:56,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:57:56,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:57:56,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:57:56,378 INFO L87 Difference]: Start difference. First operand 150 states and 206 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-19 21:57:56,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:57:56,609 INFO L93 Difference]: Finished difference Result 260 states and 358 transitions. [2022-07-19 21:57:56,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:57:56,610 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 135 [2022-07-19 21:57:56,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:57:56,612 INFO L225 Difference]: With dead ends: 260 [2022-07-19 21:57:56,612 INFO L226 Difference]: Without dead ends: 147 [2022-07-19 21:57:56,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-07-19 21:57:56,613 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 202 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 21:57:56,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 533 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 21:57:56,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-19 21:57:56,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2022-07-19 21:57:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 89 states have (on average 1.1910112359550562) internal successors, (106), 91 states have internal predecessors, (106), 43 states have call successors, (43), 13 states have call predecessors, (43), 14 states have return successors, (50), 42 states have call predecessors, (50), 42 states have call successors, (50) [2022-07-19 21:57:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 199 transitions. [2022-07-19 21:57:56,635 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 199 transitions. Word has length 135 [2022-07-19 21:57:56,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:57:56,635 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 199 transitions. [2022-07-19 21:57:56,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-19 21:57:56,636 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 199 transitions. [2022-07-19 21:57:56,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-19 21:57:56,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:57:56,638 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:57:56,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-19 21:57:56,851 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-19 21:57:56,851 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:57:56,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:57:56,852 INFO L85 PathProgramCache]: Analyzing trace with hash 707842976, now seen corresponding path program 1 times [2022-07-19 21:57:56,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:57:56,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253292939] [2022-07-19 21:57:56,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:57:56,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:57:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:57:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:57:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:57:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:57:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:57:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:57:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:57:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:57:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:57:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:57:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:57:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:57:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 21:57:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 21:57:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:57:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 21:57:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-07-19 21:57:57,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:57:57,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253292939] [2022-07-19 21:57:57,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253292939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:57:57,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:57:57,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:57:57,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341086684] [2022-07-19 21:57:57,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:57:57,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:57:57,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:57:57,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:57:57,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:57:57,493 INFO L87 Difference]: Start difference. First operand 147 states and 199 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (20), 5 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-19 21:57:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:57:58,037 INFO L93 Difference]: Finished difference Result 314 states and 443 transitions. [2022-07-19 21:57:58,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:57:58,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (20), 5 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 141 [2022-07-19 21:57:58,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:57:58,039 INFO L225 Difference]: With dead ends: 314 [2022-07-19 21:57:58,040 INFO L226 Difference]: Without dead ends: 174 [2022-07-19 21:57:58,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-19 21:57:58,041 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 242 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 21:57:58,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 309 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 21:57:58,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-19 21:57:58,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 152. [2022-07-19 21:57:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 94 states have (on average 1.202127659574468) internal successors, (113), 96 states have internal predecessors, (113), 43 states have call successors, (43), 13 states have call predecessors, (43), 14 states have return successors, (50), 42 states have call predecessors, (50), 42 states have call successors, (50) [2022-07-19 21:57:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 206 transitions. [2022-07-19 21:57:58,064 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 206 transitions. Word has length 141 [2022-07-19 21:57:58,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:57:58,065 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 206 transitions. [2022-07-19 21:57:58,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (20), 5 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-19 21:57:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 206 transitions. [2022-07-19 21:57:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-19 21:57:58,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:57:58,067 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:57:58,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 21:57:58,068 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:57:58,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:57:58,068 INFO L85 PathProgramCache]: Analyzing trace with hash 966008414, now seen corresponding path program 1 times [2022-07-19 21:57:58,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:57:58,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974593970] [2022-07-19 21:57:58,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:57:58,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:57:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:58,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:57:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:58,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:57:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:58,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:57:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:58,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:58,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:57:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:58,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:58,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:57:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:58,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:57:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:58,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:57:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:58,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:57:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:58,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:57:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:58,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:57:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:58,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:57:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:58,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:57:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:58,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 21:57:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:58,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 21:57:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:59,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:57:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:59,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:57:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:59,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 21:57:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-07-19 21:57:59,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:57:59,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974593970] [2022-07-19 21:57:59,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974593970] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:57:59,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038775347] [2022-07-19 21:57:59,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:57:59,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:57:59,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:57:59,048 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-19 21:57:59,049 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-19 21:57:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:59,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 2851 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-19 21:57:59,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:57:59,669 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-19 21:58:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-19 21:58:00,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:58:00,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038775347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:00,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:58:00,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2022-07-19 21:58:00,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618053867] [2022-07-19 21:58:00,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:00,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 21:58:00,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:00,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 21:58:00,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2022-07-19 21:58:00,019 INFO L87 Difference]: Start difference. First operand 152 states and 206 transitions. Second operand has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 10 states have internal predecessors, (65), 5 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 6 states have call predecessors, (19), 5 states have call successors, (19) [2022-07-19 21:58:00,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:00,140 INFO L93 Difference]: Finished difference Result 320 states and 429 transitions. [2022-07-19 21:58:00,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 21:58:00,141 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 10 states have internal predecessors, (65), 5 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 6 states have call predecessors, (19), 5 states have call successors, (19) Word has length 141 [2022-07-19 21:58:00,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:00,144 INFO L225 Difference]: With dead ends: 320 [2022-07-19 21:58:00,144 INFO L226 Difference]: Without dead ends: 171 [2022-07-19 21:58:00,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2022-07-19 21:58:00,146 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 25 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:00,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1156 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 65 Unchecked, 0.1s Time] [2022-07-19 21:58:00,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-19 21:58:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-19 21:58:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 112 states have (on average 1.2142857142857142) internal successors, (136), 114 states have internal predecessors, (136), 43 states have call successors, (43), 14 states have call predecessors, (43), 15 states have return successors, (50), 42 states have call predecessors, (50), 42 states have call successors, (50) [2022-07-19 21:58:00,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 229 transitions. [2022-07-19 21:58:00,171 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 229 transitions. Word has length 141 [2022-07-19 21:58:00,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:00,171 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 229 transitions. [2022-07-19 21:58:00,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 10 states have internal predecessors, (65), 5 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 6 states have call predecessors, (19), 5 states have call successors, (19) [2022-07-19 21:58:00,172 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 229 transitions. [2022-07-19 21:58:00,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-19 21:58:00,173 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:00,173 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2022-07-19 21:58:00,204 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-19 21:58:00,387 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-19 21:58:00,387 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:00,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:00,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1067385632, now seen corresponding path program 1 times [2022-07-19 21:58:00,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:00,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102399578] [2022-07-19 21:58:00,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:00,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:58:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:58:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:58:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:58:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:58:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:58:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:58:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:58:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:58:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:58:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 21:58:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 21:58:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 21:58:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-07-19 21:58:00,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:00,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102399578] [2022-07-19 21:58:00,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102399578] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:58:00,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566108437] [2022-07-19 21:58:00,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:00,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:00,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:58:00,668 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-19 21:58:00,669 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-19 21:58:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 2846 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 21:58:01,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:58:01,181 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-07-19 21:58:01,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:58:01,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566108437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:01,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:58:01,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2022-07-19 21:58:01,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084049509] [2022-07-19 21:58:01,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:01,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:58:01,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:01,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:58:01,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:58:01,183 INFO L87 Difference]: Start difference. First operand 171 states and 229 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 21:58:01,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:01,208 INFO L93 Difference]: Finished difference Result 329 states and 448 transitions. [2022-07-19 21:58:01,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:58:01,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 141 [2022-07-19 21:58:01,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:01,210 INFO L225 Difference]: With dead ends: 329 [2022-07-19 21:58:01,210 INFO L226 Difference]: Without dead ends: 180 [2022-07-19 21:58:01,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:58:01,212 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 20 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:01,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 541 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 21:58:01,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-19 21:58:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2022-07-19 21:58:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 105 states have (on average 1.2095238095238094) internal successors, (127), 106 states have internal predecessors, (127), 43 states have call successors, (43), 14 states have call predecessors, (43), 14 states have return successors, (49), 42 states have call predecessors, (49), 42 states have call successors, (49) [2022-07-19 21:58:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 219 transitions. [2022-07-19 21:58:01,227 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 219 transitions. Word has length 141 [2022-07-19 21:58:01,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:01,228 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 219 transitions. [2022-07-19 21:58:01,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 21:58:01,228 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 219 transitions. [2022-07-19 21:58:01,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-19 21:58:01,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:01,230 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-19 21:58:01,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-19 21:58:01,452 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-19 21:58:01,452 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:01,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:01,453 INFO L85 PathProgramCache]: Analyzing trace with hash -707487644, now seen corresponding path program 2 times [2022-07-19 21:58:01,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:01,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80483749] [2022-07-19 21:58:01,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:01,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:58:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:58:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:58:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 21:58:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:58:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 21:58:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 21:58:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:58:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 21:58:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 21:58:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 21:58:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 21:58:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-19 21:58:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-07-19 21:58:01,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:01,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80483749] [2022-07-19 21:58:01,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80483749] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:58:01,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952114088] [2022-07-19 21:58:01,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:58:01,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:01,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:58:01,890 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-19 21:58:01,920 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-19 21:58:02,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:58:02,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:58:02,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 2858 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-19 21:58:02,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:58:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-19 21:58:02,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:58:02,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952114088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:02,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:58:02,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 13 [2022-07-19 21:58:02,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312151173] [2022-07-19 21:58:02,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:02,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:58:02,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:02,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:58:02,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-07-19 21:58:02,985 INFO L87 Difference]: Start difference. First operand 163 states and 219 transitions. Second operand has 9 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-19 21:58:03,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:03,128 INFO L93 Difference]: Finished difference Result 317 states and 429 transitions. [2022-07-19 21:58:03,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:58:03,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 145 [2022-07-19 21:58:03,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:03,130 INFO L225 Difference]: With dead ends: 317 [2022-07-19 21:58:03,130 INFO L226 Difference]: Without dead ends: 168 [2022-07-19 21:58:03,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-19 21:58:03,132 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 12 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:03,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1353 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:58:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-19 21:58:03,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-19 21:58:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 109 states have (on average 1.201834862385321) internal successors, (131), 111 states have internal predecessors, (131), 43 states have call successors, (43), 14 states have call predecessors, (43), 15 states have return successors, (56), 42 states have call predecessors, (56), 42 states have call successors, (56) [2022-07-19 21:58:03,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 230 transitions. [2022-07-19 21:58:03,143 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 230 transitions. Word has length 145 [2022-07-19 21:58:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:03,143 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 230 transitions. [2022-07-19 21:58:03,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-19 21:58:03,144 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 230 transitions. [2022-07-19 21:58:03,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-19 21:58:03,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:03,145 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:58:03,179 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-19 21:58:03,361 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-19 21:58:03,361 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:03,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:03,362 INFO L85 PathProgramCache]: Analyzing trace with hash 434192105, now seen corresponding path program 1 times [2022-07-19 21:58:03,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:03,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410215044] [2022-07-19 21:58:03,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:03,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:58:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:58:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:58:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:58:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:58:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:58:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:58:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 21:58:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:58:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:58:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 21:58:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 21:58:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 21:58:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-07-19 21:58:03,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:03,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410215044] [2022-07-19 21:58:03,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410215044] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:58:03,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077762419] [2022-07-19 21:58:03,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:03,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:03,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:58:03,624 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-19 21:58:03,626 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-19 21:58:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 2863 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 21:58:04,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:58:04,175 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-19 21:58:04,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:58:04,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077762419] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:04,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:58:04,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2022-07-19 21:58:04,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257357930] [2022-07-19 21:58:04,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:04,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:58:04,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:04,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:58:04,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:58:04,178 INFO L87 Difference]: Start difference. First operand 168 states and 230 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 21:58:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:04,206 INFO L93 Difference]: Finished difference Result 327 states and 453 transitions. [2022-07-19 21:58:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:58:04,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2022-07-19 21:58:04,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:04,208 INFO L225 Difference]: With dead ends: 327 [2022-07-19 21:58:04,208 INFO L226 Difference]: Without dead ends: 171 [2022-07-19 21:58:04,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:58:04,210 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 9 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:04,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 534 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 21:58:04,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-19 21:58:04,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2022-07-19 21:58:04,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 109 states have (on average 1.18348623853211) internal successors, (129), 111 states have internal predecessors, (129), 43 states have call successors, (43), 14 states have call predecessors, (43), 15 states have return successors, (56), 42 states have call predecessors, (56), 42 states have call successors, (56) [2022-07-19 21:58:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 228 transitions. [2022-07-19 21:58:04,223 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 228 transitions. Word has length 147 [2022-07-19 21:58:04,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:04,223 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 228 transitions. [2022-07-19 21:58:04,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 21:58:04,223 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 228 transitions. [2022-07-19 21:58:04,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-19 21:58:04,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:04,225 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:58:04,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 21:58:04,439 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,SelfDestructingSolverStorable9 [2022-07-19 21:58:04,439 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:04,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:04,440 INFO L85 PathProgramCache]: Analyzing trace with hash -589889235, now seen corresponding path program 1 times [2022-07-19 21:58:04,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:04,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328287786] [2022-07-19 21:58:04,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:04,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:58:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:58:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:58:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:58:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:58:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:58:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:58:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 21:58:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:58:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:58:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 21:58:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 21:58:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 21:58:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-07-19 21:58:04,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:04,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328287786] [2022-07-19 21:58:04,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328287786] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:58:04,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618808149] [2022-07-19 21:58:04,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:04,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:04,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:58:04,702 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-19 21:58:04,704 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-19 21:58:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:05,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 2865 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 21:58:05,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:58:05,188 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-19 21:58:05,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:58:05,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618808149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:05,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:58:05,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2022-07-19 21:58:05,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802656968] [2022-07-19 21:58:05,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:05,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:58:05,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:05,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:58:05,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:58:05,190 INFO L87 Difference]: Start difference. First operand 168 states and 228 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 21:58:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:05,217 INFO L93 Difference]: Finished difference Result 333 states and 469 transitions. [2022-07-19 21:58:05,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:58:05,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2022-07-19 21:58:05,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:05,219 INFO L225 Difference]: With dead ends: 333 [2022-07-19 21:58:05,219 INFO L226 Difference]: Without dead ends: 177 [2022-07-19 21:58:05,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:58:05,221 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 34 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:05,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 532 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 21:58:05,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-19 21:58:05,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 164. [2022-07-19 21:58:05,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 105 states have (on average 1.161904761904762) internal successors, (122), 107 states have internal predecessors, (122), 43 states have call successors, (43), 14 states have call predecessors, (43), 15 states have return successors, (56), 42 states have call predecessors, (56), 42 states have call successors, (56) [2022-07-19 21:58:05,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 221 transitions. [2022-07-19 21:58:05,231 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 221 transitions. Word has length 147 [2022-07-19 21:58:05,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:05,231 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 221 transitions. [2022-07-19 21:58:05,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 21:58:05,231 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 221 transitions. [2022-07-19 21:58:05,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-19 21:58:05,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:05,233 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:58:05,264 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-19 21:58:05,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:05,447 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:05,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:05,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1628473809, now seen corresponding path program 1 times [2022-07-19 21:58:05,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:05,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125876540] [2022-07-19 21:58:05,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:05,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:05,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:05,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:05,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:58:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:05,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:05,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:58:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:05,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:05,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:58:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:05,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:58:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:05,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:58:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:05,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:58:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:05,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:58:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:06,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 21:58:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:06,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:58:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:06,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:58:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:06,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 21:58:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:06,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 21:58:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:06,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:06,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:06,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 21:58:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-07-19 21:58:06,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:06,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125876540] [2022-07-19 21:58:06,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125876540] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:58:06,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831118390] [2022-07-19 21:58:06,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:06,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:06,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:58:06,352 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-19 21:58:06,370 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-19 21:58:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:06,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 2860 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-19 21:58:06,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:58:06,925 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-19 21:58:07,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:07,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:07,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:07,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:07,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:07,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:07,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2022-07-19 21:58:12,658 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 45 treesize of output 21 [2022-07-19 21:58:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 74 proven. 44 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-19 21:58:12,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:58:22,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831118390] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:58:22,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 21:58:22,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 32 [2022-07-19 21:58:22,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409993515] [2022-07-19 21:58:22,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 21:58:22,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-19 21:58:22,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:22,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-19 21:58:22,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1266, Unknown=5, NotChecked=0, Total=1406 [2022-07-19 21:58:22,401 INFO L87 Difference]: Start difference. First operand 164 states and 221 transitions. Second operand has 32 states, 27 states have (on average 4.666666666666667) internal successors, (126), 27 states have internal predecessors, (126), 16 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (35), 12 states have call predecessors, (35), 16 states have call successors, (35) [2022-07-19 21:58:30,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:30,295 INFO L93 Difference]: Finished difference Result 560 states and 1017 transitions. [2022-07-19 21:58:30,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-19 21:58:30,295 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 4.666666666666667) internal successors, (126), 27 states have internal predecessors, (126), 16 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (35), 12 states have call predecessors, (35), 16 states have call successors, (35) Word has length 147 [2022-07-19 21:58:30,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:30,300 INFO L225 Difference]: With dead ends: 560 [2022-07-19 21:58:30,300 INFO L226 Difference]: Without dead ends: 474 [2022-07-19 21:58:30,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 248 SyntacticMatches, 12 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=604, Invalid=4931, Unknown=15, NotChecked=0, Total=5550 [2022-07-19 21:58:30,302 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 301 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 6027 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 7122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 6027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 623 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:30,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1367 Invalid, 7122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 6027 Invalid, 0 Unknown, 623 Unchecked, 5.3s Time] [2022-07-19 21:58:30,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-19 21:58:30,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 232. [2022-07-19 21:58:30,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 150 states have (on average 1.1466666666666667) internal successors, (172), 157 states have internal predecessors, (172), 58 states have call successors, (58), 18 states have call predecessors, (58), 23 states have return successors, (109), 56 states have call predecessors, (109), 57 states have call successors, (109) [2022-07-19 21:58:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 339 transitions. [2022-07-19 21:58:30,346 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 339 transitions. Word has length 147 [2022-07-19 21:58:30,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:30,347 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 339 transitions. [2022-07-19 21:58:30,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 4.666666666666667) internal successors, (126), 27 states have internal predecessors, (126), 16 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (35), 12 states have call predecessors, (35), 16 states have call successors, (35) [2022-07-19 21:58:30,347 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 339 transitions. [2022-07-19 21:58:30,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-19 21:58:30,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:30,349 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:58:30,378 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-19 21:58:30,569 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,SelfDestructingSolverStorable11 [2022-07-19 21:58:30,570 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:30,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash -2098702409, now seen corresponding path program 2 times [2022-07-19 21:58:30,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:30,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861258263] [2022-07-19 21:58:30,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:30,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:30,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:30,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:30,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:58:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:30,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:30,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:58:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:31,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:31,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:58:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:31,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:58:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:31,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:58:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:31,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:58:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:31,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:58:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:31,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 21:58:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:31,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:58:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:31,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:58:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:31,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 21:58:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:31,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 21:58:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:31,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:31,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:31,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-19 21:58:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 24 proven. 33 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-19 21:58:31,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:31,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861258263] [2022-07-19 21:58:31,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861258263] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:58:31,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963629159] [2022-07-19 21:58:31,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:58:31,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:31,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:58:31,413 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-19 21:58:31,415 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-19 21:58:32,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:58:32,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:58:32,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 2862 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-19 21:58:32,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:58:32,519 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-19 21:58:32,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:58:32,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963629159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:32,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:58:32,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2022-07-19 21:58:32,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199445723] [2022-07-19 21:58:32,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:32,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:58:32,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:32,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:58:32,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-07-19 21:58:32,521 INFO L87 Difference]: Start difference. First operand 232 states and 339 transitions. Second operand has 9 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-19 21:58:32,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:32,686 INFO L93 Difference]: Finished difference Result 356 states and 505 transitions. [2022-07-19 21:58:32,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:58:32,687 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 151 [2022-07-19 21:58:32,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:32,689 INFO L225 Difference]: With dead ends: 356 [2022-07-19 21:58:32,689 INFO L226 Difference]: Without dead ends: 232 [2022-07-19 21:58:32,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2022-07-19 21:58:32,690 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 12 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:32,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1358 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:58:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-19 21:58:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-07-19 21:58:32,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 150 states have (on average 1.1466666666666667) internal successors, (172), 157 states have internal predecessors, (172), 58 states have call successors, (58), 18 states have call predecessors, (58), 23 states have return successors, (103), 56 states have call predecessors, (103), 57 states have call successors, (103) [2022-07-19 21:58:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 333 transitions. [2022-07-19 21:58:32,712 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 333 transitions. Word has length 151 [2022-07-19 21:58:32,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:32,713 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 333 transitions. [2022-07-19 21:58:32,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-19 21:58:32,713 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 333 transitions. [2022-07-19 21:58:32,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-19 21:58:32,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:32,715 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 21:58:32,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-19 21:58:32,943 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,SelfDestructingSolverStorable12 [2022-07-19 21:58:32,943 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:32,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:32,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1164816066, now seen corresponding path program 1 times [2022-07-19 21:58:32,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:32,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390756779] [2022-07-19 21:58:32,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:32,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:58:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:58:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:58:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:58:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:58:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:58:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:58:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 21:58:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:58:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:58:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 21:58:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 21:58:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 21:58:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 2 proven. 52 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-07-19 21:58:33,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:33,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390756779] [2022-07-19 21:58:33,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390756779] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:58:33,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463337944] [2022-07-19 21:58:33,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:33,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:33,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:58:33,882 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-19 21:58:33,883 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-19 21:58:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:34,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 2874 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-19 21:58:34,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:58:34,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:34,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:34,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:34,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:34,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:34,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:34,850 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-19 21:58:34,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 53 [2022-07-19 21:58:35,636 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 130 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-19 21:58:35,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:58:36,251 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 28 treesize of output 16 [2022-07-19 21:58:36,356 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-19 21:58:36,356 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-19 21:58:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 10 proven. 54 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-19 21:58:36,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463337944] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:58:36,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:58:36,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15, 13] total 36 [2022-07-19 21:58:36,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666481230] [2022-07-19 21:58:36,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:58:36,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-19 21:58:36,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:36,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-19 21:58:36,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1138, Unknown=0, NotChecked=0, Total=1260 [2022-07-19 21:58:36,402 INFO L87 Difference]: Start difference. First operand 232 states and 333 transitions. Second operand has 36 states, 33 states have (on average 5.181818181818182) internal successors, (171), 33 states have internal predecessors, (171), 14 states have call successors, (46), 8 states have call predecessors, (46), 9 states have return successors, (44), 11 states have call predecessors, (44), 14 states have call successors, (44) [2022-07-19 21:58:40,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:40,467 INFO L93 Difference]: Finished difference Result 571 states and 807 transitions. [2022-07-19 21:58:40,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-19 21:58:40,468 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 5.181818181818182) internal successors, (171), 33 states have internal predecessors, (171), 14 states have call successors, (46), 8 states have call predecessors, (46), 9 states have return successors, (44), 11 states have call predecessors, (44), 14 states have call successors, (44) Word has length 153 [2022-07-19 21:58:40,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:40,471 INFO L225 Difference]: With dead ends: 571 [2022-07-19 21:58:40,471 INFO L226 Difference]: Without dead ends: 427 [2022-07-19 21:58:40,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 327 SyntacticMatches, 13 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=640, Invalid=4187, Unknown=3, NotChecked=0, Total=4830 [2022-07-19 21:58:40,474 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 319 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 3462 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 5008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 3462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1384 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:40,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1133 Invalid, 5008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 3462 Invalid, 0 Unknown, 1384 Unchecked, 2.6s Time] [2022-07-19 21:58:40,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-07-19 21:58:40,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 369. [2022-07-19 21:58:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 257 states have (on average 1.1361867704280155) internal successors, (292), 267 states have internal predecessors, (292), 78 states have call successors, (78), 25 states have call predecessors, (78), 33 states have return successors, (137), 76 states have call predecessors, (137), 77 states have call successors, (137) [2022-07-19 21:58:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 507 transitions. [2022-07-19 21:58:40,507 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 507 transitions. Word has length 153 [2022-07-19 21:58:40,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:40,508 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 507 transitions. [2022-07-19 21:58:40,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 5.181818181818182) internal successors, (171), 33 states have internal predecessors, (171), 14 states have call successors, (46), 8 states have call predecessors, (46), 9 states have return successors, (44), 11 states have call predecessors, (44), 14 states have call successors, (44) [2022-07-19 21:58:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 507 transitions. [2022-07-19 21:58:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-19 21:58:40,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:40,511 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2022-07-19 21:58:40,542 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-19 21:58:40,727 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,SelfDestructingSolverStorable13 [2022-07-19 21:58:40,727 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:40,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:40,728 INFO L85 PathProgramCache]: Analyzing trace with hash 126231492, now seen corresponding path program 1 times [2022-07-19 21:58:40,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:40,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540723726] [2022-07-19 21:58:40,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:40,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:58:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:58:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:58:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:58:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:58:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:58:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:58:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 21:58:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:58:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:58:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 21:58:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 21:58:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 21:58:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-07-19 21:58:41,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:41,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540723726] [2022-07-19 21:58:41,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540723726] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:58:41,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78369109] [2022-07-19 21:58:41,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:41,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:41,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:58:41,459 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-19 21:58:41,461 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-19 21:58:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:41,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 2879 conjuncts, 105 conjunts are in the unsatisfiable core [2022-07-19 21:58:41,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:58:42,426 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-19 21:58:42,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:42,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:42,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:42,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:42,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:42,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:58:42,444 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-19 21:58:42,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 48 [2022-07-19 21:58:43,755 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 21:58:43,755 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 29 treesize of output 13 [2022-07-19 21:58:43,767 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-19 21:58:43,770 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-19 21:58:43,977 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 55 proven. 96 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-19 21:58:43,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:58:45,752 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 64 treesize of output 52 [2022-07-19 21:58:46,034 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 23 treesize of output 15 [2022-07-19 21:58:46,241 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-19 21:58:46,241 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 19 treesize of output 18 [2022-07-19 21:58:46,333 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 18 proven. 44 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-19 21:58:46,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78369109] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:58:46,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:58:46,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 24] total 58 [2022-07-19 21:58:46,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644481698] [2022-07-19 21:58:46,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:58:46,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-07-19 21:58:46,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:46,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-07-19 21:58:46,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3096, Unknown=0, NotChecked=0, Total=3306 [2022-07-19 21:58:46,336 INFO L87 Difference]: Start difference. First operand 369 states and 507 transitions. Second operand has 58 states, 50 states have (on average 4.28) internal successors, (214), 49 states have internal predecessors, (214), 22 states have call successors, (55), 13 states have call predecessors, (55), 17 states have return successors, (53), 20 states have call predecessors, (53), 21 states have call successors, (53) [2022-07-19 21:58:52,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:52,820 INFO L93 Difference]: Finished difference Result 728 states and 987 transitions. [2022-07-19 21:58:52,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-07-19 21:58:52,821 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 50 states have (on average 4.28) internal successors, (214), 49 states have internal predecessors, (214), 22 states have call successors, (55), 13 states have call predecessors, (55), 17 states have return successors, (53), 20 states have call predecessors, (53), 21 states have call successors, (53) Word has length 153 [2022-07-19 21:58:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:52,824 INFO L225 Difference]: With dead ends: 728 [2022-07-19 21:58:52,824 INFO L226 Difference]: Without dead ends: 517 [2022-07-19 21:58:52,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 308 SyntacticMatches, 10 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3611 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1092, Invalid=12480, Unknown=0, NotChecked=0, Total=13572 [2022-07-19 21:58:52,828 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 623 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 6349 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 8572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 6349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1947 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:52,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 2759 Invalid, 8572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 6349 Invalid, 0 Unknown, 1947 Unchecked, 3.7s Time] [2022-07-19 21:58:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-07-19 21:58:52,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 468. [2022-07-19 21:58:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 331 states have (on average 1.1299093655589123) internal successors, (374), 344 states have internal predecessors, (374), 90 states have call successors, (90), 36 states have call predecessors, (90), 46 states have return successors, (149), 87 states have call predecessors, (149), 89 states have call successors, (149) [2022-07-19 21:58:52,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 613 transitions. [2022-07-19 21:58:52,867 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 613 transitions. Word has length 153 [2022-07-19 21:58:52,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:52,867 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 613 transitions. [2022-07-19 21:58:52,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 50 states have (on average 4.28) internal successors, (214), 49 states have internal predecessors, (214), 22 states have call successors, (55), 13 states have call predecessors, (55), 17 states have return successors, (53), 20 states have call predecessors, (53), 21 states have call successors, (53) [2022-07-19 21:58:52,868 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 613 transitions. [2022-07-19 21:58:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-19 21:58:52,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:52,871 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:58:52,902 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-19 21:58:53,095 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,SelfDestructingSolverStorable14 [2022-07-19 21:58:53,095 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:53,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:53,096 INFO L85 PathProgramCache]: Analyzing trace with hash -99857297, now seen corresponding path program 1 times [2022-07-19 21:58:53,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:53,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121490150] [2022-07-19 21:58:53,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:53,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:58:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:58:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:58:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:58:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:58:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:58:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:58:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:58:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 21:58:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 21:58:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 21:58:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 21:58:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 21:58:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 21:58:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-07-19 21:58:53,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:53,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121490150] [2022-07-19 21:58:53,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121490150] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:58:53,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134385128] [2022-07-19 21:58:53,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:53,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:53,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:58:53,559 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-19 21:58:53,568 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-19 21:58:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 2907 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-19 21:58:54,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:58:54,210 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-07-19 21:58:54,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:58:54,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134385128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:54,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:58:54,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 13 [2022-07-19 21:58:54,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561956519] [2022-07-19 21:58:54,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:54,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:58:54,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:54,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:58:54,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-07-19 21:58:54,214 INFO L87 Difference]: Start difference. First operand 468 states and 613 transitions. Second operand has 9 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 3 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-19 21:58:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:54,374 INFO L93 Difference]: Finished difference Result 665 states and 874 transitions. [2022-07-19 21:58:54,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:58:54,374 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 3 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2022-07-19 21:58:54,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:54,377 INFO L225 Difference]: With dead ends: 665 [2022-07-19 21:58:54,377 INFO L226 Difference]: Without dead ends: 461 [2022-07-19 21:58:54,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-19 21:58:54,379 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 12 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:54,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1365 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:58:54,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-07-19 21:58:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 456. [2022-07-19 21:58:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 325 states have (on average 1.126153846153846) internal successors, (366), 338 states have internal predecessors, (366), 84 states have call successors, (84), 36 states have call predecessors, (84), 46 states have return successors, (135), 81 states have call predecessors, (135), 83 states have call successors, (135) [2022-07-19 21:58:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 585 transitions. [2022-07-19 21:58:54,415 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 585 transitions. Word has length 158 [2022-07-19 21:58:54,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:54,416 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 585 transitions. [2022-07-19 21:58:54,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 3 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-19 21:58:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 585 transitions. [2022-07-19 21:58:54,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-19 21:58:54,419 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:54,419 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:58:54,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-19 21:58:54,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:54,631 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:54,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:54,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1285451590, now seen corresponding path program 1 times [2022-07-19 21:58:54,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:54,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812100546] [2022-07-19 21:58:54,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:54,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:58:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:54,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:58:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:58:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:58:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:58:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:58:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:58:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:58:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 21:58:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 21:58:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 21:58:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 21:58:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 21:58:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 21:58:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-19 21:58:55,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:55,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812100546] [2022-07-19 21:58:55,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812100546] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:58:55,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611868269] [2022-07-19 21:58:55,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:55,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:58:55,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:58:55,311 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-19 21:58:55,312 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-19 21:58:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:55,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 2917 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-19 21:58:55,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:58:56,168 INFO L356 Elim1Store]: treesize reduction 288, result has 17.5 percent of original size [2022-07-19 21:58:56,169 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 4 case distinctions, treesize of input 50 treesize of output 81 [2022-07-19 21:58:56,268 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 21:58:56,268 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 54 treesize of output 34 [2022-07-19 21:58:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 112 proven. 8 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-19 21:58:56,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:58:56,618 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 28 treesize of output 16 [2022-07-19 21:58:56,699 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-19 21:58:56,699 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-19 21:58:56,749 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-19 21:58:56,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611868269] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:58:56,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:58:56,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 12] total 25 [2022-07-19 21:58:56,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283562043] [2022-07-19 21:58:56,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:58:56,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-19 21:58:56,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:56,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-19 21:58:56,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-07-19 21:58:56,751 INFO L87 Difference]: Start difference. First operand 456 states and 585 transitions. Second operand has 25 states, 24 states have (on average 5.208333333333333) internal successors, (125), 22 states have internal predecessors, (125), 10 states have call successors, (41), 8 states have call predecessors, (41), 7 states have return successors, (37), 8 states have call predecessors, (37), 10 states have call successors, (37) [2022-07-19 21:58:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:58:58,339 INFO L93 Difference]: Finished difference Result 648 states and 857 transitions. [2022-07-19 21:58:58,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 21:58:58,339 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.208333333333333) internal successors, (125), 22 states have internal predecessors, (125), 10 states have call successors, (41), 8 states have call predecessors, (41), 7 states have return successors, (37), 8 states have call predecessors, (37), 10 states have call successors, (37) Word has length 156 [2022-07-19 21:58:58,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:58:58,342 INFO L225 Difference]: With dead ends: 648 [2022-07-19 21:58:58,342 INFO L226 Difference]: Without dead ends: 487 [2022-07-19 21:58:58,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 333 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=1083, Unknown=1, NotChecked=0, Total=1260 [2022-07-19 21:58:58,344 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 178 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 1896 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 2255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 281 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:58:58,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 958 Invalid, 2255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1896 Invalid, 0 Unknown, 281 Unchecked, 1.3s Time] [2022-07-19 21:58:58,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-07-19 21:58:58,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 462. [2022-07-19 21:58:58,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 328 states have (on average 1.125) internal successors, (369), 341 states have internal predecessors, (369), 87 states have call successors, (87), 36 states have call predecessors, (87), 46 states have return successors, (138), 84 states have call predecessors, (138), 86 states have call successors, (138) [2022-07-19 21:58:58,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 594 transitions. [2022-07-19 21:58:58,382 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 594 transitions. Word has length 156 [2022-07-19 21:58:58,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:58:58,382 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 594 transitions. [2022-07-19 21:58:58,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.208333333333333) internal successors, (125), 22 states have internal predecessors, (125), 10 states have call successors, (41), 8 states have call predecessors, (41), 7 states have return successors, (37), 8 states have call predecessors, (37), 10 states have call successors, (37) [2022-07-19 21:58:58,382 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 594 transitions. [2022-07-19 21:58:58,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-19 21:58:58,385 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:58:58,385 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:58:58,415 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-19 21:58:58,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-19 21:58:58,606 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:58:58,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:58:58,606 INFO L85 PathProgramCache]: Analyzing trace with hash -640668265, now seen corresponding path program 1 times [2022-07-19 21:58:58,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:58:58,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925643593] [2022-07-19 21:58:58,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:58:58,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:58:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:58:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:58:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:58:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:58:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:58:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:58:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:58:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:58:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 21:58:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:58:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 21:58:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 21:58:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:58,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 21:58:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:59,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:58:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:59,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:58:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:59,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 21:58:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:58:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-07-19 21:58:59,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:58:59,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925643593] [2022-07-19 21:58:59,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925643593] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:58:59,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:58:59,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-19 21:58:59,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760331522] [2022-07-19 21:58:59,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:58:59,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 21:58:59,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:58:59,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 21:58:59,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-07-19 21:58:59,184 INFO L87 Difference]: Start difference. First operand 462 states and 594 transitions. Second operand has 16 states, 14 states have (on average 5.071428571428571) internal successors, (71), 13 states have internal predecessors, (71), 6 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (19), 4 states have call predecessors, (19), 5 states have call successors, (19) [2022-07-19 21:59:00,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:00,461 INFO L93 Difference]: Finished difference Result 629 states and 840 transitions. [2022-07-19 21:59:00,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 21:59:00,461 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 5.071428571428571) internal successors, (71), 13 states have internal predecessors, (71), 6 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (19), 4 states have call predecessors, (19), 5 states have call successors, (19) Word has length 155 [2022-07-19 21:59:00,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:00,464 INFO L225 Difference]: With dead ends: 629 [2022-07-19 21:59:00,464 INFO L226 Difference]: Without dead ends: 510 [2022-07-19 21:59:00,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2022-07-19 21:59:00,466 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 159 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:00,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 517 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-19 21:59:00,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-07-19 21:59:00,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 487. [2022-07-19 21:59:00,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 348 states have (on average 1.117816091954023) internal successors, (389), 364 states have internal predecessors, (389), 89 states have call successors, (89), 36 states have call predecessors, (89), 49 states have return successors, (152), 86 states have call predecessors, (152), 88 states have call successors, (152) [2022-07-19 21:59:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 630 transitions. [2022-07-19 21:59:00,526 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 630 transitions. Word has length 155 [2022-07-19 21:59:00,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:00,526 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 630 transitions. [2022-07-19 21:59:00,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 5.071428571428571) internal successors, (71), 13 states have internal predecessors, (71), 6 states have call successors, (20), 5 states have call predecessors, (20), 3 states have return successors, (19), 4 states have call predecessors, (19), 5 states have call successors, (19) [2022-07-19 21:59:00,527 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 630 transitions. [2022-07-19 21:59:00,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-19 21:59:00,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:00,529 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:00,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 21:59:00,530 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:00,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:00,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1807785691, now seen corresponding path program 1 times [2022-07-19 21:59:00,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:00,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000503228] [2022-07-19 21:59:00,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:00,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:00,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:59:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:00,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:59:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:00,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:59:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:00,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:00,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:59:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:00,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:00,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:59:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:00,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:59:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:00,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:59:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:00,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:59:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:00,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:59:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:00,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 21:59:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:00,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:59:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:00,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 21:59:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:00,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 21:59:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:00,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 21:59:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:59:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 21:59:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-19 21:59:01,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:01,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000503228] [2022-07-19 21:59:01,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000503228] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:01,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031243020] [2022-07-19 21:59:01,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:01,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:01,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:01,079 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-19 21:59:01,081 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-19 21:59:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 2883 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-19 21:59:01,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:01,661 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-19 21:59:01,708 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-19 21:59:01,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:01,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:01,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:01,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:01,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:01,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:01,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 47 [2022-07-19 21:59:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 93 proven. 33 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-19 21:59:04,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:59:18,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031243020] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:18,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 21:59:18,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22] total 33 [2022-07-19 21:59:18,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884410019] [2022-07-19 21:59:18,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 21:59:18,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-19 21:59:18,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:18,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-19 21:59:18,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1641, Unknown=2, NotChecked=0, Total=1806 [2022-07-19 21:59:18,244 INFO L87 Difference]: Start difference. First operand 487 states and 630 transitions. Second operand has 33 states, 29 states have (on average 4.9655172413793105) internal successors, (144), 30 states have internal predecessors, (144), 15 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (37), 11 states have call predecessors, (37), 15 states have call successors, (37) [2022-07-19 21:59:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:25,709 INFO L93 Difference]: Finished difference Result 908 states and 1213 transitions. [2022-07-19 21:59:25,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-07-19 21:59:25,710 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 4.9655172413793105) internal successors, (144), 30 states have internal predecessors, (144), 15 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (37), 11 states have call predecessors, (37), 15 states have call successors, (37) Word has length 155 [2022-07-19 21:59:25,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:25,719 INFO L225 Difference]: With dead ends: 908 [2022-07-19 21:59:25,719 INFO L226 Difference]: Without dead ends: 639 [2022-07-19 21:59:25,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 262 SyntacticMatches, 21 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2005 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=719, Invalid=6416, Unknown=5, NotChecked=0, Total=7140 [2022-07-19 21:59:25,726 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 397 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 4249 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 5478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 4249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 999 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:25,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1806 Invalid, 5478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 4249 Invalid, 0 Unknown, 999 Unchecked, 2.7s Time] [2022-07-19 21:59:25,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-07-19 21:59:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 545. [2022-07-19 21:59:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 391 states have (on average 1.1099744245524297) internal successors, (434), 407 states have internal predecessors, (434), 101 states have call successors, (101), 39 states have call predecessors, (101), 52 states have return successors, (176), 98 states have call predecessors, (176), 100 states have call successors, (176) [2022-07-19 21:59:25,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 711 transitions. [2022-07-19 21:59:25,787 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 711 transitions. Word has length 155 [2022-07-19 21:59:25,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:25,788 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 711 transitions. [2022-07-19 21:59:25,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 4.9655172413793105) internal successors, (144), 30 states have internal predecessors, (144), 15 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (37), 11 states have call predecessors, (37), 15 states have call successors, (37) [2022-07-19 21:59:25,788 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 711 transitions. [2022-07-19 21:59:25,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-19 21:59:25,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:25,790 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:25,821 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-19 21:59:26,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:26,016 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:26,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:26,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1318685694, now seen corresponding path program 1 times [2022-07-19 21:59:26,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:26,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598008208] [2022-07-19 21:59:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:59:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:59:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:59:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:59:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:59:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:59:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:59:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:59:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:59:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 21:59:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:59:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:59:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 21:59:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 21:59:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:59:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 21:59:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-19 21:59:26,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:26,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598008208] [2022-07-19 21:59:26,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598008208] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:26,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339891329] [2022-07-19 21:59:26,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:26,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:26,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:26,707 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-19 21:59:26,708 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-19 21:59:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:27,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 2872 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-19 21:59:27,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:27,423 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-19 21:59:27,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:27,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:27,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:27,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2022-07-19 21:59:27,704 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 22 treesize of output 14 [2022-07-19 21:59:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 21:59:28,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:28,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339891329] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:28,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:28,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [19] total 28 [2022-07-19 21:59:28,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602640228] [2022-07-19 21:59:28,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:28,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 21:59:28,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:28,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 21:59:28,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2022-07-19 21:59:28,260 INFO L87 Difference]: Start difference. First operand 545 states and 711 transitions. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 7 states have call successors, (20), 4 states have call predecessors, (20), 7 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) [2022-07-19 21:59:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:29,180 INFO L93 Difference]: Finished difference Result 752 states and 977 transitions. [2022-07-19 21:59:29,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 21:59:29,180 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 7 states have call successors, (20), 4 states have call predecessors, (20), 7 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) Word has length 149 [2022-07-19 21:59:29,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:29,183 INFO L225 Difference]: With dead ends: 752 [2022-07-19 21:59:29,183 INFO L226 Difference]: Without dead ends: 515 [2022-07-19 21:59:29,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 166 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=1193, Unknown=0, NotChecked=0, Total=1332 [2022-07-19 21:59:29,185 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 82 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 568 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:29,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 881 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 877 Invalid, 0 Unknown, 568 Unchecked, 0.7s Time] [2022-07-19 21:59:29,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-07-19 21:59:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 504. [2022-07-19 21:59:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 360 states have (on average 1.1083333333333334) internal successors, (399), 374 states have internal predecessors, (399), 96 states have call successors, (96), 36 states have call predecessors, (96), 47 states have return successors, (165), 93 states have call predecessors, (165), 95 states have call successors, (165) [2022-07-19 21:59:29,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 660 transitions. [2022-07-19 21:59:29,231 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 660 transitions. Word has length 149 [2022-07-19 21:59:29,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:29,232 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 660 transitions. [2022-07-19 21:59:29,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 7 states have call successors, (20), 4 states have call predecessors, (20), 7 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) [2022-07-19 21:59:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 660 transitions. [2022-07-19 21:59:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-19 21:59:29,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:29,235 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 21:59:29,267 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-19 21:59:29,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:29,457 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:29,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:29,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1388835896, now seen corresponding path program 1 times [2022-07-19 21:59:29,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:29,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239578656] [2022-07-19 21:59:29,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:29,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:59:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:59:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:59:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:59:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:59:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:59:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:59:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:59:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:59:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 21:59:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 21:59:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 21:59:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 21:59:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 21:59:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:59:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 21:59:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2022-07-19 21:59:30,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:30,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239578656] [2022-07-19 21:59:30,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239578656] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:30,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565522920] [2022-07-19 21:59:30,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:30,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:30,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:30,433 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-19 21:59:30,434 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-19 21:59:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:31,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 2924 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-19 21:59:31,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:31,057 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-19 21:59:31,184 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-19 21:59:31,540 INFO L356 Elim1Store]: treesize reduction 157, result has 14.2 percent of original size [2022-07-19 21:59:31,540 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 3 case distinctions, treesize of input 30 treesize of output 42 [2022-07-19 21:59:31,544 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 17 treesize of output 19 [2022-07-19 21:59:31,582 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-19 21:59:31,583 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 1 case distinctions, treesize of input 29 treesize of output 11 [2022-07-19 21:59:31,767 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 28 treesize of output 12 [2022-07-19 21:59:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 118 proven. 16 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-19 21:59:31,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:59:32,526 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 445 treesize of output 433 [2022-07-19 21:59:32,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565522920] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:32,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 21:59:32,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2022-07-19 21:59:32,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931355779] [2022-07-19 21:59:32,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 21:59:32,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-19 21:59:32,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:32,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-19 21:59:32,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1666, Unknown=0, NotChecked=0, Total=1806 [2022-07-19 21:59:32,683 INFO L87 Difference]: Start difference. First operand 504 states and 660 transitions. Second operand has 35 states, 31 states have (on average 5.0) internal successors, (155), 28 states have internal predecessors, (155), 14 states have call successors, (41), 8 states have call predecessors, (41), 11 states have return successors, (40), 13 states have call predecessors, (40), 14 states have call successors, (40) [2022-07-19 21:59:35,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:35,818 INFO L93 Difference]: Finished difference Result 718 states and 945 transitions. [2022-07-19 21:59:35,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-19 21:59:35,818 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 5.0) internal successors, (155), 28 states have internal predecessors, (155), 14 states have call successors, (41), 8 states have call predecessors, (41), 11 states have return successors, (40), 13 states have call predecessors, (40), 14 states have call successors, (40) Word has length 160 [2022-07-19 21:59:35,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:35,820 INFO L225 Difference]: With dead ends: 718 [2022-07-19 21:59:35,821 INFO L226 Difference]: Without dead ends: 538 [2022-07-19 21:59:35,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 272 SyntacticMatches, 7 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=554, Invalid=5452, Unknown=0, NotChecked=0, Total=6006 [2022-07-19 21:59:35,826 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 216 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 2886 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 3729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 2886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 656 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:35,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1120 Invalid, 3729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 2886 Invalid, 0 Unknown, 656 Unchecked, 1.8s Time] [2022-07-19 21:59:35,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-07-19 21:59:35,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 517. [2022-07-19 21:59:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 371 states have (on average 1.1078167115902966) internal successors, (411), 384 states have internal predecessors, (411), 95 states have call successors, (95), 40 states have call predecessors, (95), 50 states have return successors, (162), 92 states have call predecessors, (162), 94 states have call successors, (162) [2022-07-19 21:59:35,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 668 transitions. [2022-07-19 21:59:35,889 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 668 transitions. Word has length 160 [2022-07-19 21:59:35,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:35,889 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 668 transitions. [2022-07-19 21:59:35,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 5.0) internal successors, (155), 28 states have internal predecessors, (155), 14 states have call successors, (41), 8 states have call predecessors, (41), 11 states have return successors, (40), 13 states have call predecessors, (40), 14 states have call successors, (40) [2022-07-19 21:59:35,890 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 668 transitions. [2022-07-19 21:59:35,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-19 21:59:35,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:35,892 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:35,921 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-19 21:59:36,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:36,115 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:36,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:36,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1970898036, now seen corresponding path program 1 times [2022-07-19 21:59:36,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:36,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504230730] [2022-07-19 21:59:36,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:36,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:36,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:59:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:36,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:59:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:36,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:59:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:36,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:36,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:59:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:36,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:36,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:59:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:36,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:59:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:36,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:59:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:36,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:59:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 21:59:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 21:59:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 21:59:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-19 21:59:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 21:59:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 21:59:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:59:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 21:59:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-07-19 21:59:37,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:37,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504230730] [2022-07-19 21:59:37,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504230730] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:37,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458929283] [2022-07-19 21:59:37,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:37,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:37,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:37,564 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-19 21:59:37,597 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-19 21:59:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:38,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 2914 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-19 21:59:38,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:38,178 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-19 21:59:38,589 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-19 21:59:38,628 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-19 21:59:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 122 proven. 4 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-19 21:59:38,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:59:38,931 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3193 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_eq_ignore_case_harness_~#rhs~0#1.base| v_ArrVal_3193) |c_ULTIMATE.start_aws_byte_buf_eq_ignore_case_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_buf_eq_ignore_case_harness_~#lhs~0#1.offset|) 18446744073709551616) 0)) is different from false [2022-07-19 21:59:38,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458929283] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:38,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 21:59:38,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 12] total 36 [2022-07-19 21:59:38,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402536068] [2022-07-19 21:59:38,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 21:59:38,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-19 21:59:38,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:38,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-19 21:59:38,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1309, Unknown=1, NotChecked=72, Total=1482 [2022-07-19 21:59:38,938 INFO L87 Difference]: Start difference. First operand 517 states and 668 transitions. Second operand has 36 states, 32 states have (on average 4.21875) internal successors, (135), 30 states have internal predecessors, (135), 16 states have call successors, (41), 6 states have call predecessors, (41), 10 states have return successors, (40), 15 states have call predecessors, (40), 16 states have call successors, (40) [2022-07-19 21:59:45,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:45,440 INFO L93 Difference]: Finished difference Result 921 states and 1320 transitions. [2022-07-19 21:59:45,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-19 21:59:45,442 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 4.21875) internal successors, (135), 30 states have internal predecessors, (135), 16 states have call successors, (41), 6 states have call predecessors, (41), 10 states have return successors, (40), 15 states have call predecessors, (40), 16 states have call successors, (40) Word has length 160 [2022-07-19 21:59:45,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:45,446 INFO L225 Difference]: With dead ends: 921 [2022-07-19 21:59:45,446 INFO L226 Difference]: Without dead ends: 736 [2022-07-19 21:59:45,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 281 SyntacticMatches, 9 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=507, Invalid=4608, Unknown=1, NotChecked=140, Total=5256 [2022-07-19 21:59:45,449 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 529 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 6440 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 7443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 6440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 421 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:45,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1242 Invalid, 7443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 6440 Invalid, 0 Unknown, 421 Unchecked, 4.7s Time] [2022-07-19 21:59:45,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2022-07-19 21:59:45,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 598. [2022-07-19 21:59:45,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 439 states have (on average 1.111617312072893) internal successors, (488), 455 states have internal predecessors, (488), 103 states have call successors, (103), 42 states have call predecessors, (103), 55 states have return successors, (178), 100 states have call predecessors, (178), 102 states have call successors, (178) [2022-07-19 21:59:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 769 transitions. [2022-07-19 21:59:45,511 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 769 transitions. Word has length 160 [2022-07-19 21:59:45,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:45,512 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 769 transitions. [2022-07-19 21:59:45,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 4.21875) internal successors, (135), 30 states have internal predecessors, (135), 16 states have call successors, (41), 6 states have call predecessors, (41), 10 states have return successors, (40), 15 states have call predecessors, (40), 16 states have call successors, (40) [2022-07-19 21:59:45,512 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 769 transitions. [2022-07-19 21:59:45,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-19 21:59:45,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:45,514 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:45,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-19 21:59:45,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:45,739 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:45,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:45,740 INFO L85 PathProgramCache]: Analyzing trace with hash -405128884, now seen corresponding path program 1 times [2022-07-19 21:59:45,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:45,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698400121] [2022-07-19 21:59:45,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:45,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:46,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:59:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:46,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:59:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:46,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:59:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:46,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:46,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:59:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:46,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:46,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:59:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:46,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:59:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:46,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:59:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:46,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:59:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:46,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:46,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 21:59:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:46,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:46,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 21:59:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:46,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 21:59:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:46,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 21:59:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:46,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 21:59:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:46,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-19 21:59:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:59:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-19 21:59:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-19 21:59:47,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:47,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698400121] [2022-07-19 21:59:47,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698400121] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:47,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698510143] [2022-07-19 21:59:47,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:47,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:47,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:47,135 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-19 21:59:47,136 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-19 21:59:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 2967 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-19 21:59:47,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:47,693 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 21:59:47,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-19 21:59:48,002 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 21:59:48,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 21:59:48,270 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-07-19 21:59:48,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 30 [2022-07-19 21:59:48,389 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-19 21:59:48,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-07-19 21:59:48,581 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-19 21:59:48,583 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-19 21:59:48,599 WARN L855 $PredicateComparison]: unable to prove that (and (or (not (= |c_save_byte_from_array_#in~array#1.base| 0)) (not (= |c_save_byte_from_array_#in~array#1.offset| 0))) (exists ((v_ArrVal_3442 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_3442) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3443 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_3443) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-19 21:59:48,609 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 28 treesize of output 30 [2022-07-19 21:59:48,613 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 28 treesize of output 30 [2022-07-19 22:00:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 138 proven. 55 refuted. 0 times theorem prover too weak. 29 trivial. 2 not checked. [2022-07-19 22:00:07,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:00:07,969 WARN L833 $PredicateComparison]: unable to prove that (or (and (= |c_ULTIMATE.start_aws_byte_buf_eq_ignore_case_harness_#t~mem1229#1.base| 0) (= |c_ULTIMATE.start_aws_byte_buf_eq_ignore_case_harness_#t~mem1229#1.offset| 0)) (forall ((v_ArrVal_3450 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_eq_ignore_case_harness_~#old_byte_from_rhs~0#1.base| v_ArrVal_3450) |c_ULTIMATE.start_aws_byte_buf_eq_ignore_case_harness_~#rhs~0#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_eq_ignore_case_harness_~#rhs~0#1.offset|)) 0))) (forall ((v_ArrVal_3451 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_eq_ignore_case_harness_~#old_byte_from_rhs~0#1.base| v_ArrVal_3451) |c_ULTIMATE.start_aws_byte_buf_eq_ignore_case_harness_~#rhs~0#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_buf_eq_ignore_case_harness_~#rhs~0#1.offset|)) 0)))) is different from false [2022-07-19 22:00:07,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698510143] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:00:07,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:00:07,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 42 [2022-07-19 22:00:07,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598795208] [2022-07-19 22:00:07,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:00:07,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-19 22:00:07,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:00:07,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-19 22:00:07,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2014, Unknown=6, NotChecked=182, Total=2352 [2022-07-19 22:00:07,973 INFO L87 Difference]: Start difference. First operand 598 states and 769 transitions. Second operand has 42 states, 37 states have (on average 4.405405405405405) internal successors, (163), 34 states have internal predecessors, (163), 16 states have call successors, (40), 9 states have call predecessors, (40), 12 states have return successors, (39), 17 states have call predecessors, (39), 16 states have call successors, (39) [2022-07-19 22:00:33,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:00:33,883 INFO L93 Difference]: Finished difference Result 885 states and 1203 transitions. [2022-07-19 22:00:33,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-07-19 22:00:33,884 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 37 states have (on average 4.405405405405405) internal successors, (163), 34 states have internal predecessors, (163), 16 states have call successors, (40), 9 states have call predecessors, (40), 12 states have return successors, (39), 17 states have call predecessors, (39), 16 states have call successors, (39) Word has length 163 [2022-07-19 22:00:33,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:00:33,887 INFO L225 Difference]: With dead ends: 885 [2022-07-19 22:00:33,887 INFO L226 Difference]: Without dead ends: 722 [2022-07-19 22:00:33,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 256 SyntacticMatches, 17 SemanticMatches, 94 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2215 ImplicationChecksByTransitivity, 42.1s TimeCoverageRelationStatistics Valid=655, Invalid=8069, Unknown=26, NotChecked=370, Total=9120 [2022-07-19 22:00:33,889 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 306 mSDsluCounter, 2157 mSDsCounter, 0 mSdLazyCounter, 6021 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 2380 SdHoareTripleChecker+Invalid, 9052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 6021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2706 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-19 22:00:33,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 2380 Invalid, 9052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 6021 Invalid, 0 Unknown, 2706 Unchecked, 3.7s Time] [2022-07-19 22:00:33,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2022-07-19 22:00:33,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 636. [2022-07-19 22:00:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 465 states have (on average 1.1096774193548387) internal successors, (516), 481 states have internal predecessors, (516), 110 states have call successors, (110), 46 states have call predecessors, (110), 60 states have return successors, (188), 108 states have call predecessors, (188), 109 states have call successors, (188) [2022-07-19 22:00:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 814 transitions. [2022-07-19 22:00:33,953 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 814 transitions. Word has length 163 [2022-07-19 22:00:33,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:00:33,954 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 814 transitions. [2022-07-19 22:00:33,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 37 states have (on average 4.405405405405405) internal successors, (163), 34 states have internal predecessors, (163), 16 states have call successors, (40), 9 states have call predecessors, (40), 12 states have return successors, (39), 17 states have call predecessors, (39), 16 states have call successors, (39) [2022-07-19 22:00:33,954 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 814 transitions. [2022-07-19 22:00:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-19 22:00:33,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:00:33,956 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2022-07-19 22:00:33,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-19 22:00:34,171 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,SelfDestructingSolverStorable22 [2022-07-19 22:00:34,171 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:00:34,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:00:34,172 INFO L85 PathProgramCache]: Analyzing trace with hash 706910291, now seen corresponding path program 2 times [2022-07-19 22:00:34,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:00:34,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049348098] [2022-07-19 22:00:34,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:00:34,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:00:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:34,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:00:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:34,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:00:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:34,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:00:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:34,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:34,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:00:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:34,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:34,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:00:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:34,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:00:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:34,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 22:00:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:35,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:00:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:35,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 22:00:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:35,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 22:00:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:35,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 22:00:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:35,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:00:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:35,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:00:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:35,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 22:00:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:35,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:35,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:00:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:35,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 22:00:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2022-07-19 22:00:35,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:00:35,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049348098] [2022-07-19 22:00:35,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049348098] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:00:35,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363639354] [2022-07-19 22:00:35,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 22:00:35,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:00:35,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:00:35,179 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-19 22:00:35,181 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-19 22:00:35,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 22:00:35,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:00:35,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 2881 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-19 22:00:35,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:00:35,845 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-19 22:00:35,910 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-19 22:00:36,202 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-19 22:00:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 123 proven. 14 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 22:00:37,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:00:38,249 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 10 treesize of output 4 [2022-07-19 22:00:38,284 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3598 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_buf_eq_ignore_case_harness_~#rhs~0#1.base| v_ArrVal_3598) |c_ULTIMATE.start_aws_byte_buf_eq_ignore_case_harness_~#lhs~0#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_eq_ignore_case_harness_~#lhs~0#1.offset| 8)) 0)) is different from false [2022-07-19 22:00:38,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363639354] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:00:38,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:00:38,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 39 [2022-07-19 22:00:38,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34819074] [2022-07-19 22:00:38,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:00:38,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-19 22:00:38,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:00:38,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-19 22:00:38,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2452, Unknown=1, NotChecked=100, Total=2756 [2022-07-19 22:00:38,291 INFO L87 Difference]: Start difference. First operand 636 states and 814 transitions. Second operand has 39 states, 35 states have (on average 4.371428571428571) internal successors, (153), 33 states have internal predecessors, (153), 14 states have call successors, (35), 8 states have call predecessors, (35), 12 states have return successors, (34), 13 states have call predecessors, (34), 14 states have call successors, (34) [2022-07-19 22:00:39,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:00:39,715 INFO L93 Difference]: Finished difference Result 824 states and 1043 transitions. [2022-07-19 22:00:39,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-19 22:00:39,715 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 4.371428571428571) internal successors, (153), 33 states have internal predecessors, (153), 14 states have call successors, (35), 8 states have call predecessors, (35), 12 states have return successors, (34), 13 states have call predecessors, (34), 14 states have call successors, (34) Word has length 155 [2022-07-19 22:00:39,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:00:39,718 INFO L225 Difference]: With dead ends: 824 [2022-07-19 22:00:39,718 INFO L226 Difference]: Without dead ends: 641 [2022-07-19 22:00:39,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 238 SyntacticMatches, 15 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1442 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=368, Invalid=4327, Unknown=1, NotChecked=134, Total=4830 [2022-07-19 22:00:39,720 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 316 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 2187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 22:00:39,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 930 Invalid, 2187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1639 Invalid, 0 Unknown, 277 Unchecked, 0.9s Time] [2022-07-19 22:00:39,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-07-19 22:00:39,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 632. [2022-07-19 22:00:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 461 states have (on average 1.1084598698481563) internal successors, (511), 477 states have internal predecessors, (511), 110 states have call successors, (110), 46 states have call predecessors, (110), 60 states have return successors, (188), 108 states have call predecessors, (188), 109 states have call successors, (188) [2022-07-19 22:00:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 809 transitions. [2022-07-19 22:00:39,783 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 809 transitions. Word has length 155 [2022-07-19 22:00:39,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:00:39,783 INFO L495 AbstractCegarLoop]: Abstraction has 632 states and 809 transitions. [2022-07-19 22:00:39,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 4.371428571428571) internal successors, (153), 33 states have internal predecessors, (153), 14 states have call successors, (35), 8 states have call predecessors, (35), 12 states have return successors, (34), 13 states have call predecessors, (34), 14 states have call successors, (34) [2022-07-19 22:00:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 809 transitions. [2022-07-19 22:00:39,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-19 22:00:39,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:00:39,786 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:00:39,815 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-19 22:00:40,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-19 22:00:40,009 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:00:40,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:00:40,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1385796688, now seen corresponding path program 1 times [2022-07-19 22:00:40,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:00:40,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191686184] [2022-07-19 22:00:40,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:00:40,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:00:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:00:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:00:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:00:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:00:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:00:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:00:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 22:00:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:00:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:00:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 22:00:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:00:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:00:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:00:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:00:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 22:00:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:00:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 22:00:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-19 22:00:40,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:00:40,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191686184] [2022-07-19 22:00:40,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191686184] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:00:40,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336791800] [2022-07-19 22:00:40,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:00:40,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:00:40,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:00:40,884 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-19 22:00:40,887 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-19 22:00:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:41,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 2922 conjuncts, 124 conjunts are in the unsatisfiable core [2022-07-19 22:00:41,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:00:41,511 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 22:00:41,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-19 22:00:41,793 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:00:41,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:00:42,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:00:42,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:00:42,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:00:42,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:00:42,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:00:42,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:00:42,399 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-19 22:00:42,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 48 [2022-07-19 22:00:42,471 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 22:00:42,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 15 [2022-07-19 22:00:42,618 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-19 22:00:42,630 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_3803 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_3803)))) is different from true [2022-07-19 22:00:42,639 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 17 treesize of output 19 [2022-07-19 22:00:43,681 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 18 treesize of output 10 [2022-07-19 22:00:43,685 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-19 22:00:43,689 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-19 22:00:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 51 proven. 116 refuted. 0 times theorem prover too weak. 20 trivial. 2 not checked. [2022-07-19 22:00:43,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:00:45,918 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 64 treesize of output 52 [2022-07-19 22:00:45,920 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 52 treesize of output 40 [2022-07-19 22:00:46,013 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3807 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_eq_ignore_case_harness_~#old_byte_from_lhs~0#1.base| v_ArrVal_3807) |c_ULTIMATE.start_aws_byte_buf_eq_ignore_case_harness_~#rhs~0#1.base|) |c_ULTIMATE.start_aws_byte_buf_eq_ignore_case_harness_~#rhs~0#1.offset|) 18446744073709551616) 0))) (<= 0 |c_#StackHeapBarrier|)) is different from false [2022-07-19 22:00:46,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336791800] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:00:46,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:00:46,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 31] total 54 [2022-07-19 22:00:46,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993594249] [2022-07-19 22:00:46,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:00:46,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-19 22:00:46,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:00:46,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-19 22:00:46,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4062, Unknown=3, NotChecked=258, Total=4556 [2022-07-19 22:00:46,016 INFO L87 Difference]: Start difference. First operand 632 states and 809 transitions. Second operand has 54 states, 47 states have (on average 3.5106382978723403) internal successors, (165), 46 states have internal predecessors, (165), 20 states have call successors, (41), 12 states have call predecessors, (41), 18 states have return successors, (40), 20 states have call predecessors, (40), 20 states have call successors, (40) [2022-07-19 22:00:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:00:52,705 INFO L93 Difference]: Finished difference Result 825 states and 1075 transitions. [2022-07-19 22:00:52,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-07-19 22:00:52,706 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 47 states have (on average 3.5106382978723403) internal successors, (165), 46 states have internal predecessors, (165), 20 states have call successors, (41), 12 states have call predecessors, (41), 18 states have return successors, (40), 20 states have call predecessors, (40), 20 states have call successors, (40) Word has length 156 [2022-07-19 22:00:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:00:52,709 INFO L225 Difference]: With dead ends: 825 [2022-07-19 22:00:52,709 INFO L226 Difference]: Without dead ends: 684 [2022-07-19 22:00:52,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 234 SyntacticMatches, 14 SemanticMatches, 125 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4430 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1086, Invalid=14396, Unknown=26, NotChecked=494, Total=16002 [2022-07-19 22:00:52,712 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 573 mSDsluCounter, 2167 mSDsCounter, 0 mSdLazyCounter, 5978 mSolverCounterSat, 561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 8512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 561 IncrementalHoareTripleChecker+Valid, 5978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1973 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:00:52,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 2381 Invalid, 8512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [561 Valid, 5978 Invalid, 0 Unknown, 1973 Unchecked, 3.8s Time] [2022-07-19 22:00:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-07-19 22:00:52,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 618. [2022-07-19 22:00:52,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 455 states have (on average 1.1076923076923078) internal successors, (504), 470 states have internal predecessors, (504), 102 states have call successors, (102), 47 states have call predecessors, (102), 60 states have return successors, (168), 100 states have call predecessors, (168), 101 states have call successors, (168) [2022-07-19 22:00:52,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 774 transitions. [2022-07-19 22:00:52,770 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 774 transitions. Word has length 156 [2022-07-19 22:00:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:00:52,770 INFO L495 AbstractCegarLoop]: Abstraction has 618 states and 774 transitions. [2022-07-19 22:00:52,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 47 states have (on average 3.5106382978723403) internal successors, (165), 46 states have internal predecessors, (165), 20 states have call successors, (41), 12 states have call predecessors, (41), 18 states have return successors, (40), 20 states have call predecessors, (40), 20 states have call successors, (40) [2022-07-19 22:00:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 774 transitions. [2022-07-19 22:00:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-19 22:00:52,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:00:52,773 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:00:52,803 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-19 22:00:52,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:00:52,995 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:00:52,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:00:52,996 INFO L85 PathProgramCache]: Analyzing trace with hash -427180276, now seen corresponding path program 1 times [2022-07-19 22:00:52,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:00:52,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433497077] [2022-07-19 22:00:52,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:00:52,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:00:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:00:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:00:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:00:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:00:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:00:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:00:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 22:00:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:00:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:00:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 22:00:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:00:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 22:00:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:00:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:00:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-19 22:00:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-19 22:00:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:00:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 22:00:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2022-07-19 22:00:53,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:00:53,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433497077] [2022-07-19 22:00:53,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433497077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:00:53,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:00:53,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-19 22:00:53,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081610724] [2022-07-19 22:00:53,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:00:53,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-19 22:00:53,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:00:53,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-19 22:00:53,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2022-07-19 22:00:53,751 INFO L87 Difference]: Start difference. First operand 618 states and 774 transitions. Second operand has 21 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 10 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-19 22:00:55,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:00:55,089 INFO L93 Difference]: Finished difference Result 777 states and 1013 transitions. [2022-07-19 22:00:55,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 22:00:55,090 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 10 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) Word has length 167 [2022-07-19 22:00:55,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:00:55,092 INFO L225 Difference]: With dead ends: 777 [2022-07-19 22:00:55,092 INFO L226 Difference]: Without dead ends: 645 [2022-07-19 22:00:55,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2022-07-19 22:00:55,093 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 295 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:00:55,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 341 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-19 22:00:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-07-19 22:00:55,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 623. [2022-07-19 22:00:55,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 457 states have (on average 1.1072210065645514) internal successors, (506), 473 states have internal predecessors, (506), 104 states have call successors, (104), 47 states have call predecessors, (104), 61 states have return successors, (172), 102 states have call predecessors, (172), 103 states have call successors, (172) [2022-07-19 22:00:55,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 782 transitions. [2022-07-19 22:00:55,153 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 782 transitions. Word has length 167 [2022-07-19 22:00:55,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:00:55,153 INFO L495 AbstractCegarLoop]: Abstraction has 623 states and 782 transitions. [2022-07-19 22:00:55,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 10 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-19 22:00:55,153 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 782 transitions. [2022-07-19 22:00:55,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-19 22:00:55,155 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:00:55,155 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:00:55,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 22:00:55,156 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:00:55,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:00:55,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1242549668, now seen corresponding path program 1 times [2022-07-19 22:00:55,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:00:55,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902781704] [2022-07-19 22:00:55,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:00:55,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:00:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:00:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:00:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:00:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:00:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:00:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:00:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 22:00:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:00:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 22:00:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 22:00:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:00:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:00:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 22:00:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-19 22:00:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:00:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:00:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 22:00:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:56,454 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 28 proven. 45 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-07-19 22:00:56,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:00:56,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902781704] [2022-07-19 22:00:56,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902781704] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:00:56,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280226113] [2022-07-19 22:00:56,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:00:56,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:00:56,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:00:56,456 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:00:56,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-19 22:00:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:57,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 2890 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-19 22:00:57,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:00:57,097 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-19 22:00:57,189 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-19 22:00:57,217 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 22 treesize of output 25 [2022-07-19 22:00:57,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:00:57,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 25 [2022-07-19 22:00:58,164 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~a#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~b#1.base_BEFORE_CALL_47| Int)) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~b#1.base_BEFORE_CALL_47|) 16) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~a#1.base_BEFORE_CALL_34|) 16)) (not (= |v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~b#1.base_BEFORE_CALL_47| |v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~a#1.base_BEFORE_CALL_34|)))) is different from true [2022-07-19 22:00:59,118 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~a#1.base_BEFORE_CALL_35| Int) (|v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~b#1.base_BEFORE_CALL_48| Int)) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~b#1.base_BEFORE_CALL_48|) 16) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~a#1.base_BEFORE_CALL_35|) 16)) (not (= |v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~b#1.base_BEFORE_CALL_48| |v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~a#1.base_BEFORE_CALL_35|)))) is different from true [2022-07-19 22:01:00,034 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~a#1.base_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~b#1.base_BEFORE_CALL_49| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~b#1.base_BEFORE_CALL_49| |v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~a#1.base_BEFORE_CALL_36|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~b#1.base_BEFORE_CALL_49|) 16) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~a#1.base_BEFORE_CALL_36|) 16)))) is different from true [2022-07-19 22:01:08,437 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~a#1.base_BEFORE_CALL_37| Int) (|ULTIMATE.start_aws_byte_buf_eq_ignore_case_~b#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_aws_byte_buf_eq_ignore_case_~b#1.base|) 16))) (and (not (= |ULTIMATE.start_aws_byte_buf_eq_ignore_case_~b#1.base| |v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~a#1.base_BEFORE_CALL_37|)) (= .cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~a#1.base_BEFORE_CALL_37|) 16)) (not (= (mod .cse0 18446744073709551616) 0))))) is different from true [2022-07-19 22:01:09,684 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~a#1.base_BEFORE_CALL_38| Int) (|ULTIMATE.start_aws_byte_buf_eq_ignore_case_~b#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_aws_byte_buf_eq_ignore_case_~b#1.base|) 16))) (and (not (= |ULTIMATE.start_aws_byte_buf_eq_ignore_case_~b#1.base| |v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~a#1.base_BEFORE_CALL_38|)) (not (= (mod .cse0 18446744073709551616) 0)) (= .cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~a#1.base_BEFORE_CALL_38|) 16))))) is different from true [2022-07-19 22:01:11,045 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~a#1.base_BEFORE_CALL_39| Int) (|ULTIMATE.start_aws_byte_buf_eq_ignore_case_~b#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_aws_byte_buf_eq_ignore_case_~b#1.base|) 16))) (and (= .cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~a#1.base_BEFORE_CALL_39|) 16)) (not (= (mod .cse0 18446744073709551616) 0)) (not (= |ULTIMATE.start_aws_byte_buf_eq_ignore_case_~b#1.base| |v_ULTIMATE.start_aws_byte_buf_eq_ignore_case_~a#1.base_BEFORE_CALL_39|))))) is different from true [2022-07-19 22:01:14,345 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 98 proven. 13 refuted. 0 times theorem prover too weak. 23 trivial. 53 not checked. [2022-07-19 22:01:14,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:01:32,612 INFO L356 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-07-19 22:01:32,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 30 treesize of output 37 [2022-07-19 22:01:32,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280226113] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:01:32,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:01:32,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 36 [2022-07-19 22:01:32,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908013474] [2022-07-19 22:01:32,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:01:32,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-19 22:01:32,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:01:32,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-19 22:01:32,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1482, Unknown=17, NotChecked=498, Total=2162 [2022-07-19 22:01:32,691 INFO L87 Difference]: Start difference. First operand 623 states and 782 transitions. Second operand has 36 states, 35 states have (on average 4.514285714285714) internal successors, (158), 31 states have internal predecessors, (158), 13 states have call successors, (38), 12 states have call predecessors, (38), 10 states have return successors, (37), 12 states have call predecessors, (37), 12 states have call successors, (37)