./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_copy_from_cursor_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_init_copy_from_cursor_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 4de10993869e21f48bb81ae95b5cdb54403a1e14d61aac1da11f58576220ef55 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 21:58:56,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:58:56,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:58:56,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:58:56,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:58:56,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:58:56,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:58:56,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:58:56,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:58:56,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:58:56,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:58:56,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:58:56,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:58:56,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:58:56,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:58:56,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:58:56,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:58:56,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:58:56,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:58:56,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:58:56,103 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:58:56,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:58:56,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:58:56,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:58:56,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:58:56,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:58:56,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:58:56,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:58:56,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:58:56,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:58:56,113 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:58:56,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:58:56,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:58:56,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:58:56,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:58:56,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:58:56,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:58:56,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:58:56,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:58:56,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:58:56,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:58:56,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:58:56,133 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:58:56,167 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:58:56,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:58:56,168 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:58:56,168 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:58:56,169 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:58:56,169 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:58:56,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:58:56,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:58:56,169 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:58:56,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:58:56,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 21:58:56,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:58:56,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:58:56,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:58:56,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:58:56,171 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:58:56,171 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:58:56,171 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:58:56,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:58:56,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:58:56,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:58:56,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:58:56,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:58:56,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:58:56,173 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:58:56,173 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 21:58:56,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 21:58:56,174 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:58:56,174 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:58:56,174 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:58:56,174 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 -> 4de10993869e21f48bb81ae95b5cdb54403a1e14d61aac1da11f58576220ef55 [2022-07-19 21:58:56,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:58:56,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:58:56,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:58:56,389 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:58:56,390 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:58:56,391 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_init_copy_from_cursor_harness.i [2022-07-19 21:58:56,440 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb07b72b7/d2cc3808e40d4db483283f96b22d54ee/FLAG7a42a00a9 [2022-07-19 21:58:56,956 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:58:56,957 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_copy_from_cursor_harness.i [2022-07-19 21:58:56,985 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb07b72b7/d2cc3808e40d4db483283f96b22d54ee/FLAG7a42a00a9 [2022-07-19 21:58:57,433 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb07b72b7/d2cc3808e40d4db483283f96b22d54ee [2022-07-19 21:58:57,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:58:57,436 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:58:57,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:58:57,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:58:57,443 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:58:57,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:58:57" (1/1) ... [2022-07-19 21:58:57,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b1956aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:57, skipping insertion in model container [2022-07-19 21:58:57,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:58:57" (1/1) ... [2022-07-19 21:58:57,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:58:57,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:58:57,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_init_copy_from_cursor_harness.i[4508,4521] [2022-07-19 21:58:57,692 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_init_copy_from_cursor_harness.i[4568,4581] [2022-07-19 21:58:58,158 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,159 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,159 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,160 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,160 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,167 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,167 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,168 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,169 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,373 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 21:58:58,375 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 21:58:58,375 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 21:58:58,376 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 21:58:58,377 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 21:58:58,379 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 21:58:58,380 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 21:58:58,381 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 21:58:58,382 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 21:58:58,382 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 21:58:58,486 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 21:58:58,576 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,577 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:58:58,707 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 21:58:58,724 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_init_copy_from_cursor_harness.i[4508,4521] [2022-07-19 21:58:58,726 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_init_copy_from_cursor_harness.i[4568,4581] [2022-07-19 21:58:58,753 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,754 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,755 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,755 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,755 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,761 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,762 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,763 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,763 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,785 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 21:58:58,785 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 21:58:58,786 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 21:58:58,787 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 21:58:58,789 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 21:58:58,790 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 21:58:58,790 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 21:58:58,790 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 21:58:58,791 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 21:58:58,796 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 21:58:58,808 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 21:58:58,850 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,850 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:58:58,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:58:59,080 INFO L208 MainTranslator]: Completed translation [2022-07-19 21:58:59,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:59 WrapperNode [2022-07-19 21:58:59,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 21:58:59,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 21:58:59,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 21:58:59,082 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 21:58:59,086 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:58:59" (1/1) ... [2022-07-19 21:58:59,171 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:58:59" (1/1) ... [2022-07-19 21:58:59,232 INFO L137 Inliner]: procedures = 691, calls = 2614, calls flagged for inlining = 61, calls inlined = 8, statements flattened = 897 [2022-07-19 21:58:59,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 21:58:59,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 21:58:59,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 21:58:59,234 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 21:58:59,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:59" (1/1) ... [2022-07-19 21:58:59,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:59" (1/1) ... [2022-07-19 21:58:59,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:59" (1/1) ... [2022-07-19 21:58:59,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:59" (1/1) ... [2022-07-19 21:58:59,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:59" (1/1) ... [2022-07-19 21:58:59,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:59" (1/1) ... [2022-07-19 21:58:59,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:59" (1/1) ... [2022-07-19 21:58:59,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 21:58:59,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 21:58:59,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 21:58:59,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 21:58:59,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:59" (1/1) ... [2022-07-19 21:58:59,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:58:59,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:58:59,387 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:58:59,422 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:58:59,451 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-19 21:58:59,451 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-19 21:58:59,451 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-19 21:58:59,451 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-19 21:58:59,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 21:58:59,452 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-19 21:58:59,452 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-19 21:58:59,452 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-07-19 21:58:59,452 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-07-19 21:58:59,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 21:58:59,453 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-19 21:58:59,453 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-19 21:58:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 21:58:59,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 21:58:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 21:58:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 21:58:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 21:58:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2022-07-19 21:58:59,455 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2022-07-19 21:58:59,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 21:58:59,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 21:58:59,455 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-19 21:58:59,455 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-19 21:58:59,455 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-07-19 21:58:59,455 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-07-19 21:58:59,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-19 21:58:59,456 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-19 21:58:59,456 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 21:58:59,456 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 21:58:59,457 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2022-07-19 21:58:59,457 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2022-07-19 21:58:59,457 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-07-19 21:58:59,457 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-07-19 21:58:59,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 21:58:59,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 21:58:59,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 21:58:59,457 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-19 21:58:59,458 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-19 21:58:59,458 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-19 21:58:59,458 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-19 21:58:59,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 21:58:59,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 21:58:59,686 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 21:58:59,688 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 21:59:00,476 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 21:59:00,484 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 21:59:00,484 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-19 21:59:00,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:59:00 BoogieIcfgContainer [2022-07-19 21:59:00,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 21:59:00,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 21:59:00,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 21:59:00,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 21:59:00,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:58:57" (1/3) ... [2022-07-19 21:59:00,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182f65f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:59:00, skipping insertion in model container [2022-07-19 21:59:00,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:59" (2/3) ... [2022-07-19 21:59:00,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182f65f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:59:00, skipping insertion in model container [2022-07-19 21:59:00,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:59:00" (3/3) ... [2022-07-19 21:59:00,493 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_init_copy_from_cursor_harness.i [2022-07-19 21:59:00,502 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 21:59:00,502 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 21:59:00,554 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:59:00,563 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@26bbf59a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@40fef160 [2022-07-19 21:59:00,564 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 21:59:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 117 states have (on average 1.264957264957265) internal successors, (148), 117 states have internal predecessors, (148), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-07-19 21:59:00,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-19 21:59:00,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:00,578 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,578 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:00,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:00,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1193477456, now seen corresponding path program 1 times [2022-07-19 21:59:00,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:00,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400629341] [2022-07-19 21:59:00,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:00,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 21:59:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 21:59:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:59:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 21:59:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:59:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 21:59:01,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:01,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400629341] [2022-07-19 21:59:01,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400629341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:01,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:01,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 21:59:01,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135728644] [2022-07-19 21:59:01,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:01,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 21:59:01,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:01,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 21:59:01,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 21:59:01,152 INFO L87 Difference]: Start difference. First operand has 171 states, 117 states have (on average 1.264957264957265) internal successors, (148), 117 states have internal predecessors, (148), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 21:59:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:01,206 INFO L93 Difference]: Finished difference Result 338 states and 472 transitions. [2022-07-19 21:59:01,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 21:59:01,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2022-07-19 21:59:01,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:01,217 INFO L225 Difference]: With dead ends: 338 [2022-07-19 21:59:01,217 INFO L226 Difference]: Without dead ends: 164 [2022-07-19 21:59:01,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 21:59:01,223 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:01,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 21:59:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-19 21:59:01,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-07-19 21:59:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 110 states have internal predecessors, (132), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-07-19 21:59:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 209 transitions. [2022-07-19 21:59:01,285 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 209 transitions. Word has length 61 [2022-07-19 21:59:01,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:01,285 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 209 transitions. [2022-07-19 21:59:01,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 21:59:01,286 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 209 transitions. [2022-07-19 21:59:01,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-19 21:59:01,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:01,288 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-19 21:59:01,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 21:59:01,290 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:01,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:01,290 INFO L85 PathProgramCache]: Analyzing trace with hash -148092610, now seen corresponding path program 1 times [2022-07-19 21:59:01,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:01,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804921026] [2022-07-19 21:59:01,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:01,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 21:59:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 21:59:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:59:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 21:59:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:59:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 21:59:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 21:59:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-19 21:59:01,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:01,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804921026] [2022-07-19 21:59:01,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804921026] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:01,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668144343] [2022-07-19 21:59:01,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:01,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:01,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:01,610 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:59:01,667 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:59:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:02,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 2518 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 21:59:02,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:02,099 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-19 21:59:02,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:02,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668144343] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:02,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:02,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-07-19 21:59:02,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192928835] [2022-07-19 21:59:02,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:02,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:59:02,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:02,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:59:02,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:59:02,102 INFO L87 Difference]: Start difference. First operand 164 states and 209 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 21:59:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:02,138 INFO L93 Difference]: Finished difference Result 229 states and 291 transitions. [2022-07-19 21:59:02,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 21:59:02,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 68 [2022-07-19 21:59:02,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:02,140 INFO L225 Difference]: With dead ends: 229 [2022-07-19 21:59:02,140 INFO L226 Difference]: Without dead ends: 162 [2022-07-19 21:59:02,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:59:02,142 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 1 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:02,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1024 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 21:59:02,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-19 21:59:02,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-07-19 21:59:02,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 109 states have internal predecessors, (129), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-19 21:59:02,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 204 transitions. [2022-07-19 21:59:02,181 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 204 transitions. Word has length 68 [2022-07-19 21:59:02,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:02,182 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 204 transitions. [2022-07-19 21:59:02,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 21:59:02,183 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 204 transitions. [2022-07-19 21:59:02,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-19 21:59:02,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:02,184 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:02,207 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:59:02,405 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:59:02,405 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:02,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:02,406 INFO L85 PathProgramCache]: Analyzing trace with hash 844833533, now seen corresponding path program 1 times [2022-07-19 21:59:02,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:02,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901387751] [2022-07-19 21:59:02,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:02,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:02,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:02,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:02,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:02,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 21:59:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:02,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 21:59:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:02,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:59:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:02,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 21:59:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:02,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:59:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:02,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:59:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:02,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 21:59:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-19 21:59:02,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:02,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901387751] [2022-07-19 21:59:02,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901387751] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:02,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756435775] [2022-07-19 21:59:02,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:02,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:02,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:02,640 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:59:02,642 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:59:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 2598 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 21:59:03,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-19 21:59:03,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:03,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756435775] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:03,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:03,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2022-07-19 21:59:03,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682590586] [2022-07-19 21:59:03,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:03,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:59:03,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:03,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:59:03,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:59:03,115 INFO L87 Difference]: Start difference. First operand 162 states and 204 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 21:59:03,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:03,261 INFO L93 Difference]: Finished difference Result 232 states and 293 transitions. [2022-07-19 21:59:03,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:59:03,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 74 [2022-07-19 21:59:03,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:03,263 INFO L225 Difference]: With dead ends: 232 [2022-07-19 21:59:03,263 INFO L226 Difference]: Without dead ends: 162 [2022-07-19 21:59:03,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:59:03,265 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 248 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:03,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 605 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:59:03,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-19 21:59:03,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-07-19 21:59:03,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 109 states have internal predecessors, (128), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-19 21:59:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 203 transitions. [2022-07-19 21:59:03,275 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 203 transitions. Word has length 74 [2022-07-19 21:59:03,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:03,275 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 203 transitions. [2022-07-19 21:59:03,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 21:59:03,276 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 203 transitions. [2022-07-19 21:59:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-19 21:59:03,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:03,277 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:03,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-19 21:59:03,497 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:59:03,497 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:03,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:03,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1064456392, now seen corresponding path program 1 times [2022-07-19 21:59:03,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:03,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324118726] [2022-07-19 21:59:03,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:03,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 21:59:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 21:59:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:59:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 21:59:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 21:59:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:59:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 21:59:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-19 21:59:03,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:03,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324118726] [2022-07-19 21:59:03,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324118726] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:03,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000971268] [2022-07-19 21:59:03,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:03,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:03,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:03,796 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:59:03,837 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:59:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 2615 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 21:59:04,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:04,285 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 21:59:04,285 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:04,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000971268] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:04,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:04,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-07-19 21:59:04,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281707833] [2022-07-19 21:59:04,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:04,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:59:04,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:04,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:59:04,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:59:04,287 INFO L87 Difference]: Start difference. First operand 162 states and 203 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 21:59:04,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:04,448 INFO L93 Difference]: Finished difference Result 315 states and 394 transitions. [2022-07-19 21:59:04,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 21:59:04,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 80 [2022-07-19 21:59:04,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:04,451 INFO L225 Difference]: With dead ends: 315 [2022-07-19 21:59:04,451 INFO L226 Difference]: Without dead ends: 165 [2022-07-19 21:59:04,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-19 21:59:04,452 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 225 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:04,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 626 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:59:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-19 21:59:04,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-07-19 21:59:04,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 110 states have (on average 1.1818181818181819) internal successors, (130), 112 states have internal predecessors, (130), 38 states have call successors, (38), 15 states have call predecessors, (38), 16 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2022-07-19 21:59:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 206 transitions. [2022-07-19 21:59:04,475 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 206 transitions. Word has length 80 [2022-07-19 21:59:04,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:04,475 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 206 transitions. [2022-07-19 21:59:04,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 21:59:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 206 transitions. [2022-07-19 21:59:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-19 21:59:04,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:04,476 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:04,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 21:59:04,676 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:59:04,677 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:04,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:04,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1640139853, now seen corresponding path program 1 times [2022-07-19 21:59:04,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:04,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657230650] [2022-07-19 21:59:04,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:04,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 21:59:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 21:59:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-19 21:59:04,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:04,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657230650] [2022-07-19 21:59:04,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657230650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:04,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:04,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:59:04,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102532610] [2022-07-19 21:59:04,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:04,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:59:04,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:04,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:59:04,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:59:04,872 INFO L87 Difference]: Start difference. First operand 165 states and 206 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 21:59:05,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:05,233 INFO L93 Difference]: Finished difference Result 321 states and 394 transitions. [2022-07-19 21:59:05,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 21:59:05,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 82 [2022-07-19 21:59:05,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:05,235 INFO L225 Difference]: With dead ends: 321 [2022-07-19 21:59:05,235 INFO L226 Difference]: Without dead ends: 172 [2022-07-19 21:59:05,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:59:05,236 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 119 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:05,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 330 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:59:05,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-19 21:59:05,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2022-07-19 21:59:05,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 108 states have (on average 1.1759259259259258) internal successors, (127), 109 states have internal predecessors, (127), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-19 21:59:05,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 202 transitions. [2022-07-19 21:59:05,245 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 202 transitions. Word has length 82 [2022-07-19 21:59:05,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:05,245 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 202 transitions. [2022-07-19 21:59:05,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 21:59:05,245 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 202 transitions. [2022-07-19 21:59:05,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 21:59:05,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:05,246 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:05,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 21:59:05,247 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:05,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:05,247 INFO L85 PathProgramCache]: Analyzing trace with hash -495240856, now seen corresponding path program 1 times [2022-07-19 21:59:05,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:05,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256118448] [2022-07-19 21:59:05,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:05,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:05,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:05,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:05,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:05,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:05,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:05,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:05,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:05,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:05,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:05,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 21:59:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:05,418 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 21:59:05,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:05,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256118448] [2022-07-19 21:59:05,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256118448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:05,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:05,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:59:05,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659275244] [2022-07-19 21:59:05,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:05,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:59:05,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:05,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:59:05,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:59:05,420 INFO L87 Difference]: Start difference. First operand 162 states and 202 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 21:59:05,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:05,816 INFO L93 Difference]: Finished difference Result 290 states and 370 transitions. [2022-07-19 21:59:05,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 21:59:05,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 84 [2022-07-19 21:59:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:05,819 INFO L225 Difference]: With dead ends: 290 [2022-07-19 21:59:05,819 INFO L226 Difference]: Without dead ends: 203 [2022-07-19 21:59:05,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:59:05,821 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 103 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:05,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 392 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 21:59:05,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-19 21:59:05,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 164. [2022-07-19 21:59:05,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 110 states have (on average 1.1727272727272726) internal successors, (129), 111 states have internal predecessors, (129), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-19 21:59:05,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 204 transitions. [2022-07-19 21:59:05,835 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 204 transitions. Word has length 84 [2022-07-19 21:59:05,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:05,835 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 204 transitions. [2022-07-19 21:59:05,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 21:59:05,835 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2022-07-19 21:59:05,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 21:59:05,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:05,837 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:05,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 21:59:05,837 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:05,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:05,838 INFO L85 PathProgramCache]: Analyzing trace with hash 2110782698, now seen corresponding path program 1 times [2022-07-19 21:59:05,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:05,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092513504] [2022-07-19 21:59:05,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:05,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 21:59:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,129 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 21:59:06,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:06,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092513504] [2022-07-19 21:59:06,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092513504] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:06,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:06,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 21:59:06,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181551128] [2022-07-19 21:59:06,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:06,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:59:06,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:06,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:59:06,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:59:06,132 INFO L87 Difference]: Start difference. First operand 164 states and 204 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 21:59:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:06,728 INFO L93 Difference]: Finished difference Result 186 states and 229 transitions. [2022-07-19 21:59:06,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:59:06,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 84 [2022-07-19 21:59:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:06,731 INFO L225 Difference]: With dead ends: 186 [2022-07-19 21:59:06,731 INFO L226 Difference]: Without dead ends: 184 [2022-07-19 21:59:06,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:59:06,732 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 112 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:06,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 671 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 21:59:06,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-19 21:59:06,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 173. [2022-07-19 21:59:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 116 states have (on average 1.1637931034482758) internal successors, (135), 118 states have internal predecessors, (135), 39 states have call successors, (39), 16 states have call predecessors, (39), 17 states have return successors, (40), 38 states have call predecessors, (40), 38 states have call successors, (40) [2022-07-19 21:59:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 214 transitions. [2022-07-19 21:59:06,740 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 214 transitions. Word has length 84 [2022-07-19 21:59:06,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:06,741 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 214 transitions. [2022-07-19 21:59:06,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 21:59:06,741 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 214 transitions. [2022-07-19 21:59:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-19 21:59:06,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:06,742 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:06,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 21:59:06,742 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:06,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1398941774, now seen corresponding path program 1 times [2022-07-19 21:59:06,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:06,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915196274] [2022-07-19 21:59:06,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:06,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 21:59:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 21:59:06,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:06,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915196274] [2022-07-19 21:59:06,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915196274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:06,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:06,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 21:59:06,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773456337] [2022-07-19 21:59:06,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:06,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:59:06,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:06,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:59:06,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:59:06,975 INFO L87 Difference]: Start difference. First operand 173 states and 214 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 21:59:07,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:07,276 INFO L93 Difference]: Finished difference Result 330 states and 403 transitions. [2022-07-19 21:59:07,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:59:07,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2022-07-19 21:59:07,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:07,278 INFO L225 Difference]: With dead ends: 330 [2022-07-19 21:59:07,278 INFO L226 Difference]: Without dead ends: 181 [2022-07-19 21:59:07,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:59:07,279 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 88 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:07,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 362 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:59:07,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-19 21:59:07,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 174. [2022-07-19 21:59:07,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 117 states have (on average 1.1623931623931625) internal successors, (136), 119 states have internal predecessors, (136), 39 states have call successors, (39), 16 states have call predecessors, (39), 17 states have return successors, (40), 38 states have call predecessors, (40), 38 states have call successors, (40) [2022-07-19 21:59:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 215 transitions. [2022-07-19 21:59:07,286 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 215 transitions. Word has length 88 [2022-07-19 21:59:07,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:07,287 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 215 transitions. [2022-07-19 21:59:07,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 21:59:07,287 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 215 transitions. [2022-07-19 21:59:07,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-19 21:59:07,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:07,288 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:07,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 21:59:07,288 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:07,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:07,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1930196412, now seen corresponding path program 1 times [2022-07-19 21:59:07,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:07,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699891384] [2022-07-19 21:59:07,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:07,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:59:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 21:59:07,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:07,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699891384] [2022-07-19 21:59:07,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699891384] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:07,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046663203] [2022-07-19 21:59:07,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:07,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:07,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:07,521 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:59:07,560 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:59:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:07,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 2651 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 21:59:07,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 21:59:08,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:08,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046663203] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:08,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:08,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-07-19 21:59:08,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777654138] [2022-07-19 21:59:08,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:08,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:59:08,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:08,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:59:08,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:59:08,021 INFO L87 Difference]: Start difference. First operand 174 states and 215 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 21:59:08,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:08,133 INFO L93 Difference]: Finished difference Result 263 states and 329 transitions. [2022-07-19 21:59:08,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:59:08,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 89 [2022-07-19 21:59:08,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:08,135 INFO L225 Difference]: With dead ends: 263 [2022-07-19 21:59:08,135 INFO L226 Difference]: Without dead ends: 192 [2022-07-19 21:59:08,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:59:08,135 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 40 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:08,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 722 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2022-07-19 21:59:08,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-19 21:59:08,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 179. [2022-07-19 21:59:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 122 states have (on average 1.1721311475409837) internal successors, (143), 124 states have internal predecessors, (143), 39 states have call successors, (39), 16 states have call predecessors, (39), 17 states have return successors, (40), 38 states have call predecessors, (40), 38 states have call successors, (40) [2022-07-19 21:59:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 222 transitions. [2022-07-19 21:59:08,143 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 222 transitions. Word has length 89 [2022-07-19 21:59:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:08,144 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 222 transitions. [2022-07-19 21:59:08,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 21:59:08,144 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 222 transitions. [2022-07-19 21:59:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-19 21:59:08,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:08,145 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:08,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 21:59:08,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:08,382 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:08,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:08,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2106605446, now seen corresponding path program 1 times [2022-07-19 21:59:08,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:08,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427852631] [2022-07-19 21:59:08,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:08,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:59:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 21:59:08,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:08,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427852631] [2022-07-19 21:59:08,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427852631] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:08,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494334972] [2022-07-19 21:59:08,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:08,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:08,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:08,692 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:59:08,693 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:59:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 2646 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-19 21:59:09,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:09,168 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 21:59:09,173 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 21:59:09,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:09,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:09,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:09,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:09,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:09,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:09,203 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 0 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 21:59:09,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:09,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:09,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:09,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:09,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:09,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:09,214 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 0 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 21:59:09,510 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 21:59:09,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:09,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494334972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:09,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:09,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2022-07-19 21:59:09,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282920017] [2022-07-19 21:59:09,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:09,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 21:59:09,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:09,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 21:59:09,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:59:09,514 INFO L87 Difference]: Start difference. First operand 179 states and 222 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 21:59:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:09,643 INFO L93 Difference]: Finished difference Result 289 states and 364 transitions. [2022-07-19 21:59:09,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 21:59:09,643 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 89 [2022-07-19 21:59:09,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:09,645 INFO L225 Difference]: With dead ends: 289 [2022-07-19 21:59:09,645 INFO L226 Difference]: Without dead ends: 207 [2022-07-19 21:59:09,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-07-19 21:59:09,646 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 85 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:09,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1065 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 56 Invalid, 0 Unknown, 84 Unchecked, 0.1s Time] [2022-07-19 21:59:09,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-19 21:59:09,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2022-07-19 21:59:09,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 147 states have (on average 1.2040816326530612) internal successors, (177), 150 states have internal predecessors, (177), 40 states have call successors, (40), 17 states have call predecessors, (40), 18 states have return successors, (43), 38 states have call predecessors, (43), 39 states have call successors, (43) [2022-07-19 21:59:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 260 transitions. [2022-07-19 21:59:09,654 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 260 transitions. Word has length 89 [2022-07-19 21:59:09,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:09,655 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 260 transitions. [2022-07-19 21:59:09,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 21:59:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 260 transitions. [2022-07-19 21:59:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-19 21:59:09,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:09,656 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:09,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-19 21:59:09,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-19 21:59:09,870 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:09,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash 908498172, now seen corresponding path program 1 times [2022-07-19 21:59:09,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:09,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897809470] [2022-07-19 21:59:09,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:09,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:09,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:10,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:10,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:59:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 21:59:10,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:10,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897809470] [2022-07-19 21:59:10,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897809470] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:10,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25971752] [2022-07-19 21:59:10,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:10,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:10,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:10,062 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:59:10,063 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:59:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:10,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 2641 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-19 21:59:10,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:10,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:10,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:10,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:10,578 INFO L356 Elim1Store]: treesize reduction 87, result has 23.0 percent of original size [2022-07-19 21:59:10,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 57 [2022-07-19 21:59:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 21:59:10,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:10,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25971752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:10,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:10,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2022-07-19 21:59:10,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786932293] [2022-07-19 21:59:10,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:10,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 21:59:10,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:10,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 21:59:10,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-19 21:59:10,875 INFO L87 Difference]: Start difference. First operand 206 states and 260 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 21:59:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:11,172 INFO L93 Difference]: Finished difference Result 339 states and 433 transitions. [2022-07-19 21:59:11,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:59:11,172 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 89 [2022-07-19 21:59:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:11,174 INFO L225 Difference]: With dead ends: 339 [2022-07-19 21:59:11,174 INFO L226 Difference]: Without dead ends: 245 [2022-07-19 21:59:11,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-07-19 21:59:11,175 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 87 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:11,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1200 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 170 Invalid, 0 Unknown, 181 Unchecked, 0.2s Time] [2022-07-19 21:59:11,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-07-19 21:59:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 217. [2022-07-19 21:59:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 157 states have (on average 1.2038216560509554) internal successors, (189), 160 states have internal predecessors, (189), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (45), 38 states have call predecessors, (45), 40 states have call successors, (45) [2022-07-19 21:59:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 275 transitions. [2022-07-19 21:59:11,184 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 275 transitions. Word has length 89 [2022-07-19 21:59:11,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:11,184 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 275 transitions. [2022-07-19 21:59:11,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 21:59:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 275 transitions. [2022-07-19 21:59:11,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-19 21:59:11,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:11,196 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:11,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 21:59:11,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:11,416 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:11,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:11,417 INFO L85 PathProgramCache]: Analyzing trace with hash -938015168, now seen corresponding path program 1 times [2022-07-19 21:59:11,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:11,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462665102] [2022-07-19 21:59:11,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:11,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:59:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 21:59:11,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:11,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462665102] [2022-07-19 21:59:11,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462665102] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:11,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266168732] [2022-07-19 21:59:11,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:11,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:11,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:11,625 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:59:11,636 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:59:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:12,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 2643 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-19 21:59:12,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:12,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:12,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:12,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:12,163 INFO L356 Elim1Store]: treesize reduction 87, result has 23.0 percent of original size [2022-07-19 21:59:12,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 57 [2022-07-19 21:59:12,492 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 21:59:12,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:12,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266168732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:12,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:12,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2022-07-19 21:59:12,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399377282] [2022-07-19 21:59:12,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:12,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 21:59:12,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:12,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 21:59:12,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-07-19 21:59:12,495 INFO L87 Difference]: Start difference. First operand 217 states and 275 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 21:59:12,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:12,816 INFO L93 Difference]: Finished difference Result 349 states and 448 transitions. [2022-07-19 21:59:12,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 21:59:12,816 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 89 [2022-07-19 21:59:12,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:12,817 INFO L225 Difference]: With dead ends: 349 [2022-07-19 21:59:12,817 INFO L226 Difference]: Without dead ends: 268 [2022-07-19 21:59:12,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2022-07-19 21:59:12,818 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 101 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 398 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:12,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1676 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 196 Invalid, 0 Unknown, 398 Unchecked, 0.2s Time] [2022-07-19 21:59:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-19 21:59:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 238. [2022-07-19 21:59:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 176 states have (on average 1.2102272727272727) internal successors, (213), 181 states have internal predecessors, (213), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (49), 38 states have call predecessors, (49), 40 states have call successors, (49) [2022-07-19 21:59:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 303 transitions. [2022-07-19 21:59:12,827 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 303 transitions. Word has length 89 [2022-07-19 21:59:12,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:12,828 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 303 transitions. [2022-07-19 21:59:12,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 21:59:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 303 transitions. [2022-07-19 21:59:12,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-19 21:59:12,829 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:12,829 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:12,850 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:59:13,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:13,049 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:13,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:13,049 INFO L85 PathProgramCache]: Analyzing trace with hash -679849730, now seen corresponding path program 1 times [2022-07-19 21:59:13,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:13,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133587984] [2022-07-19 21:59:13,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:13,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:13,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:13,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:13,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:13,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:13,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:13,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:13,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:13,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:13,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:13,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:59:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 21:59:13,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:13,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133587984] [2022-07-19 21:59:13,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133587984] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:13,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622997634] [2022-07-19 21:59:13,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:13,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:13,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:13,336 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:59:13,359 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:59:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:13,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 2638 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 21:59:13,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 21:59:13,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:13,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622997634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:13,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:13,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-07-19 21:59:13,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242141434] [2022-07-19 21:59:13,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:13,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:59:13,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:13,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:59:13,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:59:13,855 INFO L87 Difference]: Start difference. First operand 238 states and 303 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 21:59:13,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:13,981 INFO L93 Difference]: Finished difference Result 318 states and 404 transitions. [2022-07-19 21:59:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 21:59:13,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 89 [2022-07-19 21:59:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:13,982 INFO L225 Difference]: With dead ends: 318 [2022-07-19 21:59:13,982 INFO L226 Difference]: Without dead ends: 230 [2022-07-19 21:59:13,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:59:13,983 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 14 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:13,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 729 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 33 Unchecked, 0.1s Time] [2022-07-19 21:59:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-19 21:59:13,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-07-19 21:59:13,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 173 states have internal predecessors, (200), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (49), 38 states have call predecessors, (49), 40 states have call successors, (49) [2022-07-19 21:59:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 290 transitions. [2022-07-19 21:59:13,992 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 290 transitions. Word has length 89 [2022-07-19 21:59:13,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:13,992 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 290 transitions. [2022-07-19 21:59:13,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 21:59:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 290 transitions. [2022-07-19 21:59:13,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-19 21:59:13,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:13,993 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:14,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-19 21:59:14,213 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,SelfDestructingSolverStorable12 [2022-07-19 21:59:14,213 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:14,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:14,214 INFO L85 PathProgramCache]: Analyzing trace with hash 733091521, now seen corresponding path program 1 times [2022-07-19 21:59:14,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:14,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987480171] [2022-07-19 21:59:14,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:14,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:59:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 21:59:14,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:14,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987480171] [2022-07-19 21:59:14,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987480171] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:14,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:14,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 21:59:14,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245827859] [2022-07-19 21:59:14,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:14,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:59:14,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:14,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:59:14,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:59:14,415 INFO L87 Difference]: Start difference. First operand 230 states and 290 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 21:59:14,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:14,735 INFO L93 Difference]: Finished difference Result 330 states and 413 transitions. [2022-07-19 21:59:14,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 21:59:14,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 91 [2022-07-19 21:59:14,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:14,736 INFO L225 Difference]: With dead ends: 330 [2022-07-19 21:59:14,736 INFO L226 Difference]: Without dead ends: 241 [2022-07-19 21:59:14,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:59:14,737 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 95 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:14,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 367 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:59:14,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-19 21:59:14,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 228. [2022-07-19 21:59:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 166 states have (on average 1.1746987951807228) internal successors, (195), 171 states have internal predecessors, (195), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (49), 38 states have call predecessors, (49), 40 states have call successors, (49) [2022-07-19 21:59:14,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 285 transitions. [2022-07-19 21:59:14,746 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 285 transitions. Word has length 91 [2022-07-19 21:59:14,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:14,746 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 285 transitions. [2022-07-19 21:59:14,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 21:59:14,746 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 285 transitions. [2022-07-19 21:59:14,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-19 21:59:14,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:14,747 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:14,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 21:59:14,748 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:14,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash 55265029, now seen corresponding path program 1 times [2022-07-19 21:59:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:14,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177822926] [2022-07-19 21:59:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:14,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:59:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 21:59:14,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:14,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177822926] [2022-07-19 21:59:14,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177822926] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:14,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:14,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 21:59:14,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909234994] [2022-07-19 21:59:14,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:14,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:59:14,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:14,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:59:14,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:59:14,930 INFO L87 Difference]: Start difference. First operand 228 states and 285 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 21:59:15,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:15,223 INFO L93 Difference]: Finished difference Result 344 states and 427 transitions. [2022-07-19 21:59:15,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 21:59:15,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 91 [2022-07-19 21:59:15,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:15,225 INFO L225 Difference]: With dead ends: 344 [2022-07-19 21:59:15,225 INFO L226 Difference]: Without dead ends: 242 [2022-07-19 21:59:15,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:59:15,227 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 122 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:15,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 372 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:59:15,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-19 21:59:15,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2022-07-19 21:59:15,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 160 states have (on average 1.15625) internal successors, (185), 165 states have internal predecessors, (185), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (48), 38 states have call predecessors, (48), 40 states have call successors, (48) [2022-07-19 21:59:15,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 274 transitions. [2022-07-19 21:59:15,239 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 274 transitions. Word has length 91 [2022-07-19 21:59:15,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:15,239 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 274 transitions. [2022-07-19 21:59:15,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 21:59:15,240 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 274 transitions. [2022-07-19 21:59:15,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-19 21:59:15,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:15,241 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:15,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 21:59:15,241 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:15,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:15,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2060819845, now seen corresponding path program 1 times [2022-07-19 21:59:15,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:15,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535192195] [2022-07-19 21:59:15,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:15,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:15,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:15,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:15,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:15,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:15,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:15,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:15,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:15,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:15,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:15,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:59:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 21:59:15,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:15,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535192195] [2022-07-19 21:59:15,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535192195] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:15,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:15,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 21:59:15,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773581373] [2022-07-19 21:59:15,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:15,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 21:59:15,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:15,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 21:59:15,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:59:15,434 INFO L87 Difference]: Start difference. First operand 222 states and 274 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 21:59:15,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:15,968 INFO L93 Difference]: Finished difference Result 243 states and 299 transitions. [2022-07-19 21:59:15,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:59:15,968 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 91 [2022-07-19 21:59:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:15,970 INFO L225 Difference]: With dead ends: 243 [2022-07-19 21:59:15,970 INFO L226 Difference]: Without dead ends: 241 [2022-07-19 21:59:15,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-19 21:59:15,970 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 116 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:15,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 830 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 21:59:15,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-19 21:59:15,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 224. [2022-07-19 21:59:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 162 states have (on average 1.154320987654321) internal successors, (187), 167 states have internal predecessors, (187), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (48), 38 states have call predecessors, (48), 40 states have call successors, (48) [2022-07-19 21:59:15,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 276 transitions. [2022-07-19 21:59:15,982 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 276 transitions. Word has length 91 [2022-07-19 21:59:15,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:15,982 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 276 transitions. [2022-07-19 21:59:15,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 21:59:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 276 transitions. [2022-07-19 21:59:15,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-19 21:59:15,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:15,984 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:15,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 21:59:15,984 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:15,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:15,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1533082873, now seen corresponding path program 1 times [2022-07-19 21:59:15,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:15,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086683991] [2022-07-19 21:59:15,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:15,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:16,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:16,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:16,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:16,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:16,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:16,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:16,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:16,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:16,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:16,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 21:59:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 21:59:16,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:16,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086683991] [2022-07-19 21:59:16,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086683991] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:16,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122254767] [2022-07-19 21:59:16,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:16,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:16,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:16,260 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:59:16,303 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:59:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:16,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 2653 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-19 21:59:16,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:16,741 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:16,778 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1770 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1770) |c_#memory_int|)) is different from true [2022-07-19 21:59:16,785 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:16,812 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:16,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:16,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:16,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:16,874 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-19 21:59:16,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 93 [2022-07-19 21:59:16,880 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 11 treesize of output 9 [2022-07-19 21:59:16,896 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 0 case distinctions, treesize of input 35 treesize of output 23 [2022-07-19 21:59:16,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:16,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 17 [2022-07-19 21:59:16,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:16,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:16,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:16,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2022-07-19 21:59:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 1 not checked. [2022-07-19 21:59:17,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:59:18,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122254767] 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 [6, 16] total 20 [2022-07-19 21:59:18,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350434526] [2022-07-19 21:59:18,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 21:59:18,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 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 20 interpolants. [2022-07-19 21:59:18,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=752, Unknown=15, NotChecked=56, Total=930 [2022-07-19 21:59:18,244 INFO L87 Difference]: Start difference. First operand 224 states and 276 transitions. Second operand has 20 states, 19 states have (on average 4.894736842105263) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2022-07-19 21:59:18,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:18,982 INFO L93 Difference]: Finished difference Result 440 states and 536 transitions. [2022-07-19 21:59:18,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 21:59:18,983 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.894736842105263) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) Word has length 91 [2022-07-19 21:59:18,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:18,984 INFO L225 Difference]: With dead ends: 440 [2022-07-19 21:59:18,984 INFO L226 Difference]: Without dead ends: 235 [2022-07-19 21:59:18,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=181, Invalid=1288, Unknown=17, NotChecked=74, Total=1560 [2022-07-19 21:59:18,986 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 106 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 864 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:18,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 806 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 723 Invalid, 0 Unknown, 864 Unchecked, 0.5s Time] [2022-07-19 21:59:18,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-07-19 21:59:18,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 226. [2022-07-19 21:59:18,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 164 states have (on average 1.1524390243902438) internal successors, (189), 169 states have internal predecessors, (189), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (47), 38 states have call predecessors, (47), 40 states have call successors, (47) [2022-07-19 21:59:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 277 transitions. [2022-07-19 21:59:18,994 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 277 transitions. Word has length 91 [2022-07-19 21:59:18,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:18,995 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 277 transitions. [2022-07-19 21:59:18,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.894736842105263) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2022-07-19 21:59:18,995 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 277 transitions. [2022-07-19 21:59:18,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 21:59:18,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:18,996 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:19,020 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:59:19,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-19 21:59:19,216 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:19,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:19,217 INFO L85 PathProgramCache]: Analyzing trace with hash -151627689, now seen corresponding path program 1 times [2022-07-19 21:59:19,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:19,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195489414] [2022-07-19 21:59:19,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:19,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:19,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:19,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:19,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:19,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:19,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:19,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:19,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:19,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:19,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:19,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 21:59:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:19,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 21:59:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:19,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 21:59:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-19 21:59:19,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:19,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195489414] [2022-07-19 21:59:19,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195489414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:19,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:19,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 21:59:19,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228011387] [2022-07-19 21:59:19,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:19,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:59:19,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:19,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:59:19,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:59:19,510 INFO L87 Difference]: Start difference. First operand 226 states and 277 transitions. Second operand has 9 states, 8 states have (on average 7.375) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-19 21:59:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:19,992 INFO L93 Difference]: Finished difference Result 245 states and 300 transitions. [2022-07-19 21:59:19,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:59:19,992 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2022-07-19 21:59:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:19,994 INFO L225 Difference]: With dead ends: 245 [2022-07-19 21:59:19,994 INFO L226 Difference]: Without dead ends: 243 [2022-07-19 21:59:19,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:59:19,994 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 107 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:19,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 675 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 21:59:19,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-19 21:59:20,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 235. [2022-07-19 21:59:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 170 states have (on average 1.1470588235294117) internal successors, (195), 176 states have internal predecessors, (195), 42 states have call successors, (42), 19 states have call predecessors, (42), 22 states have return successors, (52), 39 states have call predecessors, (52), 41 states have call successors, (52) [2022-07-19 21:59:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 289 transitions. [2022-07-19 21:59:20,005 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 289 transitions. Word has length 106 [2022-07-19 21:59:20,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:20,005 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 289 transitions. [2022-07-19 21:59:20,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-19 21:59:20,006 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 289 transitions. [2022-07-19 21:59:20,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-19 21:59:20,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:20,007 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-19 21:59:20,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 21:59:20,007 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:20,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:20,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1243987805, now seen corresponding path program 1 times [2022-07-19 21:59:20,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:20,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049371219] [2022-07-19 21:59:20,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:20,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:20,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:20,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:20,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:20,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:20,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:20,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:20,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:20,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:20,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:20,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 21:59:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:20,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 21:59:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:20,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 21:59:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:20,247 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-19 21:59:20,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:20,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049371219] [2022-07-19 21:59:20,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049371219] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:20,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306442180] [2022-07-19 21:59:20,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:20,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:20,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:20,272 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:59:20,274 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:59:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:20,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 2719 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-19 21:59:20,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:20,814 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:20,817 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:21,213 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 21:59:21,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:59:21,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-07-19 21:59:21,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:21,694 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:59:21,695 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 27 treesize of output 31 [2022-07-19 21:59:21,701 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:59:21,701 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 23 treesize of output 27 [2022-07-19 21:59:21,775 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-19 21:59:21,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306442180] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:59:21,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:59:21,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 13] total 29 [2022-07-19 21:59:21,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883372484] [2022-07-19 21:59:21,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:59:21,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-19 21:59:21,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:21,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-19 21:59:21,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2022-07-19 21:59:21,776 INFO L87 Difference]: Start difference. First operand 235 states and 289 transitions. Second operand has 29 states, 29 states have (on average 5.103448275862069) internal successors, (148), 28 states have internal predecessors, (148), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (31), 7 states have call predecessors, (31), 8 states have call successors, (31) [2022-07-19 21:59:23,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:23,976 INFO L93 Difference]: Finished difference Result 531 states and 657 transitions. [2022-07-19 21:59:23,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-19 21:59:23,976 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.103448275862069) internal successors, (148), 28 states have internal predecessors, (148), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (31), 7 states have call predecessors, (31), 8 states have call successors, (31) Word has length 110 [2022-07-19 21:59:23,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:23,978 INFO L225 Difference]: With dead ends: 531 [2022-07-19 21:59:23,978 INFO L226 Difference]: Without dead ends: 314 [2022-07-19 21:59:23,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 224 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=389, Invalid=2473, Unknown=0, NotChecked=0, Total=2862 [2022-07-19 21:59:23,980 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 274 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 3303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 657 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:23,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1790 Invalid, 3303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 2505 Invalid, 0 Unknown, 657 Unchecked, 1.4s Time] [2022-07-19 21:59:23,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-07-19 21:59:23,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 266. [2022-07-19 21:59:23,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 196 states have (on average 1.1428571428571428) internal successors, (224), 203 states have internal predecessors, (224), 44 states have call successors, (44), 21 states have call predecessors, (44), 25 states have return successors, (60), 41 states have call predecessors, (60), 43 states have call successors, (60) [2022-07-19 21:59:23,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 328 transitions. [2022-07-19 21:59:23,991 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 328 transitions. Word has length 110 [2022-07-19 21:59:23,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:23,992 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 328 transitions. [2022-07-19 21:59:23,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.103448275862069) internal successors, (148), 28 states have internal predecessors, (148), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (31), 7 states have call predecessors, (31), 8 states have call successors, (31) [2022-07-19 21:59:23,992 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 328 transitions. [2022-07-19 21:59:23,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-19 21:59:23,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:23,993 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2022-07-19 21:59:24,015 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:59:24,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:24,211 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:24,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:24,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1605325207, now seen corresponding path program 1 times [2022-07-19 21:59:24,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:24,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081616437] [2022-07-19 21:59:24,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:24,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 21:59:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:59:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 21:59:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:24,516 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-19 21:59:24,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:24,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081616437] [2022-07-19 21:59:24,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081616437] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:24,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533369940] [2022-07-19 21:59:24,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:24,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:24,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:24,530 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:59:24,563 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:59:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:25,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 2733 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-19 21:59:25,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 21:59:25,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:59:25,919 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-19 21:59:25,919 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 20 treesize of output 19 [2022-07-19 21:59:26,005 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-19 21:59:26,005 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 20 treesize of output 19 [2022-07-19 21:59:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-19 21:59:26,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533369940] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:59:26,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:59:26,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 12] total 28 [2022-07-19 21:59:26,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725517107] [2022-07-19 21:59:26,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:59:26,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-19 21:59:26,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:26,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-19 21:59:26,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2022-07-19 21:59:26,063 INFO L87 Difference]: Start difference. First operand 266 states and 328 transitions. Second operand has 28 states, 28 states have (on average 5.214285714285714) internal successors, (146), 27 states have internal predecessors, (146), 7 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) [2022-07-19 21:59:28,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:28,149 INFO L93 Difference]: Finished difference Result 608 states and 762 transitions. [2022-07-19 21:59:28,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-19 21:59:28,150 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.214285714285714) internal successors, (146), 27 states have internal predecessors, (146), 7 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) Word has length 111 [2022-07-19 21:59:28,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:28,151 INFO L225 Difference]: With dead ends: 608 [2022-07-19 21:59:28,151 INFO L226 Difference]: Without dead ends: 355 [2022-07-19 21:59:28,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 229 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=337, Invalid=2014, Unknown=1, NotChecked=0, Total=2352 [2022-07-19 21:59:28,153 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 336 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 3858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1084 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:28,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1306 Invalid, 3858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 2601 Invalid, 0 Unknown, 1084 Unchecked, 1.4s Time] [2022-07-19 21:59:28,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-07-19 21:59:28,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 302. [2022-07-19 21:59:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 224 states have (on average 1.1383928571428572) internal successors, (255), 231 states have internal predecessors, (255), 48 states have call successors, (48), 25 states have call predecessors, (48), 29 states have return successors, (76), 45 states have call predecessors, (76), 47 states have call successors, (76) [2022-07-19 21:59:28,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 379 transitions. [2022-07-19 21:59:28,166 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 379 transitions. Word has length 111 [2022-07-19 21:59:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:28,167 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 379 transitions. [2022-07-19 21:59:28,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.214285714285714) internal successors, (146), 27 states have internal predecessors, (146), 7 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) [2022-07-19 21:59:28,167 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 379 transitions. [2022-07-19 21:59:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-19 21:59:28,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:28,168 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2022-07-19 21:59:28,190 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:59:28,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:28,390 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:28,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:28,390 INFO L85 PathProgramCache]: Analyzing trace with hash -565160349, now seen corresponding path program 1 times [2022-07-19 21:59:28,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:28,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409595675] [2022-07-19 21:59:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:28,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 21:59:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 21:59:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 21:59:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-19 21:59:28,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:28,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409595675] [2022-07-19 21:59:28,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409595675] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:28,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128614512] [2022-07-19 21:59:28,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:28,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:28,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:28,716 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:59:28,717 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:59:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:29,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 2754 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-19 21:59:29,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:29,274 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:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-19 21:59:29,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:59:36,427 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-19 21:59:36,427 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 69 treesize of output 53 [2022-07-19 21:59:36,448 INFO L356 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-07-19 21:59:36,449 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 39 treesize of output 45 [2022-07-19 21:59:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-19 21:59:36,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128614512] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:59:36,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:59:36,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15] total 36 [2022-07-19 21:59:36,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982250627] [2022-07-19 21:59:36,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:59:36,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-19 21:59:36,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:36,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-19 21:59:36,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2022-07-19 21:59:36,616 INFO L87 Difference]: Start difference. First operand 302 states and 379 transitions. Second operand has 36 states, 36 states have (on average 4.305555555555555) internal successors, (155), 35 states have internal predecessors, (155), 8 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (31), 7 states have call predecessors, (31), 8 states have call successors, (31) [2022-07-19 21:59:41,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:41,181 INFO L93 Difference]: Finished difference Result 696 states and 911 transitions. [2022-07-19 21:59:41,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-19 21:59:41,182 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.305555555555555) internal successors, (155), 35 states have internal predecessors, (155), 8 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (31), 7 states have call predecessors, (31), 8 states have call successors, (31) Word has length 112 [2022-07-19 21:59:41,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:41,183 INFO L225 Difference]: With dead ends: 696 [2022-07-19 21:59:41,183 INFO L226 Difference]: Without dead ends: 417 [2022-07-19 21:59:41,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=350, Invalid=3066, Unknown=6, NotChecked=0, Total=3422 [2022-07-19 21:59:41,185 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 369 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 2965 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 4425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 2965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1317 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:41,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1575 Invalid, 4425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 2965 Invalid, 0 Unknown, 1317 Unchecked, 2.1s Time] [2022-07-19 21:59:41,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-07-19 21:59:41,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 310. [2022-07-19 21:59:41,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 232 states have (on average 1.1379310344827587) internal successors, (264), 239 states have internal predecessors, (264), 48 states have call successors, (48), 25 states have call predecessors, (48), 29 states have return successors, (76), 45 states have call predecessors, (76), 47 states have call successors, (76) [2022-07-19 21:59:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 388 transitions. [2022-07-19 21:59:41,210 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 388 transitions. Word has length 112 [2022-07-19 21:59:41,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:41,211 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 388 transitions. [2022-07-19 21:59:41,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.305555555555555) internal successors, (155), 35 states have internal predecessors, (155), 8 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (31), 7 states have call predecessors, (31), 8 states have call successors, (31) [2022-07-19 21:59:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 388 transitions. [2022-07-19 21:59:41,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-19 21:59:41,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:41,212 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 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] [2022-07-19 21:59:41,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-19 21:59:41,428 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,SelfDestructingSolverStorable20 [2022-07-19 21:59:41,429 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:41,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:41,429 INFO L85 PathProgramCache]: Analyzing trace with hash 389589933, now seen corresponding path program 1 times [2022-07-19 21:59:41,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:41,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719624702] [2022-07-19 21:59:41,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:41,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:59:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 21:59:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:59:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:41,577 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-19 21:59:41,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:41,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719624702] [2022-07-19 21:59:41,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719624702] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:41,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79617298] [2022-07-19 21:59:41,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:41,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:41,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:41,586 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:59:41,588 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:59:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 2763 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 21:59:42,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-19 21:59:42,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:42,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79617298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:42,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:42,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-19 21:59:42,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012648182] [2022-07-19 21:59:42,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:42,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:59:42,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:42,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:59:42,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:59:42,072 INFO L87 Difference]: Start difference. First operand 310 states and 388 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-19 21:59:42,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:42,099 INFO L93 Difference]: Finished difference Result 396 states and 483 transitions. [2022-07-19 21:59:42,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:59:42,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2022-07-19 21:59:42,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:42,103 INFO L225 Difference]: With dead ends: 396 [2022-07-19 21:59:42,103 INFO L226 Difference]: Without dead ends: 280 [2022-07-19 21:59:42,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:59:42,105 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 22 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:42,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 585 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 21:59:42,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-19 21:59:42,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 276. [2022-07-19 21:59:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 205 states have (on average 1.1219512195121952) internal successors, (230), 209 states have internal predecessors, (230), 46 states have call successors, (46), 23 states have call predecessors, (46), 24 states have return successors, (61), 43 states have call predecessors, (61), 45 states have call successors, (61) [2022-07-19 21:59:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 337 transitions. [2022-07-19 21:59:42,117 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 337 transitions. Word has length 113 [2022-07-19 21:59:42,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:42,118 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 337 transitions. [2022-07-19 21:59:42,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-19 21:59:42,118 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 337 transitions. [2022-07-19 21:59:42,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-19 21:59:42,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:42,119 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:42,157 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:59:42,339 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,SelfDestructingSolverStorable21 [2022-07-19 21:59:42,340 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:42,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:42,341 INFO L85 PathProgramCache]: Analyzing trace with hash -868673934, now seen corresponding path program 1 times [2022-07-19 21:59:42,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:42,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109783416] [2022-07-19 21:59:42,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:42,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:59:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 21:59:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:59:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:42,601 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-19 21:59:42,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:42,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109783416] [2022-07-19 21:59:42,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109783416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:42,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:42,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 21:59:42,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299036059] [2022-07-19 21:59:42,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:42,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 21:59:42,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:42,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 21:59:42,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:59:42,603 INFO L87 Difference]: Start difference. First operand 276 states and 337 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-19 21:59:43,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:43,301 INFO L93 Difference]: Finished difference Result 291 states and 353 transitions. [2022-07-19 21:59:43,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:59:43,302 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2022-07-19 21:59:43,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:43,303 INFO L225 Difference]: With dead ends: 291 [2022-07-19 21:59:43,303 INFO L226 Difference]: Without dead ends: 289 [2022-07-19 21:59:43,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-19 21:59:43,303 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 113 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:43,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 833 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 21:59:43,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-19 21:59:43,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2022-07-19 21:59:43,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 205 states have (on average 1.1219512195121952) internal successors, (230), 209 states have internal predecessors, (230), 46 states have call successors, (46), 23 states have call predecessors, (46), 24 states have return successors, (61), 43 states have call predecessors, (61), 45 states have call successors, (61) [2022-07-19 21:59:43,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 337 transitions. [2022-07-19 21:59:43,321 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 337 transitions. Word has length 115 [2022-07-19 21:59:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:43,321 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 337 transitions. [2022-07-19 21:59:43,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-19 21:59:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 337 transitions. [2022-07-19 21:59:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-19 21:59:43,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:43,322 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:43,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 21:59:43,323 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:43,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:43,323 INFO L85 PathProgramCache]: Analyzing trace with hash -167609356, now seen corresponding path program 1 times [2022-07-19 21:59:43,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:43,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852982974] [2022-07-19 21:59:43,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:43,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 21:59:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 21:59:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:59:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-19 21:59:43,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:43,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852982974] [2022-07-19 21:59:43,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852982974] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:43,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092038760] [2022-07-19 21:59:43,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:43,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:43,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:43,612 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:59:43,613 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:59:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:44,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 2783 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-19 21:59:44,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-19 21:59:44,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:59:44,773 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-19 21:59:44,774 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 20 treesize of output 19 [2022-07-19 21:59:44,861 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-19 21:59:44,861 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 20 treesize of output 19 [2022-07-19 21:59:44,916 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-19 21:59:44,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092038760] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:59:44,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:59:44,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 11] total 28 [2022-07-19 21:59:44,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660111457] [2022-07-19 21:59:44,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:59:44,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-19 21:59:44,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:44,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-19 21:59:44,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2022-07-19 21:59:44,917 INFO L87 Difference]: Start difference. First operand 276 states and 337 transitions. Second operand has 28 states, 28 states have (on average 5.535714285714286) internal successors, (155), 27 states have internal predecessors, (155), 7 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) [2022-07-19 21:59:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:47,201 INFO L93 Difference]: Finished difference Result 587 states and 720 transitions. [2022-07-19 21:59:47,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-19 21:59:47,201 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.535714285714286) internal successors, (155), 27 states have internal predecessors, (155), 7 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) Word has length 115 [2022-07-19 21:59:47,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:47,203 INFO L225 Difference]: With dead ends: 587 [2022-07-19 21:59:47,203 INFO L226 Difference]: Without dead ends: 334 [2022-07-19 21:59:47,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 239 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=305, Invalid=2047, Unknown=0, NotChecked=0, Total=2352 [2022-07-19 21:59:47,204 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 378 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 2884 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 3466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 2884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 423 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:47,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1389 Invalid, 3466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 2884 Invalid, 0 Unknown, 423 Unchecked, 1.6s Time] [2022-07-19 21:59:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-07-19 21:59:47,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 262. [2022-07-19 21:59:47,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 192 states have (on average 1.125) internal successors, (216), 196 states have internal predecessors, (216), 46 states have call successors, (46), 22 states have call predecessors, (46), 23 states have return successors, (57), 43 states have call predecessors, (57), 45 states have call successors, (57) [2022-07-19 21:59:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 319 transitions. [2022-07-19 21:59:47,252 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 319 transitions. Word has length 115 [2022-07-19 21:59:47,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:47,253 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 319 transitions. [2022-07-19 21:59:47,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.535714285714286) internal successors, (155), 27 states have internal predecessors, (155), 7 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) [2022-07-19 21:59:47,253 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 319 transitions. [2022-07-19 21:59:47,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-19 21:59:47,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:47,258 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:47,294 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:59:47,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:47,495 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:47,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:47,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1981097108, now seen corresponding path program 1 times [2022-07-19 21:59:47,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:47,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261544113] [2022-07-19 21:59:47,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:47,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 21:59:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:59:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 21:59:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 21:59:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-19 21:59:47,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:47,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261544113] [2022-07-19 21:59:47,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261544113] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:47,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086246451] [2022-07-19 21:59:47,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:47,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:47,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:47,845 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:59:47,846 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:59:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:48,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 2856 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-19 21:59:48,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:48,448 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 21:59:48,452 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 21:59:48,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:48,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:48,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:48,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:48,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:48,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:48,482 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 0 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 21:59:48,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:48,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:48,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:48,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:48,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:48,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:48,490 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 0 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 21:59:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-19 21:59:48,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:48,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086246451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:48,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:48,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11] total 23 [2022-07-19 21:59:48,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659552789] [2022-07-19 21:59:48,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:48,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 21:59:48,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:48,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 21:59:48,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-07-19 21:59:48,855 INFO L87 Difference]: Start difference. First operand 262 states and 319 transitions. Second operand has 14 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 7 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-19 21:59:49,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:49,291 INFO L93 Difference]: Finished difference Result 424 states and 521 transitions. [2022-07-19 21:59:49,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 21:59:49,292 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 7 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) Word has length 122 [2022-07-19 21:59:49,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:49,293 INFO L225 Difference]: With dead ends: 424 [2022-07-19 21:59:49,293 INFO L226 Difference]: Without dead ends: 324 [2022-07-19 21:59:49,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2022-07-19 21:59:49,294 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 201 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 572 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:49,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 586 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 528 Invalid, 0 Unknown, 572 Unchecked, 0.3s Time] [2022-07-19 21:59:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-07-19 21:59:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 277. [2022-07-19 21:59:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 203 states have (on average 1.1330049261083743) internal successors, (230), 208 states have internal predecessors, (230), 48 states have call successors, (48), 23 states have call predecessors, (48), 25 states have return successors, (64), 45 states have call predecessors, (64), 47 states have call successors, (64) [2022-07-19 21:59:49,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 342 transitions. [2022-07-19 21:59:49,311 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 342 transitions. Word has length 122 [2022-07-19 21:59:49,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:49,311 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 342 transitions. [2022-07-19 21:59:49,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 7 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-19 21:59:49,312 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 342 transitions. [2022-07-19 21:59:49,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-19 21:59:49,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:49,313 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:49,336 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:59:49,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:49,527 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:49,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:49,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1034006510, now seen corresponding path program 1 times [2022-07-19 21:59:49,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:49,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93795456] [2022-07-19 21:59:49,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:49,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 21:59:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:59:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:59:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 21:59:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 21:59:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:49,876 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-19 21:59:49,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:49,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93795456] [2022-07-19 21:59:49,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93795456] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:49,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299210312] [2022-07-19 21:59:49,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:49,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:49,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:49,878 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:49,879 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:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:50,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 2851 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-19 21:59:50,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:50,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:50,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:50,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:50,523 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-19 21:59:50,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2022-07-19 21:59:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-19 21:59:50,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:50,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299210312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:50,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:50,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-19 21:59:50,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358444802] [2022-07-19 21:59:50,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:50,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:59:50,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:50,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:59:50,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-07-19 21:59:50,555 INFO L87 Difference]: Start difference. First operand 277 states and 342 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-19 21:59:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:50,783 INFO L93 Difference]: Finished difference Result 456 states and 555 transitions. [2022-07-19 21:59:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:59:50,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 122 [2022-07-19 21:59:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:50,785 INFO L225 Difference]: With dead ends: 456 [2022-07-19 21:59:50,785 INFO L226 Difference]: Without dead ends: 275 [2022-07-19 21:59:50,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-07-19 21:59:50,786 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 37 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:50,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 809 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:59:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-19 21:59:50,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 262. [2022-07-19 21:59:50,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 192 states have (on average 1.1145833333333333) internal successors, (214), 196 states have internal predecessors, (214), 46 states have call successors, (46), 22 states have call predecessors, (46), 23 states have return successors, (57), 43 states have call predecessors, (57), 45 states have call successors, (57) [2022-07-19 21:59:50,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 317 transitions. [2022-07-19 21:59:50,798 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 317 transitions. Word has length 122 [2022-07-19 21:59:50,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:50,798 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 317 transitions. [2022-07-19 21:59:50,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-19 21:59:50,798 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 317 transitions. [2022-07-19 21:59:50,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-19 21:59:50,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:50,799 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 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] [2022-07-19 21:59:50,822 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:51,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-19 21:59:51,021 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:51,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:51,021 INFO L85 PathProgramCache]: Analyzing trace with hash -105137170, now seen corresponding path program 1 times [2022-07-19 21:59:51,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:51,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525765956] [2022-07-19 21:59:51,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:51,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 21:59:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 21:59:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 21:59:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-19 21:59:51,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:51,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525765956] [2022-07-19 21:59:51,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525765956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:51,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697783181] [2022-07-19 21:59:51,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:51,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:51,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:51,302 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:51,311 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:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:51,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 2804 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-19 21:59:51,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:51,924 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 21:59:51,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:51,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:51,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:51,933 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-19 21:59:51,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2022-07-19 21:59:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-19 21:59:52,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:59:52,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697783181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:52,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:59:52,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2022-07-19 21:59:52,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118876211] [2022-07-19 21:59:52,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:52,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 21:59:52,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:52,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 21:59:52,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2022-07-19 21:59:52,289 INFO L87 Difference]: Start difference. First operand 262 states and 317 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 states have internal predecessors, (74), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-19 21:59:52,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:52,356 INFO L93 Difference]: Finished difference Result 399 states and 475 transitions. [2022-07-19 21:59:52,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 21:59:52,357 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 states have internal predecessors, (74), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 120 [2022-07-19 21:59:52,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:52,358 INFO L225 Difference]: With dead ends: 399 [2022-07-19 21:59:52,358 INFO L226 Difference]: Without dead ends: 282 [2022-07-19 21:59:52,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-07-19 21:59:52,359 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 51 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:52,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 919 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 78 Unchecked, 0.0s Time] [2022-07-19 21:59:52,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-19 21:59:52,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-07-19 21:59:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 210 states have (on average 1.1095238095238096) internal successors, (233), 214 states have internal predecessors, (233), 47 states have call successors, (47), 24 states have call predecessors, (47), 24 states have return successors, (59), 43 states have call predecessors, (59), 46 states have call successors, (59) [2022-07-19 21:59:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 339 transitions. [2022-07-19 21:59:52,371 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 339 transitions. Word has length 120 [2022-07-19 21:59:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:52,371 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 339 transitions. [2022-07-19 21:59:52,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 states have internal predecessors, (74), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-19 21:59:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 339 transitions. [2022-07-19 21:59:52,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-19 21:59:52,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:52,372 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,395 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:52,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-19 21:59:52,583 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:52,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash -105996951, now seen corresponding path program 1 times [2022-07-19 21:59:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:52,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625723897] [2022-07-19 21:59:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:52,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:52,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:52,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:52,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:52,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:52,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:52,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:52,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:52,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:52,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 21:59:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:52,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 21:59:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:52,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 21:59:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:52,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-19 21:59:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:52,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 21:59:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-19 21:59:52,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:52,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625723897] [2022-07-19 21:59:52,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625723897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:59:52,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:59:52,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 21:59:52,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429866262] [2022-07-19 21:59:52,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:59:52,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:59:52,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:52,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:59:52,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:59:52,830 INFO L87 Difference]: Start difference. First operand 282 states and 339 transitions. Second operand has 9 states, 8 states have (on average 7.5) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-19 21:59:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:53,322 INFO L93 Difference]: Finished difference Result 301 states and 361 transitions. [2022-07-19 21:59:53,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:59:53,323 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 124 [2022-07-19 21:59:53,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:53,324 INFO L225 Difference]: With dead ends: 301 [2022-07-19 21:59:53,324 INFO L226 Difference]: Without dead ends: 299 [2022-07-19 21:59:53,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:59:53,325 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 101 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:53,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 675 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 21:59:53,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-19 21:59:53,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 291. [2022-07-19 21:59:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 216 states have (on average 1.1064814814814814) internal successors, (239), 221 states have internal predecessors, (239), 48 states have call successors, (48), 25 states have call predecessors, (48), 26 states have return successors, (63), 44 states have call predecessors, (63), 47 states have call successors, (63) [2022-07-19 21:59:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 350 transitions. [2022-07-19 21:59:53,340 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 350 transitions. Word has length 124 [2022-07-19 21:59:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:53,340 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 350 transitions. [2022-07-19 21:59:53,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-19 21:59:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 350 transitions. [2022-07-19 21:59:53,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-19 21:59:53,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:53,341 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:53,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-19 21:59:53,341 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:53,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:53,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1905145871, now seen corresponding path program 1 times [2022-07-19 21:59:53,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:53,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964577333] [2022-07-19 21:59:53,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:53,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:53,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:53,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:53,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:53,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:53,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:53,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:53,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:53,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:53,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 21:59:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:53,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 21:59:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:53,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 21:59:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:53,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-19 21:59:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:53,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 21:59:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-19 21:59:53,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:53,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964577333] [2022-07-19 21:59:53,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964577333] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:53,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636555068] [2022-07-19 21:59:53,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:53,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:53,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:53,628 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:53,660 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:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:54,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 2832 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-19 21:59:54,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:54,299 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:54,520 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 21:59:54,520 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 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-19 21:59:54,525 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 7 treesize of output 5 [2022-07-19 21:59:54,637 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4371 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4371) |c_#memory_int|)) is different from true [2022-07-19 21:59:54,641 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4372 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4372) |c_#memory_int|)) is different from true [2022-07-19 21:59:54,644 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4373 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4373) |c_#memory_int|)) is different from true [2022-07-19 21:59:54,648 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4374 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4374) |c_#memory_int|)) is different from true [2022-07-19 21:59:54,652 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4375 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4375) |c_#memory_int|)) is different from true [2022-07-19 21:59:54,656 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4376 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4376) |c_#memory_int|)) is different from true [2022-07-19 21:59:54,689 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 21:59:54,690 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 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-19 21:59:54,703 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 7 treesize of output 5 [2022-07-19 21:59:54,815 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 21:59:54,816 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 1 case distinctions, treesize of input 23 treesize of output 29 [2022-07-19 21:59:54,854 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 21:59:54,854 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 1 case distinctions, treesize of input 23 treesize of output 29 [2022-07-19 21:59:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 28 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 21 not checked. [2022-07-19 21:59:55,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:59:56,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636555068] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:56,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 21:59:56,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 28] total 37 [2022-07-19 21:59:56,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128048941] [2022-07-19 21:59:56,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 21:59:56,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-19 21:59:56,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:59:56,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-19 21:59:56,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1579, Unknown=11, NotChecked=510, Total=2256 [2022-07-19 21:59:56,520 INFO L87 Difference]: Start difference. First operand 291 states and 350 transitions. Second operand has 37 states, 37 states have (on average 3.810810810810811) internal successors, (141), 36 states have internal predecessors, (141), 8 states have call successors, (29), 5 states have call predecessors, (29), 7 states have return successors, (28), 9 states have call predecessors, (28), 8 states have call successors, (28) [2022-07-19 21:59:57,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:59:57,423 INFO L93 Difference]: Finished difference Result 580 states and 695 transitions. [2022-07-19 21:59:57,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-19 21:59:57,424 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.810810810810811) internal successors, (141), 36 states have internal predecessors, (141), 8 states have call successors, (29), 5 states have call predecessors, (29), 7 states have return successors, (28), 9 states have call predecessors, (28), 8 states have call successors, (28) Word has length 128 [2022-07-19 21:59:57,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:59:57,425 INFO L225 Difference]: With dead ends: 580 [2022-07-19 21:59:57,425 INFO L226 Difference]: Without dead ends: 319 [2022-07-19 21:59:57,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 170 SyntacticMatches, 11 SemanticMatches, 59 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=227, Invalid=2744, Unknown=23, NotChecked=666, Total=3660 [2022-07-19 21:59:57,431 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 188 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 3689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2365 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 21:59:57,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1334 Invalid, 3689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1212 Invalid, 0 Unknown, 2365 Unchecked, 0.6s Time] [2022-07-19 21:59:57,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-19 21:59:57,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 305. [2022-07-19 21:59:57,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 225 states have (on average 1.1022222222222222) internal successors, (248), 231 states have internal predecessors, (248), 51 states have call successors, (51), 27 states have call predecessors, (51), 28 states have return successors, (67), 46 states have call predecessors, (67), 50 states have call successors, (67) [2022-07-19 21:59:57,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 366 transitions. [2022-07-19 21:59:57,446 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 366 transitions. Word has length 128 [2022-07-19 21:59:57,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:59:57,447 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 366 transitions. [2022-07-19 21:59:57,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.810810810810811) internal successors, (141), 36 states have internal predecessors, (141), 8 states have call successors, (29), 5 states have call predecessors, (29), 7 states have return successors, (28), 9 states have call predecessors, (28), 8 states have call successors, (28) [2022-07-19 21:59:57,447 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 366 transitions. [2022-07-19 21:59:57,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-19 21:59:57,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:59:57,449 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:59:57,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-19 21:59:57,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-19 21:59:57,669 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:59:57,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:59:57,669 INFO L85 PathProgramCache]: Analyzing trace with hash 665588731, now seen corresponding path program 2 times [2022-07-19 21:59:57,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:59:57,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32746901] [2022-07-19 21:59:57,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:59:57,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:59:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 21:59:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 21:59:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 21:59:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 21:59:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 21:59:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 21:59:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 21:59:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:59:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:57,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:59:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:58,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 21:59:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:58,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:59:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:58,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 21:59:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:58,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 21:59:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:58,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 21:59:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:59:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-19 21:59:58,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:59:58,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32746901] [2022-07-19 21:59:58,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32746901] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:59:58,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565478954] [2022-07-19 21:59:58,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:59:58,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:59:58,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:59:58,040 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:58,042 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:58,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:59:58,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:59:58,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 2851 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-19 21:59:58,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:59:58,763 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 21:59:58,764 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:59,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:59:59,237 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:59,244 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 21:59:59,244 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 11 treesize of output 11 [2022-07-19 21:59:59,498 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4684 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4684) |c_#memory_int|)) is different from true [2022-07-19 21:59:59,501 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4685 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4685) |c_#memory_int|)) is different from true [2022-07-19 21:59:59,504 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4686 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4686) |c_#memory_int|)) is different from true [2022-07-19 21:59:59,507 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4687 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4687) |c_#memory_int|)) is different from true [2022-07-19 21:59:59,510 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4688 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4688) |c_#memory_int|)) is different from true [2022-07-19 21:59:59,514 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4689 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4689) |c_#memory_int|)) is different from true [2022-07-19 21:59:59,517 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4690 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4690) |c_#memory_int|)) is different from true [2022-07-19 21:59:59,531 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 21:59:59,531 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 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-19 21:59:59,534 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 7 treesize of output 5 [2022-07-19 21:59:59,606 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 21:59:59,606 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 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-19 21:59:59,633 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 21:59:59,633 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 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-19 22:00:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 28 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 28 not checked. [2022-07-19 22:00:00,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:00:00,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565478954] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:00:00,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:00:00,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 29] total 39 [2022-07-19 22:00:00,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964057751] [2022-07-19 22:00:00,691 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:00:00,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-19 22:00:00,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:00:00,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-19 22:00:00,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1508, Unknown=11, NotChecked=588, Total=2256 [2022-07-19 22:00:00,692 INFO L87 Difference]: Start difference. First operand 305 states and 366 transitions. Second operand has 39 states, 39 states have (on average 3.769230769230769) internal successors, (147), 38 states have internal predecessors, (147), 7 states have call successors, (29), 7 states have call predecessors, (29), 9 states have return successors, (28), 8 states have call predecessors, (28), 7 states have call successors, (28) [2022-07-19 22:00:02,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:00:02,543 INFO L93 Difference]: Finished difference Result 639 states and 765 transitions. [2022-07-19 22:00:02,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-19 22:00:02,544 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.769230769230769) internal successors, (147), 38 states have internal predecessors, (147), 7 states have call successors, (29), 7 states have call predecessors, (29), 9 states have return successors, (28), 8 states have call predecessors, (28), 7 states have call successors, (28) Word has length 129 [2022-07-19 22:00:02,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:00:02,545 INFO L225 Difference]: With dead ends: 639 [2022-07-19 22:00:02,545 INFO L226 Difference]: Without dead ends: 378 [2022-07-19 22:00:02,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 173 SyntacticMatches, 16 SemanticMatches, 67 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=299, Invalid=3486, Unknown=25, NotChecked=882, Total=4692 [2022-07-19 22:00:02,547 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 184 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 2025 SdHoareTripleChecker+Invalid, 5359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3313 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:00:02,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 2025 Invalid, 5359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1985 Invalid, 0 Unknown, 3313 Unchecked, 1.1s Time] [2022-07-19 22:00:02,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-07-19 22:00:02,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 339. [2022-07-19 22:00:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 251 states have (on average 1.1075697211155378) internal successors, (278), 257 states have internal predecessors, (278), 54 states have call successors, (54), 32 states have call predecessors, (54), 33 states have return successors, (71), 49 states have call predecessors, (71), 53 states have call successors, (71) [2022-07-19 22:00:02,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 403 transitions. [2022-07-19 22:00:02,563 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 403 transitions. Word has length 129 [2022-07-19 22:00:02,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:00:02,563 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 403 transitions. [2022-07-19 22:00:02,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.769230769230769) internal successors, (147), 38 states have internal predecessors, (147), 7 states have call successors, (29), 7 states have call predecessors, (29), 9 states have return successors, (28), 8 states have call predecessors, (28), 7 states have call successors, (28) [2022-07-19 22:00:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 403 transitions. [2022-07-19 22:00:02,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-19 22:00:02,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:00:02,565 INFO L195 NwaCegarLoop]: trace histogram [8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:00:02,587 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 22:00:02,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:00:02,788 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:00:02,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:00:02,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1246017231, now seen corresponding path program 3 times [2022-07-19 22:00:02,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:00:02,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828656929] [2022-07-19 22:00:02,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:00:02,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:00:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:02,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:00:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:02,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:00:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:02,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:00:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:02,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:00:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:02,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:00:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:02,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:00:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:02,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:00:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:02,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:00:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:02,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:00:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:03,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 22:00:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:03,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:00:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:03,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:00:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:03,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:00:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:03,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 22:00:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-19 22:00:03,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:00:03,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828656929] [2022-07-19 22:00:03,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828656929] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:00:03,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126566904] [2022-07-19 22:00:03,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 22:00:03,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:00:03,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:00:03,162 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 22:00:03,163 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 22:00:15,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-19 22:00:15,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:00:15,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 2870 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 22:00:15,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:00:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-19 22:00:15,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:00:15,884 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-19 22:00:15,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126566904] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:00:15,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:00:15,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2022-07-19 22:00:15,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066605776] [2022-07-19 22:00:15,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:00:15,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-19 22:00:15,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:00:15,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-19 22:00:15,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2022-07-19 22:00:15,885 INFO L87 Difference]: Start difference. First operand 339 states and 403 transitions. Second operand has 32 states, 32 states have (on average 3.5) internal successors, (112), 31 states have internal predecessors, (112), 2 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-19 22:00:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:00:24,262 INFO L93 Difference]: Finished difference Result 619 states and 740 transitions. [2022-07-19 22:00:24,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-19 22:00:24,263 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.5) internal successors, (112), 31 states have internal predecessors, (112), 2 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 130 [2022-07-19 22:00:24,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:00:24,264 INFO L225 Difference]: With dead ends: 619 [2022-07-19 22:00:24,264 INFO L226 Difference]: Without dead ends: 356 [2022-07-19 22:00:24,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=572, Invalid=1234, Unknown=0, NotChecked=0, Total=1806 [2022-07-19 22:00:24,265 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 148 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 22:00:24,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1000 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 22:00:24,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-07-19 22:00:24,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 349. [2022-07-19 22:00:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 261 states have (on average 1.103448275862069) internal successors, (288), 267 states have internal predecessors, (288), 54 states have call successors, (54), 32 states have call predecessors, (54), 33 states have return successors, (71), 49 states have call predecessors, (71), 53 states have call successors, (71) [2022-07-19 22:00:24,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 413 transitions. [2022-07-19 22:00:24,281 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 413 transitions. Word has length 130 [2022-07-19 22:00:24,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:00:24,281 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 413 transitions. [2022-07-19 22:00:24,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.5) internal successors, (112), 31 states have internal predecessors, (112), 2 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-19 22:00:24,282 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 413 transitions. [2022-07-19 22:00:24,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-19 22:00:24,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:00:24,283 INFO L195 NwaCegarLoop]: trace histogram [18, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:00:24,301 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:24,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-07-19 22:00:24,484 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:00:24,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:00:24,484 INFO L85 PathProgramCache]: Analyzing trace with hash -446619791, now seen corresponding path program 4 times [2022-07-19 22:00:24,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:00:24,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420029624] [2022-07-19 22:00:24,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:00:24,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:00:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:24,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:00:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:24,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:00:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:24,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:00:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:24,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:00:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:24,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:00:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:24,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:00:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:24,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:00:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:24,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:00:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:24,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:00:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:25,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 22:00:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:25,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 22:00:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:25,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-19 22:00:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:25,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 22:00:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:25,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:00:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:00:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 4 proven. 171 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-19 22:00:25,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:00:25,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420029624] [2022-07-19 22:00:25,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420029624] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:00:25,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759006024] [2022-07-19 22:00:25,059 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 22:00:25,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:00:25,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:00:25,061 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:25,062 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:25,748 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 22:00:25,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:00:25,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 3060 conjuncts, 96 conjunts are in the unsatisfiable core [2022-07-19 22:00:25,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:00:25,776 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 22:00:25,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-19 22:00:26,469 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 22:00:26,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-07-19 22:00:26,479 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 22:00:26,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-19 22:00:26,483 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 7 treesize of output 5 [2022-07-19 22:00:26,605 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5582 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5582) |c_#memory_int|)) is different from true [2022-07-19 22:00:26,607 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5583 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5583) |c_#memory_int|)) is different from true [2022-07-19 22:00:26,609 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5584 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5584) |c_#memory_int|)) is different from true [2022-07-19 22:00:26,611 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5585 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5585))) is different from true [2022-07-19 22:00:26,613 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5586 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5586) |c_#memory_int|)) is different from true [2022-07-19 22:00:26,615 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5587 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5587) |c_#memory_int|)) is different from true [2022-07-19 22:00:26,617 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5588 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5588) |c_#memory_int|)) is different from true [2022-07-19 22:00:26,620 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5589 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5589) |c_#memory_int|)) is different from true [2022-07-19 22:00:26,622 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5590 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5590) |c_#memory_int|)) is different from true [2022-07-19 22:00:26,624 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5591 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5591))) is different from true [2022-07-19 22:00:26,627 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5592 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5592) |c_#memory_int|)) is different from true [2022-07-19 22:00:26,629 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5593 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5593))) is different from true [2022-07-19 22:00:26,631 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5594 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5594) |c_#memory_int|)) is different from true [2022-07-19 22:00:26,633 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5595 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5595))) is different from true [2022-07-19 22:00:26,635 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5596 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5596))) is different from true [2022-07-19 22:00:26,637 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5597 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5597) |c_#memory_int|)) is different from true [2022-07-19 22:00:26,639 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5598 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5598) |c_#memory_int|)) is different from true [2022-07-19 22:00:26,641 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5599 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5599))) is different from true [2022-07-19 22:00:26,649 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 20 treesize of output 22 [2022-07-19 22:00:26,706 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 20 treesize of output 22 [2022-07-19 22:00:26,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:00:26,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:00:26,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:00:26,737 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 22:00:26,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 49 [2022-07-19 22:00:28,820 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#buf~3#1.base_BEFORE_CALL_91| Int)) (and (let ((.cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_49|) 0))) (or (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#buf~3#1.base_BEFORE_CALL_91|) 0) .cse0) (and (= (mod .cse0 18446744073709551616) 0) (exists ((|ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~#src#1.base| Int)) (and (not (= |ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~#src#1.base| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#buf~3#1.base_BEFORE_CALL_91|)) (= (select (select |c_#memory_int| |ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~#src#1.base|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#buf~3#1.base_BEFORE_CALL_91|) 0))))))) (not (= |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#buf~3#1.base_BEFORE_CALL_91| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_49|)))) is different from true [2022-07-19 22:00:31,125 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#buf~3#1.base_BEFORE_CALL_92| Int) (|v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_50| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#buf~3#1.base_BEFORE_CALL_92| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_50|)) (let ((.cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_50|) 0))) (or (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#buf~3#1.base_BEFORE_CALL_92|) 0) .cse0) (and (= (mod .cse0 18446744073709551616) 0) (exists ((|ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~#src#1.base| Int)) (and (not (= |ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~#src#1.base| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#buf~3#1.base_BEFORE_CALL_92|)) (= (select (select |c_#memory_int| |ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~#src#1.base|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#buf~3#1.base_BEFORE_CALL_92|) 0))))))))) is different from true [2022-07-19 22:00:33,355 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#buf~3#1.base_BEFORE_CALL_93| Int)) (and (let ((.cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_51|) 0))) (or (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#buf~3#1.base_BEFORE_CALL_93|) 0) .cse0) (and (exists ((|ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~#src#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~#src#1.base|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#buf~3#1.base_BEFORE_CALL_93|) 0)) (not (= |ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~#src#1.base| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#buf~3#1.base_BEFORE_CALL_93|)))) (= (mod .cse0 18446744073709551616) 0)))) (not (= |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#buf~3#1.base_BEFORE_CALL_93| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_51|)))) is different from true [2022-07-19 22:00:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 186 not checked. [2022-07-19 22:00:57,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:01:02,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759006024] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:01:02,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:01:02,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 42] total 63 [2022-07-19 22:01:02,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190399656] [2022-07-19 22:01:02,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:01:02,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-19 22:01:02,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:01:02,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-19 22:01:02,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2609, Unknown=29, NotChecked=2562, Total=5402 [2022-07-19 22:01:02,284 INFO L87 Difference]: Start difference. First operand 349 states and 413 transitions. Second operand has 63 states, 63 states have (on average 2.746031746031746) internal successors, (173), 61 states have internal predecessors, (173), 7 states have call successors, (29), 10 states have call predecessors, (29), 11 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2022-07-19 22:01:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:01:04,964 INFO L93 Difference]: Finished difference Result 625 states and 739 transitions. [2022-07-19 22:01:04,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-19 22:01:04,965 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.746031746031746) internal successors, (173), 61 states have internal predecessors, (173), 7 states have call successors, (29), 10 states have call predecessors, (29), 11 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) Word has length 140 [2022-07-19 22:01:04,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:01:04,966 INFO L225 Difference]: With dead ends: 625 [2022-07-19 22:01:04,966 INFO L226 Difference]: Without dead ends: 364 [2022-07-19 22:01:04,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 169 SyntacticMatches, 11 SemanticMatches, 95 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=318, Invalid=5400, Unknown=66, NotChecked=3528, Total=9312 [2022-07-19 22:01:04,969 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 181 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 7306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6595 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:01:04,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1377 Invalid, 7306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 605 Invalid, 0 Unknown, 6595 Unchecked, 0.5s Time] [2022-07-19 22:01:04,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-07-19 22:01:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 350. [2022-07-19 22:01:04,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 262 states have (on average 1.1030534351145038) internal successors, (289), 268 states have internal predecessors, (289), 54 states have call successors, (54), 32 states have call predecessors, (54), 33 states have return successors, (71), 49 states have call predecessors, (71), 53 states have call successors, (71) [2022-07-19 22:01:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 414 transitions. [2022-07-19 22:01:04,987 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 414 transitions. Word has length 140 [2022-07-19 22:01:04,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:01:04,987 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 414 transitions. [2022-07-19 22:01:04,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.746031746031746) internal successors, (173), 61 states have internal predecessors, (173), 7 states have call successors, (29), 10 states have call predecessors, (29), 11 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2022-07-19 22:01:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 414 transitions. [2022-07-19 22:01:04,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-19 22:01:04,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:01:04,989 INFO L195 NwaCegarLoop]: trace histogram [19, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:01:05,013 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:01:05,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:01:05,207 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:01:05,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:01:05,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1364743045, now seen corresponding path program 5 times [2022-07-19 22:01:05,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:01:05,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482561738] [2022-07-19 22:01:05,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:01:05,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:01:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:05,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:01:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:05,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:01:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:05,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:01:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:05,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:01:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:05,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:01:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:05,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:01:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:05,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:01:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:05,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:01:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:05,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:01:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:05,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 22:01:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:05,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:01:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:05,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:01:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:05,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:01:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:05,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-19 22:01:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:01:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 4 proven. 190 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-19 22:01:05,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:01:05,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482561738] [2022-07-19 22:01:05,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482561738] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:01:05,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434757996] [2022-07-19 22:01:05,921 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 22:01:05,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:01:05,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:01:05,924 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:01:05,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process