./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_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-?-6c24879 [2022-07-12 10:56:21,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:56:21,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:56:21,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:56:21,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:56:21,949 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:56:21,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:56:21,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:56:21,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:56:21,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:56:21,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:56:21,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:56:21,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:56:21,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:56:21,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:56:21,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:56:21,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:56:21,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:56:21,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:56:21,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:56:21,984 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:56:21,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:56:21,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:56:21,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:56:21,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:56:21,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:56:21,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:56:21,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:56:21,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:56:21,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:56:21,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:56:21,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:56:21,999 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:56:22,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:56:22,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:56:22,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:56:22,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:56:22,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:56:22,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:56:22,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:56:22,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:56:22,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:56:22,006 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 10:56:22,038 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:56:22,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:56:22,041 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:56:22,041 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:56:22,042 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:56:22,042 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:56:22,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:56:22,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:56:22,043 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:56:22,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:56:22,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:56:22,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:56:22,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:56:22,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:56:22,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:56:22,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:56:22,045 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:56:22,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:56:22,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:56:22,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:56:22,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:56:22,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:56:22,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:56:22,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:56:22,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:56:22,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:56:22,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:56:22,048 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:56:22,048 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:56:22,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:56:22,048 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-12 10:56:22,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:56:22,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:56:22,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:56:22,291 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:56:22,291 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:56:22,292 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-12 10:56:22,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b98aab80/5ee2ec2c83ce4387ad6193a11b08c697/FLAGc39514e72 [2022-07-12 10:56:23,070 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:56:23,071 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-12 10:56:23,109 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b98aab80/5ee2ec2c83ce4387ad6193a11b08c697/FLAGc39514e72 [2022-07-12 10:56:23,158 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b98aab80/5ee2ec2c83ce4387ad6193a11b08c697 [2022-07-12 10:56:23,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:56:23,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:56:23,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:56:23,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:56:23,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:56:23,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:56:23" (1/1) ... [2022-07-12 10:56:23,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3396383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:23, skipping insertion in model container [2022-07-12 10:56:23,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:56:23" (1/1) ... [2022-07-12 10:56:23,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:56:23,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:56:23,524 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-12 10:56:23,529 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-12 10:56:24,288 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:24,289 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:24,289 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:24,290 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:24,291 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:24,303 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:24,304 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:24,306 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:24,306 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:24,623 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 10:56:24,625 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 10:56:24,626 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 10:56:24,628 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 10:56:24,632 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 10:56:24,637 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 10:56:24,637 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 10:56:24,639 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 10:56:24,641 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 10:56:24,643 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 10:56:24,778 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 10:56:24,917 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:24,918 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:24,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:56:25,014 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:56:25,036 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-12 10:56:25,038 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-12 10:56:25,088 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:25,089 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:25,090 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:25,090 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:25,091 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:25,100 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:25,103 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:25,104 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:25,105 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:25,145 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 10:56:25,145 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 10:56:25,146 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 10:56:25,147 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 10:56:25,149 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 10:56:25,150 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 10:56:25,150 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 10:56:25,151 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 10:56:25,151 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 10:56:25,151 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 10:56:25,183 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 10:56:25,282 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:25,283 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:25,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:56:25,493 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:56:25,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:25 WrapperNode [2022-07-12 10:56:25,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:56:25,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:56:25,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:56:25,496 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:56:25,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:25" (1/1) ... [2022-07-12 10:56:25,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:25" (1/1) ... [2022-07-12 10:56:25,699 INFO L137 Inliner]: procedures = 691, calls = 2614, calls flagged for inlining = 61, calls inlined = 8, statements flattened = 897 [2022-07-12 10:56:25,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:56:25,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:56:25,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:56:25,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:56:25,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:25" (1/1) ... [2022-07-12 10:56:25,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:25" (1/1) ... [2022-07-12 10:56:25,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:25" (1/1) ... [2022-07-12 10:56:25,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:25" (1/1) ... [2022-07-12 10:56:25,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:25" (1/1) ... [2022-07-12 10:56:25,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:25" (1/1) ... [2022-07-12 10:56:25,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:25" (1/1) ... [2022-07-12 10:56:25,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:56:25,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:56:25,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:56:25,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:56:25,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:25" (1/1) ... [2022-07-12 10:56:25,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:56:25,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:25,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 10:56:25,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 10:56:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-12 10:56:25,893 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-12 10:56:25,893 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-12 10:56:25,894 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-12 10:56:25,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:56:25,894 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 10:56:25,894 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 10:56:25,895 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-07-12 10:56:25,895 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-07-12 10:56:25,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:56:25,896 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-12 10:56:25,896 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-12 10:56:25,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 10:56:25,897 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 10:56:25,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 10:56:25,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:56:25,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 10:56:25,897 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2022-07-12 10:56:25,898 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2022-07-12 10:56:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:56:25,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:56:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 10:56:25,898 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 10:56:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-07-12 10:56:25,899 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-07-12 10:56:25,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 10:56:25,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 10:56:25,900 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 10:56:25,900 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 10:56:25,900 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2022-07-12 10:56:25,901 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2022-07-12 10:56:25,901 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-07-12 10:56:25,901 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-07-12 10:56:25,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:56:25,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 10:56:25,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 10:56:25,902 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-12 10:56:25,902 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-12 10:56:25,902 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 10:56:25,902 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 10:56:25,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:56:25,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:56:26,197 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:56:26,200 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:56:27,406 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:56:27,415 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:56:27,415 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-12 10:56:27,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:56:27 BoogieIcfgContainer [2022-07-12 10:56:27,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:56:27,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:56:27,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:56:27,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:56:27,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:56:23" (1/3) ... [2022-07-12 10:56:27,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af0e591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:56:27, skipping insertion in model container [2022-07-12 10:56:27,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:25" (2/3) ... [2022-07-12 10:56:27,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af0e591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:56:27, skipping insertion in model container [2022-07-12 10:56:27,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:56:27" (3/3) ... [2022-07-12 10:56:27,427 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_init_copy_from_cursor_harness.i [2022-07-12 10:56:27,440 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:56:27,440 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:56:27,485 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:56:27,491 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@443a9218, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5fb73f90 [2022-07-12 10:56:27,491 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 10:56:27,495 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-12 10:56:27,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-12 10:56:27,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:27,506 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-12 10:56:27,507 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:27,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:27,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1193477456, now seen corresponding path program 1 times [2022-07-12 10:56:27,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:27,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210718473] [2022-07-12 10:56:27,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:27,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 10:56:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 10:56:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:56:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:56:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:56:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,202 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-12 10:56:28,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:28,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210718473] [2022-07-12 10:56:28,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210718473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:28,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:28,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:56:28,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209608650] [2022-07-12 10:56:28,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:28,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 10:56:28,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:28,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 10:56:28,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 10:56:28,243 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-12 10:56:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:28,310 INFO L93 Difference]: Finished difference Result 338 states and 472 transitions. [2022-07-12 10:56:28,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 10:56:28,313 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-12 10:56:28,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:28,326 INFO L225 Difference]: With dead ends: 338 [2022-07-12 10:56:28,326 INFO L226 Difference]: Without dead ends: 164 [2022-07-12 10:56:28,334 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-12 10:56:28,340 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-12 10:56:28,342 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-12 10:56:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-12 10:56:28,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-07-12 10:56:28,392 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-12 10:56:28,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 209 transitions. [2022-07-12 10:56:28,395 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 209 transitions. Word has length 61 [2022-07-12 10:56:28,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:28,398 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 209 transitions. [2022-07-12 10:56:28,399 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-12 10:56:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 209 transitions. [2022-07-12 10:56:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 10:56:28,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:28,414 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-12 10:56:28,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:56:28,415 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:28,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:28,416 INFO L85 PathProgramCache]: Analyzing trace with hash -148092610, now seen corresponding path program 1 times [2022-07-12 10:56:28,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:28,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045496038] [2022-07-12 10:56:28,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:28,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 10:56:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 10:56:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:56:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:56:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:56:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 10:56:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 10:56:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:28,785 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-12 10:56:28,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:28,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045496038] [2022-07-12 10:56:28,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045496038] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:28,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057225478] [2022-07-12 10:56:28,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:28,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:28,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:28,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:28,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 10:56:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 2518 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 10:56:29,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:29,375 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-12 10:56:29,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:29,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057225478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:29,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:29,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-07-12 10:56:29,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7135489] [2022-07-12 10:56:29,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:29,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:56:29,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:29,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:56:29,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:56:29,379 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-12 10:56:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:29,445 INFO L93 Difference]: Finished difference Result 229 states and 291 transitions. [2022-07-12 10:56:29,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 10:56:29,445 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-12 10:56:29,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:29,453 INFO L225 Difference]: With dead ends: 229 [2022-07-12 10:56:29,454 INFO L226 Difference]: Without dead ends: 162 [2022-07-12 10:56:29,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:56:29,461 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-12 10:56:29,461 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-12 10:56:29,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-12 10:56:29,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-07-12 10:56:29,480 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-12 10:56:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 204 transitions. [2022-07-12 10:56:29,482 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 204 transitions. Word has length 68 [2022-07-12 10:56:29,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:29,484 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 204 transitions. [2022-07-12 10:56:29,484 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-12 10:56:29,484 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 204 transitions. [2022-07-12 10:56:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-12 10:56:29,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:29,487 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-12 10:56:29,522 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-12 10:56:29,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:29,689 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:29,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:29,689 INFO L85 PathProgramCache]: Analyzing trace with hash 844833533, now seen corresponding path program 1 times [2022-07-12 10:56:29,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:29,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234093949] [2022-07-12 10:56:29,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:29,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 10:56:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 10:56:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:56:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:56:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:56:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:56:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 10:56:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,942 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-12 10:56:29,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:29,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234093949] [2022-07-12 10:56:29,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234093949] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:29,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580196610] [2022-07-12 10:56:29,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:29,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:29,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:29,945 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:29,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 10:56:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:30,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 2598 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 10:56:30,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:30,585 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-12 10:56:30,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:30,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580196610] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:30,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:30,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2022-07-12 10:56:30,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953361922] [2022-07-12 10:56:30,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:30,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:56:30,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:30,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:56:30,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:56:30,588 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-12 10:56:30,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:30,778 INFO L93 Difference]: Finished difference Result 232 states and 293 transitions. [2022-07-12 10:56:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:56:30,779 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-12 10:56:30,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:30,781 INFO L225 Difference]: With dead ends: 232 [2022-07-12 10:56:30,781 INFO L226 Difference]: Without dead ends: 162 [2022-07-12 10:56:30,781 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-12 10:56:30,782 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-12 10:56:30,782 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-12 10:56:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-12 10:56:30,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-07-12 10:56:30,794 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-12 10:56:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 203 transitions. [2022-07-12 10:56:30,795 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 203 transitions. Word has length 74 [2022-07-12 10:56:30,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:30,796 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 203 transitions. [2022-07-12 10:56:30,796 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-12 10:56:30,797 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 203 transitions. [2022-07-12 10:56:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-12 10:56:30,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:30,798 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-12 10:56:30,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:31,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-12 10:56:31,024 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:31,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:31,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1064456392, now seen corresponding path program 1 times [2022-07-12 10:56:31,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:31,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468587886] [2022-07-12 10:56:31,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:31,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 10:56:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 10:56:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:56:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 10:56:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:56:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:56:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 10:56:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,303 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-12 10:56:31,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:31,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468587886] [2022-07-12 10:56:31,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468587886] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:31,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903637532] [2022-07-12 10:56:31,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:31,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:31,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:31,306 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:31,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 10:56:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:31,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 2615 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 10:56:31,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:31,868 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-12 10:56:31,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:31,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903637532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:31,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:31,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-07-12 10:56:31,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076763385] [2022-07-12 10:56:31,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:31,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:56:31,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:31,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:56:31,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:56:31,871 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-12 10:56:32,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:32,035 INFO L93 Difference]: Finished difference Result 315 states and 394 transitions. [2022-07-12 10:56:32,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 10:56:32,036 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-12 10:56:32,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:32,039 INFO L225 Difference]: With dead ends: 315 [2022-07-12 10:56:32,039 INFO L226 Difference]: Without dead ends: 165 [2022-07-12 10:56:32,040 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-12 10:56:32,041 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-12 10:56:32,041 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-12 10:56:32,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-12 10:56:32,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-07-12 10:56:32,052 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-12 10:56:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 206 transitions. [2022-07-12 10:56:32,054 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 206 transitions. Word has length 80 [2022-07-12 10:56:32,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:32,054 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 206 transitions. [2022-07-12 10:56:32,054 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-12 10:56:32,054 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 206 transitions. [2022-07-12 10:56:32,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 10:56:32,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:32,056 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-12 10:56:32,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:32,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:32,272 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:32,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:32,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1640139853, now seen corresponding path program 1 times [2022-07-12 10:56:32,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:32,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027739309] [2022-07-12 10:56:32,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:32,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:32,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:32,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:32,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:32,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:56:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:32,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:56:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:32,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:56:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:32,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:56:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:32,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:32,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:56:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:32,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 10:56:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:32,595 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-12 10:56:32,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:32,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027739309] [2022-07-12 10:56:32,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027739309] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:32,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:32,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:56:32,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267336614] [2022-07-12 10:56:32,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:32,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:56:32,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:32,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:56:32,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:56:32,598 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-12 10:56:33,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:33,018 INFO L93 Difference]: Finished difference Result 321 states and 394 transitions. [2022-07-12 10:56:33,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 10:56:33,018 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-12 10:56:33,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:33,020 INFO L225 Difference]: With dead ends: 321 [2022-07-12 10:56:33,020 INFO L226 Difference]: Without dead ends: 172 [2022-07-12 10:56:33,020 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-12 10:56:33,021 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.4s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:33,021 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.4s Time] [2022-07-12 10:56:33,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-12 10:56:33,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2022-07-12 10:56:33,032 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-12 10:56:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 202 transitions. [2022-07-12 10:56:33,033 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 202 transitions. Word has length 82 [2022-07-12 10:56:33,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:33,034 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 202 transitions. [2022-07-12 10:56:33,034 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-12 10:56:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 202 transitions. [2022-07-12 10:56:33,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 10:56:33,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:33,035 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-12 10:56:33,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:56:33,036 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:33,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:33,036 INFO L85 PathProgramCache]: Analyzing trace with hash -495240856, now seen corresponding path program 1 times [2022-07-12 10:56:33,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:33,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872873390] [2022-07-12 10:56:33,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:33,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:56:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:56:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:56:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:56:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:56:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 10:56:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:33,296 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-12 10:56:33,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:33,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872873390] [2022-07-12 10:56:33,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872873390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:33,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:33,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:56:33,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591509289] [2022-07-12 10:56:33,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:33,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:56:33,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:33,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:56:33,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:56:33,299 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-12 10:56:33,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:33,914 INFO L93 Difference]: Finished difference Result 290 states and 370 transitions. [2022-07-12 10:56:33,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 10:56:33,914 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-12 10:56:33,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:33,916 INFO L225 Difference]: With dead ends: 290 [2022-07-12 10:56:33,916 INFO L226 Difference]: Without dead ends: 203 [2022-07-12 10:56:33,917 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-12 10:56:33,918 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 103 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 387 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.6s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:33,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 387 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 10:56:33,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-12 10:56:33,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 164. [2022-07-12 10:56:33,929 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-12 10:56:33,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 204 transitions. [2022-07-12 10:56:33,931 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 204 transitions. Word has length 84 [2022-07-12 10:56:33,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:33,931 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 204 transitions. [2022-07-12 10:56:33,931 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-12 10:56:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2022-07-12 10:56:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 10:56:33,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:33,933 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-12 10:56:33,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:56:33,933 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:33,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:33,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2110782698, now seen corresponding path program 1 times [2022-07-12 10:56:33,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:33,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117493989] [2022-07-12 10:56:33,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:33,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:56:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:56:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:56:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:56:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:56:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 10:56:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:34,281 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-12 10:56:34,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:34,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117493989] [2022-07-12 10:56:34,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117493989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:34,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:34,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:56:34,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764760752] [2022-07-12 10:56:34,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:34,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:56:34,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:34,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:56:34,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:56:34,283 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-12 10:56:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:34,921 INFO L93 Difference]: Finished difference Result 186 states and 229 transitions. [2022-07-12 10:56:34,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:56:34,922 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-12 10:56:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:34,923 INFO L225 Difference]: With dead ends: 186 [2022-07-12 10:56:34,923 INFO L226 Difference]: Without dead ends: 184 [2022-07-12 10:56:34,925 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-12 10:56:34,925 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-12 10:56:34,925 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-12 10:56:34,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-12 10:56:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 173. [2022-07-12 10:56:34,936 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-12 10:56:34,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 214 transitions. [2022-07-12 10:56:34,937 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 214 transitions. Word has length 84 [2022-07-12 10:56:34,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:34,938 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 214 transitions. [2022-07-12 10:56:34,938 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-12 10:56:34,938 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 214 transitions. [2022-07-12 10:56:34,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 10:56:34,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:34,939 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-12 10:56:34,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:56:34,939 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:34,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:34,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1398941774, now seen corresponding path program 1 times [2022-07-12 10:56:34,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:34,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175573434] [2022-07-12 10:56:34,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:34,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:56:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:56:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:56:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:56:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:56:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 10:56:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,284 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-12 10:56:35,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:35,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175573434] [2022-07-12 10:56:35,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175573434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:35,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:35,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 10:56:35,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392945570] [2022-07-12 10:56:35,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:35,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:56:35,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:35,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:56:35,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:56:35,286 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-12 10:56:35,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:35,664 INFO L93 Difference]: Finished difference Result 330 states and 403 transitions. [2022-07-12 10:56:35,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:56:35,664 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-12 10:56:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:35,666 INFO L225 Difference]: With dead ends: 330 [2022-07-12 10:56:35,666 INFO L226 Difference]: Without dead ends: 181 [2022-07-12 10:56:35,666 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-12 10:56:35,667 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 88 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-12 10:56:35,667 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-12 10:56:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-12 10:56:35,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 174. [2022-07-12 10:56:35,679 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-12 10:56:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 215 transitions. [2022-07-12 10:56:35,680 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 215 transitions. Word has length 88 [2022-07-12 10:56:35,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:35,681 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 215 transitions. [2022-07-12 10:56:35,681 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-12 10:56:35,681 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 215 transitions. [2022-07-12 10:56:35,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 10:56:35,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:35,682 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-12 10:56:35,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:56:35,683 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:35,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:35,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1930196412, now seen corresponding path program 1 times [2022-07-12 10:56:35,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:35,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429438791] [2022-07-12 10:56:35,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:35,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:56:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:56:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:56:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:56:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:35,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:56:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:36,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 10:56:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:36,045 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-12 10:56:36,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:36,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429438791] [2022-07-12 10:56:36,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429438791] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:36,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072915437] [2022-07-12 10:56:36,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:36,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:36,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:36,048 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:36,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 10:56:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:36,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 2651 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 10:56:36,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:36,661 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-12 10:56:36,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:36,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072915437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:36,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:36,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-07-12 10:56:36,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44199280] [2022-07-12 10:56:36,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:36,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:56:36,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:36,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:56:36,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:56:36,664 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-12 10:56:36,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:36,822 INFO L93 Difference]: Finished difference Result 263 states and 329 transitions. [2022-07-12 10:56:36,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:56:36,823 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-12 10:56:36,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:36,824 INFO L225 Difference]: With dead ends: 263 [2022-07-12 10:56:36,824 INFO L226 Difference]: Without dead ends: 192 [2022-07-12 10:56:36,824 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-12 10:56:36,825 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-12 10:56:36,825 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-12 10:56:36,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-12 10:56:36,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 179. [2022-07-12 10:56:36,835 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-12 10:56:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 222 transitions. [2022-07-12 10:56:36,837 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 222 transitions. Word has length 89 [2022-07-12 10:56:36,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:36,837 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 222 transitions. [2022-07-12 10:56:36,837 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-12 10:56:36,838 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 222 transitions. [2022-07-12 10:56:36,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 10:56:36,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:36,839 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-12 10:56:36,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:37,051 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-12 10:56:37,051 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:37,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:37,052 INFO L85 PathProgramCache]: Analyzing trace with hash -2106605446, now seen corresponding path program 1 times [2022-07-12 10:56:37,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:37,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648528820] [2022-07-12 10:56:37,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:37,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:56:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:56:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:56:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:56:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:56:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 10:56:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,408 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-12 10:56:37,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:37,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648528820] [2022-07-12 10:56:37,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648528820] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:37,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383326435] [2022-07-12 10:56:37,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:37,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:37,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:37,410 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:37,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 10:56:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:37,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 2646 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-12 10:56:37,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:37,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:56:37,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:56:38,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:38,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:38,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:38,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:38,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:38,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:38,044 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-12 10:56:38,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:38,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:38,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:38,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:38,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:38,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:38,059 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-12 10:56:38,412 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-12 10:56:38,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:38,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383326435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:38,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:38,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2022-07-12 10:56:38,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840518955] [2022-07-12 10:56:38,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:38,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:56:38,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:38,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:56:38,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-12 10:56:38,414 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-12 10:56:38,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:38,563 INFO L93 Difference]: Finished difference Result 289 states and 364 transitions. [2022-07-12 10:56:38,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:56:38,564 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-12 10:56:38,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:38,566 INFO L225 Difference]: With dead ends: 289 [2022-07-12 10:56:38,566 INFO L226 Difference]: Without dead ends: 207 [2022-07-12 10:56:38,566 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-12 10:56:38,567 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-12 10:56:38,567 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-12 10:56:38,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-12 10:56:38,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2022-07-12 10:56:38,584 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-12 10:56:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 260 transitions. [2022-07-12 10:56:38,585 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 260 transitions. Word has length 89 [2022-07-12 10:56:38,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:38,586 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 260 transitions. [2022-07-12 10:56:38,586 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-12 10:56:38,586 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 260 transitions. [2022-07-12 10:56:38,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 10:56:38,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:38,590 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-12 10:56:38,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:38,803 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-12 10:56:38,804 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:38,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:38,804 INFO L85 PathProgramCache]: Analyzing trace with hash 908498172, now seen corresponding path program 1 times [2022-07-12 10:56:38,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:38,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557482191] [2022-07-12 10:56:38,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:38,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:38,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:38,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:38,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:38,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:56:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:38,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:56:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:38,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:56:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:38,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:56:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:39,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:39,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:56:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:39,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 10:56:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:39,097 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-12 10:56:39,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:39,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557482191] [2022-07-12 10:56:39,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557482191] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:39,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463096647] [2022-07-12 10:56:39,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:39,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:39,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:39,100 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:39,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 10:56:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:39,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 2641 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-12 10:56:39,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:39,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:39,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:39,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:39,748 INFO L356 Elim1Store]: treesize reduction 87, result has 23.0 percent of original size [2022-07-12 10:56:39,749 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-12 10:56:40,052 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-12 10:56:40,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:40,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463096647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:40,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:40,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2022-07-12 10:56:40,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977976171] [2022-07-12 10:56:40,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:40,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 10:56:40,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:40,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 10:56:40,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-12 10:56:40,055 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-12 10:56:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:40,412 INFO L93 Difference]: Finished difference Result 339 states and 433 transitions. [2022-07-12 10:56:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 10:56:40,413 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-12 10:56:40,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:40,415 INFO L225 Difference]: With dead ends: 339 [2022-07-12 10:56:40,415 INFO L226 Difference]: Without dead ends: 245 [2022-07-12 10:56:40,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-07-12 10:56:40,416 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:40,417 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.3s Time] [2022-07-12 10:56:40,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-07-12 10:56:40,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 217. [2022-07-12 10:56:40,428 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-12 10:56:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 275 transitions. [2022-07-12 10:56:40,429 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 275 transitions. Word has length 89 [2022-07-12 10:56:40,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:40,429 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 275 transitions. [2022-07-12 10:56:40,430 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-12 10:56:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 275 transitions. [2022-07-12 10:56:40,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 10:56:40,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:40,431 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-12 10:56:40,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:40,647 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-12 10:56:40,648 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:40,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:40,648 INFO L85 PathProgramCache]: Analyzing trace with hash -938015168, now seen corresponding path program 1 times [2022-07-12 10:56:40,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:40,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574685157] [2022-07-12 10:56:40,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:40,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:56:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:56:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:56:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:56:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:56:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 10:56:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:40,923 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-12 10:56:40,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:40,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574685157] [2022-07-12 10:56:40,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574685157] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:40,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681845047] [2022-07-12 10:56:40,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:40,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:40,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:40,925 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:40,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 10:56:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:41,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 2643 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 10:56:41,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:41,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:41,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:41,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:41,582 INFO L356 Elim1Store]: treesize reduction 87, result has 23.0 percent of original size [2022-07-12 10:56:41,583 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-12 10:56:42,021 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-12 10:56:42,021 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:42,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681845047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:42,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:42,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2022-07-12 10:56:42,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448660505] [2022-07-12 10:56:42,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:42,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 10:56:42,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:42,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 10:56:42,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:56:42,023 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-12 10:56:42,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:42,431 INFO L93 Difference]: Finished difference Result 349 states and 448 transitions. [2022-07-12 10:56:42,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 10:56:42,431 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-12 10:56:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:42,433 INFO L225 Difference]: With dead ends: 349 [2022-07-12 10:56:42,433 INFO L226 Difference]: Without dead ends: 268 [2022-07-12 10:56:42,434 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-12 10:56:42,434 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:42,434 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.3s Time] [2022-07-12 10:56:42,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-12 10:56:42,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 238. [2022-07-12 10:56:42,446 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-12 10:56:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 303 transitions. [2022-07-12 10:56:42,448 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 303 transitions. Word has length 89 [2022-07-12 10:56:42,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:42,448 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 303 transitions. [2022-07-12 10:56:42,448 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-12 10:56:42,449 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 303 transitions. [2022-07-12 10:56:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 10:56:42,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:42,450 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-12 10:56:42,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:42,675 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-12 10:56:42,676 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:42,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:42,676 INFO L85 PathProgramCache]: Analyzing trace with hash -679849730, now seen corresponding path program 1 times [2022-07-12 10:56:42,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:42,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466192822] [2022-07-12 10:56:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:56:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:56:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:56:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:56:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:56:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:43,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 10:56:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:43,032 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-12 10:56:43,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:43,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466192822] [2022-07-12 10:56:43,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466192822] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:43,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398496793] [2022-07-12 10:56:43,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:43,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:43,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:43,036 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:43,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 10:56:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:43,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 2638 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 10:56:43,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:43,622 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-12 10:56:43,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:43,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398496793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:43,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:43,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-07-12 10:56:43,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036683505] [2022-07-12 10:56:43,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:43,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:56:43,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:43,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:56:43,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:56:43,625 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-12 10:56:43,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:43,786 INFO L93 Difference]: Finished difference Result 332 states and 423 transitions. [2022-07-12 10:56:43,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 10:56:43,787 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-12 10:56:43,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:43,788 INFO L225 Difference]: With dead ends: 332 [2022-07-12 10:56:43,788 INFO L226 Difference]: Without dead ends: 244 [2022-07-12 10:56:43,789 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-12 10:56:43,790 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 28 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:43,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 738 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2022-07-12 10:56:43,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-12 10:56:43,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 230. [2022-07-12 10:56:43,806 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-12 10:56:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 290 transitions. [2022-07-12 10:56:43,808 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 290 transitions. Word has length 89 [2022-07-12 10:56:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:43,809 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 290 transitions. [2022-07-12 10:56:43,809 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-12 10:56:43,809 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 290 transitions. [2022-07-12 10:56:43,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-12 10:56:43,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:43,810 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-12 10:56:43,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-12 10:56:44,011 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-12 10:56:44,011 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:44,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:44,012 INFO L85 PathProgramCache]: Analyzing trace with hash 733091521, now seen corresponding path program 1 times [2022-07-12 10:56:44,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:44,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379949294] [2022-07-12 10:56:44,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:44,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:56:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:56:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:56:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:56:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:56:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 10:56:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,235 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-12 10:56:44,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:44,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379949294] [2022-07-12 10:56:44,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379949294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:44,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:44,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 10:56:44,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099749041] [2022-07-12 10:56:44,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:44,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:56:44,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:44,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:56:44,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:56:44,238 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-12 10:56:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:44,603 INFO L93 Difference]: Finished difference Result 330 states and 413 transitions. [2022-07-12 10:56:44,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 10:56:44,604 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-12 10:56:44,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:44,605 INFO L225 Difference]: With dead ends: 330 [2022-07-12 10:56:44,605 INFO L226 Difference]: Without dead ends: 241 [2022-07-12 10:56:44,606 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-12 10:56:44,606 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 95 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-12 10:56:44,606 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-12 10:56:44,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-12 10:56:44,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 228. [2022-07-12 10:56:44,617 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-12 10:56:44,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 285 transitions. [2022-07-12 10:56:44,619 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 285 transitions. Word has length 91 [2022-07-12 10:56:44,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:44,619 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 285 transitions. [2022-07-12 10:56:44,620 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-12 10:56:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 285 transitions. [2022-07-12 10:56:44,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-12 10:56:44,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:44,621 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-12 10:56:44,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 10:56:44,621 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:44,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:44,622 INFO L85 PathProgramCache]: Analyzing trace with hash 55265029, now seen corresponding path program 1 times [2022-07-12 10:56:44,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:44,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267883338] [2022-07-12 10:56:44,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:44,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:56:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:56:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:56:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:56:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:56:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 10:56:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,816 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-12 10:56:44,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:44,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267883338] [2022-07-12 10:56:44,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267883338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:44,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:44,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 10:56:44,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184907577] [2022-07-12 10:56:44,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:44,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:56:44,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:44,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:56:44,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:56:44,819 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-12 10:56:45,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:45,199 INFO L93 Difference]: Finished difference Result 344 states and 427 transitions. [2022-07-12 10:56:45,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 10:56:45,199 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-12 10:56:45,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:45,201 INFO L225 Difference]: With dead ends: 344 [2022-07-12 10:56:45,201 INFO L226 Difference]: Without dead ends: 242 [2022-07-12 10:56:45,202 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-12 10:56:45,202 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 122 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-12 10:56:45,203 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-12 10:56:45,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-12 10:56:45,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2022-07-12 10:56:45,214 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-12 10:56:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 274 transitions. [2022-07-12 10:56:45,216 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 274 transitions. Word has length 91 [2022-07-12 10:56:45,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:45,216 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 274 transitions. [2022-07-12 10:56:45,216 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-12 10:56:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 274 transitions. [2022-07-12 10:56:45,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-12 10:56:45,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:45,218 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-12 10:56:45,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 10:56:45,218 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:45,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:45,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2060819845, now seen corresponding path program 1 times [2022-07-12 10:56:45,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:45,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55215092] [2022-07-12 10:56:45,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:45,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:56:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:56:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:56:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:56:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:56:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 10:56:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,513 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-12 10:56:45,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:45,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55215092] [2022-07-12 10:56:45,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55215092] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:45,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:45,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:56:45,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136094114] [2022-07-12 10:56:45,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:45,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:56:45,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:45,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:56:45,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:56:45,518 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-12 10:56:46,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:46,272 INFO L93 Difference]: Finished difference Result 243 states and 299 transitions. [2022-07-12 10:56:46,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 10:56:46,273 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-12 10:56:46,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:46,275 INFO L225 Difference]: With dead ends: 243 [2022-07-12 10:56:46,275 INFO L226 Difference]: Without dead ends: 241 [2022-07-12 10:56:46,275 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-12 10:56:46,276 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 116 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:46,276 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.6s Time] [2022-07-12 10:56:46,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-12 10:56:46,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 224. [2022-07-12 10:56:46,287 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-12 10:56:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 276 transitions. [2022-07-12 10:56:46,289 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 276 transitions. Word has length 91 [2022-07-12 10:56:46,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:46,289 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 276 transitions. [2022-07-12 10:56:46,290 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-12 10:56:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 276 transitions. [2022-07-12 10:56:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-12 10:56:46,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:46,291 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-12 10:56:46,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 10:56:46,291 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:46,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:46,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1533082873, now seen corresponding path program 1 times [2022-07-12 10:56:46,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:46,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160325562] [2022-07-12 10:56:46,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:46,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:56:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:56:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:56:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:56:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:56:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 10:56:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,596 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-12 10:56:46,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:46,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160325562] [2022-07-12 10:56:46,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160325562] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:46,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001085485] [2022-07-12 10:56:46,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:46,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:46,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:46,600 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:46,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 10:56:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:47,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 2653 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-12 10:56:47,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:47,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:56:47,211 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-12 10:56:47,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:56:47,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:56:47,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:47,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:47,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:47,336 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-12 10:56:47,337 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-12 10:56:47,343 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-12 10:56:47,381 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-12 10:56:47,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:47,388 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-12 10:56:47,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:47,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:47,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:47,429 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-12 10:56:48,064 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-12 10:56:48,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:56:49,114 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1774 (Array Int Int)) (aux_div_v_ArrVal_1773_40 Int) (aux_mod_v_ArrVal_1773_40 Int) (v_ArrVal_1771 (Array Int Int)) (|ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~dest#1.base| Int) (v_ArrVal_1775 Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~dest#1.base| v_ArrVal_1774) |c_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~#src#1.base|) |c_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~#src#1.offset|))) (or (= (mod .cse0 18446744073709551616) 0) (< 0 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~dest#1.base| (store (store (store v_ArrVal_1771 |c_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~dest#1.offset| (+ (* 18446744073709551616 aux_div_v_ArrVal_1773_40) aux_mod_v_ArrVal_1773_40)) (+ |c_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~dest#1.offset| 16) .cse0) (+ |c_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~dest#1.offset| 24) v_ArrVal_1775)) |c_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~#src#1.base|) |c_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~#src#1.offset|) 18446744073709551616)) (not (= (mod (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~dest#1.base| v_ArrVal_1771) |c_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~#src#1.base|) |c_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_~#src#1.offset|) 18446744073709551616) 0)) (= aux_mod_v_ArrVal_1773_40 0) (> 0 aux_mod_v_ArrVal_1773_40) (>= aux_mod_v_ArrVal_1773_40 18446744073709551616)))) is different from false [2022-07-12 10:56:49,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001085485] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:49,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:56:49,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16] total 20 [2022-07-12 10:56:49,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864248176] [2022-07-12 10:56:49,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:56:49,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 10:56:49,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:49,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 10:56:49,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=711, Unknown=6, NotChecked=110, Total=930 [2022-07-12 10:56:49,120 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-12 10:56:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:50,103 INFO L93 Difference]: Finished difference Result 440 states and 536 transitions. [2022-07-12 10:56:50,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 10:56:50,104 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-12 10:56:50,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:50,107 INFO L225 Difference]: With dead ends: 440 [2022-07-12 10:56:50,107 INFO L226 Difference]: Without dead ends: 235 [2022-07-12 10:56:50,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=175, Invalid=1231, Unknown=8, NotChecked=146, Total=1560 [2022-07-12 10:56:50,110 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 185 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 561 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:50,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 671 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 708 Invalid, 0 Unknown, 561 Unchecked, 0.6s Time] [2022-07-12 10:56:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-07-12 10:56:50,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 226. [2022-07-12 10:56:50,123 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-12 10:56:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 277 transitions. [2022-07-12 10:56:50,125 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 277 transitions. Word has length 91 [2022-07-12 10:56:50,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:50,125 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 277 transitions. [2022-07-12 10:56:50,125 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-12 10:56:50,126 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 277 transitions. [2022-07-12 10:56:50,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 10:56:50,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:50,127 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-12 10:56:50,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:50,343 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-12 10:56:50,343 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:50,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:50,344 INFO L85 PathProgramCache]: Analyzing trace with hash -151627689, now seen corresponding path program 1 times [2022-07-12 10:56:50,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:50,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912119253] [2022-07-12 10:56:50,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:50,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:56:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:56:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:56:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:56:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:56:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 10:56:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 10:56:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 10:56:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,632 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-12 10:56:50,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:50,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912119253] [2022-07-12 10:56:50,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912119253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:50,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:50,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:56:50,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74380959] [2022-07-12 10:56:50,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:50,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:56:50,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:50,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:56:50,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:56:50,634 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-12 10:56:51,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:51,228 INFO L93 Difference]: Finished difference Result 245 states and 300 transitions. [2022-07-12 10:56:51,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:56:51,240 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-12 10:56:51,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:51,242 INFO L225 Difference]: With dead ends: 245 [2022-07-12 10:56:51,242 INFO L226 Difference]: Without dead ends: 243 [2022-07-12 10:56:51,242 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-12 10:56:51,243 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 107 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:51,243 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.5s Time] [2022-07-12 10:56:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-12 10:56:51,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 235. [2022-07-12 10:56:51,254 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-12 10:56:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 289 transitions. [2022-07-12 10:56:51,255 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 289 transitions. Word has length 106 [2022-07-12 10:56:51,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:51,256 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 289 transitions. [2022-07-12 10:56:51,256 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-12 10:56:51,256 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 289 transitions. [2022-07-12 10:56:51,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-12 10:56:51,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:51,257 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-12 10:56:51,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 10:56:51,258 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:51,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:51,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1243987805, now seen corresponding path program 1 times [2022-07-12 10:56:51,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:51,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148914833] [2022-07-12 10:56:51,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:51,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:56:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:56:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:56:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:56:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:56:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 10:56:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 10:56:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 10:56:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,552 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-12 10:56:51,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:51,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148914833] [2022-07-12 10:56:51,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148914833] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:51,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105319468] [2022-07-12 10:56:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:51,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:51,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:51,556 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:51,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 10:56:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 2719 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 10:56:52,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:52,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:56:52,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:56:52,742 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-12 10:56:52,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:56:53,260 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-12 10:56:53,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:53,278 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:56:53,278 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-12 10:56:53,287 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:56:53,288 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-12 10:56:53,392 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-12 10:56:53,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105319468] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:56:53,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:56:53,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 13] total 29 [2022-07-12 10:56:53,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517305011] [2022-07-12 10:56:53,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:56:53,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 10:56:53,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:53,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 10:56:53,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2022-07-12 10:56:53,395 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-12 10:56:55,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:55,566 INFO L93 Difference]: Finished difference Result 528 states and 654 transitions. [2022-07-12 10:56:55,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 10:56:55,567 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-12 10:56:55,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:55,568 INFO L225 Difference]: With dead ends: 528 [2022-07-12 10:56:55,568 INFO L226 Difference]: Without dead ends: 311 [2022-07-12 10:56:55,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 223 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=310, Invalid=2140, Unknown=0, NotChecked=0, Total=2450 [2022-07-12 10:56:55,571 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 320 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 2113 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 2648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 2113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 350 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:55,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1123 Invalid, 2648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 2113 Invalid, 0 Unknown, 350 Unchecked, 1.5s Time] [2022-07-12 10:56:55,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-07-12 10:56:55,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 260. [2022-07-12 10:56:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 191 states have (on average 1.1465968586387434) internal successors, (219), 197 states have internal predecessors, (219), 44 states have call successors, (44), 21 states have call predecessors, (44), 24 states have return successors, (59), 41 states have call predecessors, (59), 43 states have call successors, (59) [2022-07-12 10:56:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 322 transitions. [2022-07-12 10:56:55,589 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 322 transitions. Word has length 110 [2022-07-12 10:56:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:55,589 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 322 transitions. [2022-07-12 10:56:55,590 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-12 10:56:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 322 transitions. [2022-07-12 10:56:55,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-12 10:56:55,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:55,591 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-12 10:56:55,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:55,815 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-12 10:56:55,815 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:55,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:55,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1605325207, now seen corresponding path program 1 times [2022-07-12 10:56:55,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:55,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024029552] [2022-07-12 10:56:55,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:55,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:55,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:56:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:56:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:56:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:56:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:56:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:56:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 10:56:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 10:56:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,162 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-12 10:56:56,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:56,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024029552] [2022-07-12 10:56:56,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024029552] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:56,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944524172] [2022-07-12 10:56:56,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:56,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:56,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:56,165 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:56,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 10:56:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 2733 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-12 10:56:56,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:57,228 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-12 10:56:57,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:56:57,516 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 10:56:57,516 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-12 10:56:57,609 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 10:56:57,609 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-12 10:56:57,672 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-12 10:56:57,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944524172] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:56:57,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:56:57,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 12] total 28 [2022-07-12 10:56:57,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76511717] [2022-07-12 10:56:57,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:56:57,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 10:56:57,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:57,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 10:56:57,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2022-07-12 10:56:57,675 INFO L87 Difference]: Start difference. First operand 260 states and 322 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-12 10:56:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:58,856 INFO L93 Difference]: Finished difference Result 578 states and 723 transitions. [2022-07-12 10:56:58,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 10:56:58,857 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-12 10:56:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:58,860 INFO L225 Difference]: With dead ends: 578 [2022-07-12 10:56:58,860 INFO L226 Difference]: Without dead ends: 337 [2022-07-12 10:56:58,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=1464, Unknown=0, NotChecked=0, Total=1640 [2022-07-12 10:56:58,861 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 174 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 402 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:58,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1394 Invalid, 1847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1364 Invalid, 0 Unknown, 402 Unchecked, 0.8s Time] [2022-07-12 10:56:58,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-07-12 10:56:58,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 290. [2022-07-12 10:56:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 215 states have (on average 1.1395348837209303) internal successors, (245), 223 states have internal predecessors, (245), 46 states have call successors, (46), 23 states have call predecessors, (46), 28 states have return successors, (71), 43 states have call predecessors, (71), 45 states have call successors, (71) [2022-07-12 10:56:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 362 transitions. [2022-07-12 10:56:58,880 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 362 transitions. Word has length 111 [2022-07-12 10:56:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:58,880 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 362 transitions. [2022-07-12 10:56:58,880 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-12 10:56:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 362 transitions. [2022-07-12 10:56:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 10:56:58,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:58,882 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-12 10:56:58,915 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-12 10:56:59,103 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-12 10:56:59,103 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:59,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:59,103 INFO L85 PathProgramCache]: Analyzing trace with hash -565160349, now seen corresponding path program 1 times [2022-07-12 10:56:59,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:59,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956182901] [2022-07-12 10:56:59,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:59,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:56:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:56:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:56:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:56:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:56:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:56:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 10:56:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 10:56:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 10:56:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,469 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-12 10:56:59,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:59,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956182901] [2022-07-12 10:56:59,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956182901] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:59,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154276409] [2022-07-12 10:56:59,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:59,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:59,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:59,471 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:59,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 10:57:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 2754 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-12 10:57:00,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:00,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:57:00,738 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-12 10:57:00,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:57:05,952 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 10:57:05,952 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-12 10:57:05,979 INFO L356 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-07-12 10:57:05,980 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-12 10:57:06,164 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-12 10:57:06,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154276409] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:57:06,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:57:06,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15] total 36 [2022-07-12 10:57:06,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844421087] [2022-07-12 10:57:06,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:57:06,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-12 10:57:06,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:06,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-12 10:57:06,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 10:57:06,169 INFO L87 Difference]: Start difference. First operand 290 states and 362 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-12 10:57:09,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:09,160 INFO L93 Difference]: Finished difference Result 648 states and 841 transitions. [2022-07-12 10:57:09,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-12 10:57:09,160 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-12 10:57:09,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:09,163 INFO L225 Difference]: With dead ends: 648 [2022-07-12 10:57:09,163 INFO L226 Difference]: Without dead ends: 381 [2022-07-12 10:57:09,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=356, Invalid=2836, Unknown=0, NotChecked=0, Total=3192 [2022-07-12 10:57:09,169 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 424 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 2782 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 3909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 2782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 959 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:09,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1330 Invalid, 3909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 2782 Invalid, 0 Unknown, 959 Unchecked, 2.0s Time] [2022-07-12 10:57:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-07-12 10:57:09,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 339. [2022-07-12 10:57:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 251 states have (on average 1.1354581673306774) internal successors, (285), 261 states have internal predecessors, (285), 54 states have call successors, (54), 25 states have call predecessors, (54), 33 states have return successors, (107), 52 states have call predecessors, (107), 53 states have call successors, (107) [2022-07-12 10:57:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 446 transitions. [2022-07-12 10:57:09,192 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 446 transitions. Word has length 112 [2022-07-12 10:57:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:09,193 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 446 transitions. [2022-07-12 10:57:09,193 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-12 10:57:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 446 transitions. [2022-07-12 10:57:09,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 10:57:09,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:09,195 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-12 10:57:09,222 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-12 10:57:09,411 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-12 10:57:09,411 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:09,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:09,412 INFO L85 PathProgramCache]: Analyzing trace with hash 389589933, now seen corresponding path program 1 times [2022-07-12 10:57:09,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:09,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540205036] [2022-07-12 10:57:09,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:09,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:57:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:57:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:57:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:57:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:57:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:57:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:57:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 10:57:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 10:57:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,597 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-12 10:57:09,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:09,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540205036] [2022-07-12 10:57:09,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540205036] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:09,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198763360] [2022-07-12 10:57:09,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:09,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:09,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:09,604 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:09,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 10:57:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 2763 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 10:57:10,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:10,130 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-12 10:57:10,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:57:10,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198763360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:10,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:57:10,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-12 10:57:10,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349766606] [2022-07-12 10:57:10,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:10,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:57:10,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:10,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:57:10,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:57:10,132 INFO L87 Difference]: Start difference. First operand 339 states and 446 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-12 10:57:10,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:10,159 INFO L93 Difference]: Finished difference Result 430 states and 545 transitions. [2022-07-12 10:57:10,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:57:10,160 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-12 10:57:10,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:10,162 INFO L225 Difference]: With dead ends: 430 [2022-07-12 10:57:10,162 INFO L226 Difference]: Without dead ends: 294 [2022-07-12 10:57:10,162 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-12 10:57:10,163 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-12 10:57:10,163 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-12 10:57:10,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-12 10:57:10,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 288. [2022-07-12 10:57:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 211 states have (on average 1.1232227488151658) internal successors, (237), 216 states have internal predecessors, (237), 50 states have call successors, (50), 23 states have call predecessors, (50), 26 states have return successors, (78), 48 states have call predecessors, (78), 49 states have call successors, (78) [2022-07-12 10:57:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 365 transitions. [2022-07-12 10:57:10,183 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 365 transitions. Word has length 113 [2022-07-12 10:57:10,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:10,184 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 365 transitions. [2022-07-12 10:57:10,184 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-12 10:57:10,184 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 365 transitions. [2022-07-12 10:57:10,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 10:57:10,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:10,186 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-12 10:57:10,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-12 10:57:10,399 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-12 10:57:10,399 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:10,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:10,400 INFO L85 PathProgramCache]: Analyzing trace with hash -868673934, now seen corresponding path program 1 times [2022-07-12 10:57:10,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:10,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874513395] [2022-07-12 10:57:10,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:10,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:57:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:57:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:57:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:57:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:57:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:57:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:57:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 10:57:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 10:57:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,709 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-12 10:57:10,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:10,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874513395] [2022-07-12 10:57:10,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874513395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:10,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:10,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:57:10,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780903545] [2022-07-12 10:57:10,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:10,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:57:10,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:10,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:57:10,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:57:10,712 INFO L87 Difference]: Start difference. First operand 288 states and 365 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-12 10:57:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:11,413 INFO L93 Difference]: Finished difference Result 296 states and 373 transitions. [2022-07-12 10:57:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 10:57:11,413 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-12 10:57:11,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:11,415 INFO L225 Difference]: With dead ends: 296 [2022-07-12 10:57:11,415 INFO L226 Difference]: Without dead ends: 294 [2022-07-12 10:57:11,415 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-12 10:57:11,416 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 113 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:11,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 850 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 10:57:11,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-12 10:57:11,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 288. [2022-07-12 10:57:11,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 211 states have (on average 1.1232227488151658) internal successors, (237), 216 states have internal predecessors, (237), 50 states have call successors, (50), 23 states have call predecessors, (50), 26 states have return successors, (78), 48 states have call predecessors, (78), 49 states have call successors, (78) [2022-07-12 10:57:11,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 365 transitions. [2022-07-12 10:57:11,436 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 365 transitions. Word has length 115 [2022-07-12 10:57:11,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:11,436 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 365 transitions. [2022-07-12 10:57:11,436 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-12 10:57:11,436 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 365 transitions. [2022-07-12 10:57:11,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 10:57:11,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:11,438 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-12 10:57:11,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 10:57:11,439 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:11,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:11,439 INFO L85 PathProgramCache]: Analyzing trace with hash -167609356, now seen corresponding path program 1 times [2022-07-12 10:57:11,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:11,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658301271] [2022-07-12 10:57:11,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:11,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:57:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:57:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:57:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:57:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:57:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:57:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:57:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 10:57:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 10:57:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:11,801 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-12 10:57:11,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:11,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658301271] [2022-07-12 10:57:11,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658301271] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:11,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423279112] [2022-07-12 10:57:11,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:11,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:11,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:11,804 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:11,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 10:57:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:12,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 2783 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 10:57:12,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:12,893 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-12 10:57:12,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:57:13,126 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 10:57:13,126 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-12 10:57:13,214 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 10:57:13,215 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-12 10:57:13,285 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-12 10:57:13,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423279112] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:57:13,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:57:13,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 11] total 28 [2022-07-12 10:57:13,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073854248] [2022-07-12 10:57:13,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:57:13,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 10:57:13,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:13,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 10:57:13,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2022-07-12 10:57:13,288 INFO L87 Difference]: Start difference. First operand 288 states and 365 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-12 10:57:15,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:15,488 INFO L93 Difference]: Finished difference Result 595 states and 759 transitions. [2022-07-12 10:57:15,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-12 10:57:15,488 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-12 10:57:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:15,490 INFO L225 Difference]: With dead ends: 595 [2022-07-12 10:57:15,490 INFO L226 Difference]: Without dead ends: 330 [2022-07-12 10:57:15,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 237 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=274, Invalid=1982, Unknown=0, NotChecked=0, Total=2256 [2022-07-12 10:57:15,493 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 376 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 474 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:15,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1130 Invalid, 3005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 2344 Invalid, 0 Unknown, 474 Unchecked, 1.5s Time] [2022-07-12 10:57:15,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-07-12 10:57:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 274. [2022-07-12 10:57:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 198 states have (on average 1.1262626262626263) internal successors, (223), 203 states have internal predecessors, (223), 50 states have call successors, (50), 22 states have call predecessors, (50), 25 states have return successors, (71), 48 states have call predecessors, (71), 49 states have call successors, (71) [2022-07-12 10:57:15,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 344 transitions. [2022-07-12 10:57:15,515 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 344 transitions. Word has length 115 [2022-07-12 10:57:15,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:15,516 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 344 transitions. [2022-07-12 10:57:15,516 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-12 10:57:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 344 transitions. [2022-07-12 10:57:15,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 10:57:15,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:15,518 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-12 10:57:15,551 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-12 10:57:15,731 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-12 10:57:15,731 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:15,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:15,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1981097108, now seen corresponding path program 1 times [2022-07-12 10:57:15,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:15,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981075883] [2022-07-12 10:57:15,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:15,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:57:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:57:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:57:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:57:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:57:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:57:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 10:57:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:57:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 10:57:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 10:57:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,134 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-12 10:57:16,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:16,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981075883] [2022-07-12 10:57:16,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981075883] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:16,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283036422] [2022-07-12 10:57:16,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:16,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:16,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:16,140 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:16,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 10:57:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 2856 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-12 10:57:16,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:16,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:57:16,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:57:16,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:16,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:16,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:16,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:16,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:16,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:16,792 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-12 10:57:16,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:16,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:16,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:16,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:16,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:16,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:16,801 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-12 10:57:17,200 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-12 10:57:17,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:57:17,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283036422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:17,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:57:17,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11] total 23 [2022-07-12 10:57:17,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734305793] [2022-07-12 10:57:17,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:17,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 10:57:17,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:17,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 10:57:17,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-07-12 10:57:17,203 INFO L87 Difference]: Start difference. First operand 274 states and 344 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-12 10:57:17,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:17,764 INFO L93 Difference]: Finished difference Result 417 states and 513 transitions. [2022-07-12 10:57:17,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 10:57:17,765 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-12 10:57:17,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:17,766 INFO L225 Difference]: With dead ends: 417 [2022-07-12 10:57:17,766 INFO L226 Difference]: Without dead ends: 307 [2022-07-12 10:57:17,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2022-07-12 10:57:17,767 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 136 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:17,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 562 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 497 Invalid, 0 Unknown, 191 Unchecked, 0.4s Time] [2022-07-12 10:57:17,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-07-12 10:57:17,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 282. [2022-07-12 10:57:17,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 204 states have (on average 1.1323529411764706) internal successors, (231), 209 states have internal predecessors, (231), 52 states have call successors, (52), 23 states have call predecessors, (52), 25 states have return successors, (76), 49 states have call predecessors, (76), 51 states have call successors, (76) [2022-07-12 10:57:17,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 359 transitions. [2022-07-12 10:57:17,787 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 359 transitions. Word has length 122 [2022-07-12 10:57:17,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:17,788 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 359 transitions. [2022-07-12 10:57:17,788 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-12 10:57:17,788 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 359 transitions. [2022-07-12 10:57:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 10:57:17,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:17,790 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-12 10:57:17,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 10:57:18,007 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-12 10:57:18,007 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:18,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:18,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1034006510, now seen corresponding path program 1 times [2022-07-12 10:57:18,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:18,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557590446] [2022-07-12 10:57:18,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:18,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:18,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:18,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:18,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:57:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:18,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:57:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:18,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:57:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:18,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:57:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:18,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:57:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:18,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:18,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:57:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:18,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 10:57:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:18,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:18,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:18,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:57:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:18,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 10:57:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:18,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 10:57:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:18,441 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-12 10:57:18,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:18,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557590446] [2022-07-12 10:57:18,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557590446] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:18,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900098888] [2022-07-12 10:57:18,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:18,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:18,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:18,444 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:18,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 10:57:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:18,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 2851 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-12 10:57:19,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:19,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:19,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:19,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:19,143 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 10:57:19,143 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-12 10:57:19,176 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-12 10:57:19,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:57:19,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900098888] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:19,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:57:19,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-12 10:57:19,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432120163] [2022-07-12 10:57:19,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:19,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:57:19,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:19,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:57:19,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-07-12 10:57:19,179 INFO L87 Difference]: Start difference. First operand 282 states and 359 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-12 10:57:19,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:19,435 INFO L93 Difference]: Finished difference Result 466 states and 589 transitions. [2022-07-12 10:57:19,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:57:19,435 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-12 10:57:19,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:19,437 INFO L225 Difference]: With dead ends: 466 [2022-07-12 10:57:19,437 INFO L226 Difference]: Without dead ends: 280 [2022-07-12 10:57:19,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-07-12 10:57:19,438 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-12 10:57:19,439 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-12 10:57:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-12 10:57:19,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 274. [2022-07-12 10:57:19,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 198 states have (on average 1.1161616161616161) internal successors, (221), 203 states have internal predecessors, (221), 50 states have call successors, (50), 22 states have call predecessors, (50), 25 states have return successors, (71), 48 states have call predecessors, (71), 49 states have call successors, (71) [2022-07-12 10:57:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 342 transitions. [2022-07-12 10:57:19,458 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 342 transitions. Word has length 122 [2022-07-12 10:57:19,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:19,458 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 342 transitions. [2022-07-12 10:57:19,459 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-12 10:57:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 342 transitions. [2022-07-12 10:57:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 10:57:19,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:19,460 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-12 10:57:19,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-12 10:57:19,687 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-12 10:57:19,687 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:19,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:19,688 INFO L85 PathProgramCache]: Analyzing trace with hash -105137170, now seen corresponding path program 1 times [2022-07-12 10:57:19,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:19,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811364635] [2022-07-12 10:57:19,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:19,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:19,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:19,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:19,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:57:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:19,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:57:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:19,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:57:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:19,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:57:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:19,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:57:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:19,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:19,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:57:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:20,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 10:57:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:20,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 10:57:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:20,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 10:57:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:20,052 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-12 10:57:20,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:20,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811364635] [2022-07-12 10:57:20,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811364635] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:20,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242601801] [2022-07-12 10:57:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:20,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:20,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:20,055 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:20,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-12 10:57:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:20,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 2804 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-12 10:57:20,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:20,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:57:20,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:20,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:20,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:20,710 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 10:57:20,711 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-12 10:57:21,133 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-12 10:57:21,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:57:21,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242601801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:21,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:57:21,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2022-07-12 10:57:21,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562269127] [2022-07-12 10:57:21,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:21,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:57:21,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:21,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:57:21,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2022-07-12 10:57:21,136 INFO L87 Difference]: Start difference. First operand 274 states and 342 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-12 10:57:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:21,222 INFO L93 Difference]: Finished difference Result 416 states and 503 transitions. [2022-07-12 10:57:21,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:57:21,223 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-12 10:57:21,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:21,225 INFO L225 Difference]: With dead ends: 416 [2022-07-12 10:57:21,225 INFO L226 Difference]: Without dead ends: 289 [2022-07-12 10:57:21,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-07-12 10:57:21,226 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 35 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:21,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1738 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 162 Unchecked, 0.0s Time] [2022-07-12 10:57:21,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-12 10:57:21,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-07-12 10:57:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 212 states have (on average 1.1084905660377358) internal successors, (235), 216 states have internal predecessors, (235), 51 states have call successors, (51), 24 states have call predecessors, (51), 25 states have return successors, (72), 48 states have call predecessors, (72), 50 states have call successors, (72) [2022-07-12 10:57:21,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 358 transitions. [2022-07-12 10:57:21,246 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 358 transitions. Word has length 120 [2022-07-12 10:57:21,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:21,246 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 358 transitions. [2022-07-12 10:57:21,247 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-12 10:57:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 358 transitions. [2022-07-12 10:57:21,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 10:57:21,248 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:21,248 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-12 10:57:21,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-12 10:57:21,459 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-12 10:57:21,459 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:21,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash -105996951, now seen corresponding path program 1 times [2022-07-12 10:57:21,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:21,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031706160] [2022-07-12 10:57:21,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:21,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:21,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:21,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:21,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:57:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:21,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:57:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:21,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:57:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:21,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:57:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:21,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:57:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:21,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:21,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:57:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:21,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 10:57:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:21,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 10:57:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:21,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 10:57:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:21,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 10:57:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:21,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 10:57:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:21,725 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-12 10:57:21,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:21,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031706160] [2022-07-12 10:57:21,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031706160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:21,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:21,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:57:21,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288596493] [2022-07-12 10:57:21,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:21,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:57:21,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:21,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:57:21,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:57:21,728 INFO L87 Difference]: Start difference. First operand 289 states and 358 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-12 10:57:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:22,242 INFO L93 Difference]: Finished difference Result 301 states and 372 transitions. [2022-07-12 10:57:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:57:22,243 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-12 10:57:22,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:22,244 INFO L225 Difference]: With dead ends: 301 [2022-07-12 10:57:22,244 INFO L226 Difference]: Without dead ends: 299 [2022-07-12 10:57:22,245 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-12 10:57:22,245 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-12 10:57:22,245 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-12 10:57:22,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-12 10:57:22,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 298. [2022-07-12 10:57:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 218 states have (on average 1.1055045871559632) internal successors, (241), 223 states have internal predecessors, (241), 52 states have call successors, (52), 25 states have call predecessors, (52), 27 states have return successors, (76), 49 states have call predecessors, (76), 51 states have call successors, (76) [2022-07-12 10:57:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 369 transitions. [2022-07-12 10:57:22,265 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 369 transitions. Word has length 124 [2022-07-12 10:57:22,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:22,266 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 369 transitions. [2022-07-12 10:57:22,266 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-12 10:57:22,266 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 369 transitions. [2022-07-12 10:57:22,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-12 10:57:22,267 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:22,267 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-12 10:57:22,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 10:57:22,268 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:22,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:22,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1905145871, now seen corresponding path program 1 times [2022-07-12 10:57:22,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:22,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885577302] [2022-07-12 10:57:22,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:22,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:22,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:22,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:22,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:57:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:22,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:57:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:22,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:57:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:22,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:57:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:22,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:57:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:22,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:22,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:57:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:22,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 10:57:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:22,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 10:57:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:22,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 10:57:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:22,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 10:57:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:22,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 10:57:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:22,698 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-12 10:57:22,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:22,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885577302] [2022-07-12 10:57:22,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885577302] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:22,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163749386] [2022-07-12 10:57:22,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:22,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:22,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:22,704 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:22,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-12 10:57:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:23,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 2832 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-12 10:57:23,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:23,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:57:23,605 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 10:57:23,605 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-12 10:57:23,611 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-12 10:57:23,725 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-12 10:57:23,729 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-12 10:57:23,733 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-12 10:57:23,736 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-12 10:57:23,740 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-12 10:57:23,743 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-12 10:57:23,766 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 10:57:23,767 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-12 10:57:23,776 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-12 10:57:23,883 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 10:57:23,883 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-12 10:57:23,923 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 10:57:23,924 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-12 10:57:25,205 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-12 10:57:25,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:57:25,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163749386] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:25,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:57:25,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 28] total 37 [2022-07-12 10:57:25,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024409118] [2022-07-12 10:57:25,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:57:25,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-12 10:57:25,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:25,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-12 10:57:25,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1581, Unknown=9, NotChecked=510, Total=2256 [2022-07-12 10:57:25,853 INFO L87 Difference]: Start difference. First operand 298 states and 369 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-12 10:57:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:26,984 INFO L93 Difference]: Finished difference Result 590 states and 728 transitions. [2022-07-12 10:57:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 10:57:26,984 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-12 10:57:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:26,986 INFO L225 Difference]: With dead ends: 590 [2022-07-12 10:57:26,986 INFO L226 Difference]: Without dead ends: 322 [2022-07-12 10:57:26,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 171 SyntacticMatches, 11 SemanticMatches, 59 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=232, Invalid=2741, Unknown=21, NotChecked=666, Total=3660 [2022-07-12 10:57:26,989 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 128 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 3011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1837 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:26,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 844 Invalid, 3011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1122 Invalid, 0 Unknown, 1837 Unchecked, 0.7s Time] [2022-07-12 10:57:26,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-07-12 10:57:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 312. [2022-07-12 10:57:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 227 states have (on average 1.1013215859030836) internal successors, (250), 233 states have internal predecessors, (250), 55 states have call successors, (55), 27 states have call predecessors, (55), 29 states have return successors, (80), 51 states have call predecessors, (80), 54 states have call successors, (80) [2022-07-12 10:57:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 385 transitions. [2022-07-12 10:57:27,011 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 385 transitions. Word has length 128 [2022-07-12 10:57:27,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:27,011 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 385 transitions. [2022-07-12 10:57:27,012 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-12 10:57:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 385 transitions. [2022-07-12 10:57:27,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-12 10:57:27,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:27,013 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-12 10:57:27,045 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-12 10:57:27,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-12 10:57:27,227 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:27,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:27,228 INFO L85 PathProgramCache]: Analyzing trace with hash 665588731, now seen corresponding path program 2 times [2022-07-12 10:57:27,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:27,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699861017] [2022-07-12 10:57:27,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:27,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:57:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:57:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:57:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:57:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:57:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:57:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 10:57:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:57:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 10:57:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 10:57:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 10:57:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:27,666 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-12 10:57:27,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:27,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699861017] [2022-07-12 10:57:27,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699861017] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:27,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125013474] [2022-07-12 10:57:27,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:57:27,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:27,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:27,667 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:27,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-12 10:57:28,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:57:28,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:57:28,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 2851 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-12 10:57:28,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:28,401 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 10:57:28,401 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-12 10:57:28,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:28,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 10:57:28,849 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:57:28,849 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-12 10:57:29,150 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-12 10:57:29,153 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-12 10:57:29,157 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-12 10:57:29,160 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-12 10:57:29,166 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-12 10:57:29,171 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-12 10:57:29,174 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-12 10:57:29,190 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 10:57:29,190 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-12 10:57:29,198 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-12 10:57:29,273 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 10:57:29,273 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-12 10:57:29,310 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 10:57:29,310 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-12 10:57:29,942 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-12 10:57:29,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:57:30,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125013474] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:30,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:57:30,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 29] total 39 [2022-07-12 10:57:30,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117697656] [2022-07-12 10:57:30,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:57:30,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-12 10:57:30,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:30,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-12 10:57:30,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1510, Unknown=9, NotChecked=588, Total=2256 [2022-07-12 10:57:30,491 INFO L87 Difference]: Start difference. First operand 312 states and 385 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-12 10:57:32,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:32,374 INFO L93 Difference]: Finished difference Result 646 states and 795 transitions. [2022-07-12 10:57:32,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-12 10:57:32,374 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-12 10:57:32,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:32,376 INFO L225 Difference]: With dead ends: 646 [2022-07-12 10:57:32,376 INFO L226 Difference]: Without dead ends: 378 [2022-07-12 10:57:32,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 173 SyntacticMatches, 16 SemanticMatches, 67 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=299, Invalid=3488, Unknown=23, NotChecked=882, Total=4692 [2022-07-12 10:57:32,380 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 189 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 2039 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 4790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2694 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:32,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1753 Invalid, 4790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2039 Invalid, 0 Unknown, 2694 Unchecked, 1.2s Time] [2022-07-12 10:57:32,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-07-12 10:57:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 346. [2022-07-12 10:57:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 253 states have (on average 1.1067193675889329) internal successors, (280), 259 states have internal predecessors, (280), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (84), 54 states have call predecessors, (84), 57 states have call successors, (84) [2022-07-12 10:57:32,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 422 transitions. [2022-07-12 10:57:32,402 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 422 transitions. Word has length 129 [2022-07-12 10:57:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:32,402 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 422 transitions. [2022-07-12 10:57:32,402 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-12 10:57:32,402 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 422 transitions. [2022-07-12 10:57:32,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-12 10:57:32,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:32,404 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-12 10:57:32,438 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-12 10:57:32,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:32,627 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:32,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:32,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1246017231, now seen corresponding path program 3 times [2022-07-12 10:57:32,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:32,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888772964] [2022-07-12 10:57:32,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:32,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:32,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:32,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:32,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:57:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:32,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:57:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:32,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:57:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:32,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:57:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:32,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:57:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:32,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:32,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:57:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:33,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:57:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:33,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 10:57:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:33,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:57:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:33,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 10:57:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:33,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 10:57:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:33,098 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-12 10:57:33,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:33,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888772964] [2022-07-12 10:57:33,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888772964] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:33,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147253322] [2022-07-12 10:57:33,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 10:57:33,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:33,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:33,100 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:33,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-12 10:57:45,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-12 10:57:45,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:57:45,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 2870 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 10:57:45,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:45,208 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-12 10:57:45,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:57:45,629 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-12 10:57:45,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147253322] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:57:45,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:57:45,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2022-07-12 10:57:45,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80631696] [2022-07-12 10:57:45,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:57:45,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 10:57:45,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:45,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 10:57:45,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2022-07-12 10:57:45,632 INFO L87 Difference]: Start difference. First operand 346 states and 422 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-12 10:57:50,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:50,558 INFO L93 Difference]: Finished difference Result 626 states and 770 transitions. [2022-07-12 10:57:50,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 10:57:50,559 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-12 10:57:50,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:50,561 INFO L225 Difference]: With dead ends: 626 [2022-07-12 10:57:50,561 INFO L226 Difference]: Without dead ends: 356 [2022-07-12 10:57:50,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=572, Invalid=1234, Unknown=0, NotChecked=0, Total=1806 [2022-07-12 10:57:50,563 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 156 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:50,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 919 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 10:57:50,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-07-12 10:57:50,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2022-07-12 10:57:50,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 263 states have (on average 1.102661596958175) internal successors, (290), 269 states have internal predecessors, (290), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (84), 54 states have call predecessors, (84), 57 states have call successors, (84) [2022-07-12 10:57:50,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 432 transitions. [2022-07-12 10:57:50,587 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 432 transitions. Word has length 130 [2022-07-12 10:57:50,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:50,587 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 432 transitions. [2022-07-12 10:57:50,587 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-12 10:57:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 432 transitions. [2022-07-12 10:57:50,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-12 10:57:50,589 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:50,589 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-12 10:57:50,609 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-12 10:57:50,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-07-12 10:57:50,809 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:50,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:50,809 INFO L85 PathProgramCache]: Analyzing trace with hash -446619791, now seen corresponding path program 4 times [2022-07-12 10:57:50,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:50,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213141461] [2022-07-12 10:57:50,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:50,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:50,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:50,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:50,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:57:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:50,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:57:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:50,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:57:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:50,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:57:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:50,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:57:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:50,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:57:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 10:57:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 10:57:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 10:57:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 10:57:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 10:57:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:51,541 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-12 10:57:51,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:51,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213141461] [2022-07-12 10:57:51,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213141461] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:51,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762222747] [2022-07-12 10:57:51,542 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 10:57:51,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:51,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:51,545 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:51,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-12 10:57:52,205 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 10:57:52,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:57:52,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 3060 conjuncts, 96 conjunts are in the unsatisfiable core [2022-07-12 10:57:52,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:52,234 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 10:57:52,235 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-12 10:57:53,029 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:57:53,029 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-12 10:57:53,044 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 10:57:53,045 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-12 10:57:53,050 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-12 10:57:53,233 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-12 10:57:53,240 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-12 10:57:53,244 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-12 10:57:53,247 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-12 10:57:53,251 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-12 10:57:53,254 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-12 10:57:53,257 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-12 10:57:53,260 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-12 10:57:53,264 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-12 10:57:53,267 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-12 10:57:53,271 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-12 10:57:53,274 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-12 10:57:53,277 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-12 10:57:53,280 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-12 10:57:53,283 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-12 10:57:53,287 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-12 10:57:53,290 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-12 10:57:53,293 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-12 10:57:53,305 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-12 10:57:53,387 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-12 10:57:53,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:53,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:53,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:53,434 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 10:57:53,435 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-12 10:57:55,530 WARN L855 $PredicateComparison]: unable to prove that (or (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 (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#buf~3#1.base_BEFORE_CALL_91|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_49|) 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|)))) (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 (= (mod (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_49|) 0) 18446744073709551616) 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|)) (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))))))) is different from true [2022-07-12 10:57:57,059 WARN L855 $PredicateComparison]: unable to prove that (or (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 (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#buf~3#1.base_BEFORE_CALL_92|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_50|) 0)) (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|)))) (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|)) (= (mod (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_50|) 0) 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-12 10:57:59,257 WARN L855 $PredicateComparison]: unable to prove that (or (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 (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|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#buf~3#1.base_BEFORE_CALL_93|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_51|) 0)))) (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 (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|)))) (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|)) (= (mod (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_copy_from_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_51|) 0) 18446744073709551616) 0)))) is different from true [2022-07-12 10:58:04,909 WARN L233 SmtUtils]: Spent 5.57s on a formula simplification. DAG size of input: 34 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 10:58:19,193 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-12 10:58:19,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:58:26,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762222747] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:58:26,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:58:26,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 42] total 63 [2022-07-12 10:58:26,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145853643] [2022-07-12 10:58:26,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:58:26,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-12 10:58:26,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:58:26,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-12 10:58:26,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2612, Unknown=26, NotChecked=2562, Total=5402 [2022-07-12 10:58:26,147 INFO L87 Difference]: Start difference. First operand 356 states and 432 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-12 10:58:32,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:58:32,366 INFO L93 Difference]: Finished difference Result 629 states and 766 transitions. [2022-07-12 10:58:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 10:58:32,367 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-12 10:58:32,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:58:32,368 INFO L225 Difference]: With dead ends: 629 [2022-07-12 10:58:32,368 INFO L226 Difference]: Without dead ends: 361 [2022-07-12 10:58:32,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 169 SyntacticMatches, 11 SemanticMatches, 96 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 37.3s TimeCoverageRelationStatistics Valid=329, Invalid=5542, Unknown=65, NotChecked=3570, Total=9506 [2022-07-12 10:58:32,372 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 105 mSDsluCounter, 2465 mSDsCounter, 0 mSdLazyCounter, 2876 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 2642 SdHoareTripleChecker+Invalid, 9929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7000 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 10:58:32,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 2642 Invalid, 9929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2876 Invalid, 0 Unknown, 7000 Unchecked, 1.6s Time] [2022-07-12 10:58:32,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-07-12 10:58:32,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 357. [2022-07-12 10:58:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 264 states have (on average 1.1022727272727273) internal successors, (291), 270 states have internal predecessors, (291), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (84), 54 states have call predecessors, (84), 57 states have call successors, (84) [2022-07-12 10:58:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 433 transitions. [2022-07-12 10:58:32,397 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 433 transitions. Word has length 140 [2022-07-12 10:58:32,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:58:32,398 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 433 transitions. [2022-07-12 10:58:32,398 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-12 10:58:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 433 transitions. [2022-07-12 10:58:32,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-12 10:58:32,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:58:32,400 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-12 10:58:32,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-12 10:58:32,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:58:32,615 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:58:32,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:58:32,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1364743045, now seen corresponding path program 5 times [2022-07-12 10:58:32,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:58:32,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118552403] [2022-07-12 10:58:32,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:32,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:58:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:32,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:58:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:32,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:58:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:32,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 10:58:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:32,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 10:58:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:32,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 10:58:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:32,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 10:58:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:32,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 10:58:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:32,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:58:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:32,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:58:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:33,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:58:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:33,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 10:58:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:33,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 10:58:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:33,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 10:58:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:33,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 10:58:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:33,359 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-12 10:58:33,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:58:33,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118552403] [2022-07-12 10:58:33,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118552403] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:58:33,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002982286] [2022-07-12 10:58:33,360 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 10:58:33,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:58:33,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:58:33,362 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:58:33,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process