./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_c_str_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_eq_c_str_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 9e4ccc391c063e90fb229c8b3638d2f1089d6ba2ff288522cf06bf650b1be9e5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:52:52,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:52:52,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:52:52,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:52:52,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:52:52,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:52:52,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:52:52,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:52:52,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:52:52,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:52:52,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:52:52,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:52:52,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:52:52,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:52:52,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:52:52,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:52:52,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:52:52,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:52:52,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:52:52,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:52:52,788 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:52:52,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:52:52,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:52:52,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:52:52,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:52:52,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:52:52,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:52:52,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:52:52,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:52:52,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:52:52,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:52:52,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:52:52,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:52:52,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:52:52,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:52:52,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:52:52,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:52:52,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:52:52,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:52:52,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:52:52,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:52:52,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:52:52,805 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:52:52,827 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:52:52,827 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:52:52,827 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:52:52,828 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:52:52,828 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:52:52,828 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:52:52,829 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:52:52,829 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:52:52,829 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:52:52,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:52:52,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:52:52,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:52:52,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:52:52,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:52:52,830 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:52:52,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:52:52,831 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:52:52,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:52:52,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:52:52,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:52:52,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:52:52,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:52:52,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:52:52,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:52:52,833 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:52:52,833 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:52:52,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:52:52,833 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:52:52,833 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:52:52,833 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:52:52,833 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 -> 9e4ccc391c063e90fb229c8b3638d2f1089d6ba2ff288522cf06bf650b1be9e5 [2022-07-12 10:52:53,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:52:53,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:52:53,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:52:53,048 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:52:53,049 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:52:53,050 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_c_str_harness.i [2022-07-12 10:52:53,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee62ca072/4ab0fd5fef9c42b0a4e690285b8a4a69/FLAGd78705e4f [2022-07-12 10:52:53,699 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:52:53,700 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_c_str_harness.i [2022-07-12 10:52:53,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee62ca072/4ab0fd5fef9c42b0a4e690285b8a4a69/FLAGd78705e4f [2022-07-12 10:52:54,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee62ca072/4ab0fd5fef9c42b0a4e690285b8a4a69 [2022-07-12 10:52:54,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:52:54,133 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:52:54,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:52:54,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:52:54,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:52:54,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:52:54" (1/1) ... [2022-07-12 10:52:54,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f96de69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:52:54, skipping insertion in model container [2022-07-12 10:52:54,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:52:54" (1/1) ... [2022-07-12 10:52:54,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:52:54,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:52:54,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_c_str_harness.i[4495,4508] [2022-07-12 10:52:54,467 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_c_str_harness.i[4555,4568] [2022-07-12 10:52:55,178 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,180 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,182 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,183 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,183 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,194 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,195 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,197 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,197 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,458 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 10:52:55,460 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 10:52:55,461 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 10:52:55,461 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 10:52:55,463 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 10:52:55,465 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 10:52:55,465 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 10:52:55,466 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 10:52:55,467 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 10:52:55,468 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 10:52:55,575 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 10:52:55,650 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,657 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:52:55,765 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:52:55,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_c_str_harness.i[4495,4508] [2022-07-12 10:52:55,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_c_str_harness.i[4555,4568] [2022-07-12 10:52:55,821 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,821 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,822 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,823 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,823 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,833 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,834 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,835 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,836 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,868 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 10:52:55,868 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 10:52:55,869 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 10:52:55,869 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 10:52:55,870 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 10:52:55,870 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 10:52:55,871 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 10:52:55,871 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 10:52:55,871 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 10:52:55,871 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 10:52:55,891 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 10:52:55,956 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,956 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:52:55,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:52:56,119 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:52:56,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:52:56 WrapperNode [2022-07-12 10:52:56,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:52:56,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:52:56,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:52:56,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:52:56,129 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:52:56" (1/1) ... [2022-07-12 10:52:56,216 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:52:56" (1/1) ... [2022-07-12 10:52:56,285 INFO L137 Inliner]: procedures = 691, calls = 2639, calls flagged for inlining = 64, calls inlined = 10, statements flattened = 904 [2022-07-12 10:52:56,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:52:56,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:52:56,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:52:56,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:52:56,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:52:56" (1/1) ... [2022-07-12 10:52:56,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:52:56" (1/1) ... [2022-07-12 10:52:56,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:52:56" (1/1) ... [2022-07-12 10:52:56,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:52:56" (1/1) ... [2022-07-12 10:52:56,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:52:56" (1/1) ... [2022-07-12 10:52:56,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:52:56" (1/1) ... [2022-07-12 10:52:56,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:52:56" (1/1) ... [2022-07-12 10:52:56,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:52:56,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:52:56,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:52:56,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:52:56,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:52:56" (1/1) ... [2022-07-12 10:52:56,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:52:56,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:56,390 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:52:56,393 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:52:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq_c_str [2022-07-12 10:52:56,422 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq_c_str [2022-07-12 10:52:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-12 10:52:56,422 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-12 10:52:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:52:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 10:52:56,423 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 10:52:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:52:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 10:52:56,424 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 10:52:56,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 10:52:56,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:52:56,424 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2022-07-12 10:52:56,425 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2022-07-12 10:52:56,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 10:52:56,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:52:56,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:52:56,425 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 10:52:56,425 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 10:52:56,425 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-12 10:52:56,425 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-12 10:52:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 10:52:56,426 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 10:52:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:52:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 10:52:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 10:52:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-12 10:52:56,427 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-12 10:52:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 10:52:56,428 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 10:52:56,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:52:56,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:52:56,639 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:52:56,641 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:52:57,444 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:52:57,451 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:52:57,452 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 10:52:57,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:52:57 BoogieIcfgContainer [2022-07-12 10:52:57,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:52:57,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:52:57,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:52:57,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:52:57,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:52:54" (1/3) ... [2022-07-12 10:52:57,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c3c450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:52:57, skipping insertion in model container [2022-07-12 10:52:57,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:52:56" (2/3) ... [2022-07-12 10:52:57,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c3c450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:52:57, skipping insertion in model container [2022-07-12 10:52:57,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:52:57" (3/3) ... [2022-07-12 10:52:57,461 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_eq_c_str_harness.i [2022-07-12 10:52:57,471 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:52:57,471 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:52:57,518 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:52:57,525 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@5444ab9a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3630e0de [2022-07-12 10:52:57,526 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 10:52:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 96 states have internal predecessors, (118), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-07-12 10:52:57,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 10:52:57,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:57,549 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:52:57,549 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:57,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:57,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1244186500, now seen corresponding path program 1 times [2022-07-12 10:52:57,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:57,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817350786] [2022-07-12 10:52:57,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:57,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:52:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:52:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:52:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:52:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:52:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 10:52:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 10:52:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 10:52:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 10:52:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:52:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 10:52:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 10:52:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 10:52:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-07-12 10:52:58,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:58,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817350786] [2022-07-12 10:52:58,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817350786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:58,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:52:58,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 10:52:58,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497888130] [2022-07-12 10:52:58,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:58,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:52:58,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:58,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:52:58,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 10:52:58,279 INFO L87 Difference]: Start difference. First operand has 142 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 96 states have internal predecessors, (118), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 10:52:58,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:58,580 INFO L93 Difference]: Finished difference Result 281 states and 404 transitions. [2022-07-12 10:52:58,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:52:58,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2022-07-12 10:52:58,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:58,589 INFO L225 Difference]: With dead ends: 281 [2022-07-12 10:52:58,589 INFO L226 Difference]: Without dead ends: 139 [2022-07-12 10:52:58,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:52:58,612 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 119 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:58,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 254 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 10:52:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-12 10:52:58,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2022-07-12 10:52:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 91 states have internal predecessors, (110), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-12 10:52:58,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 181 transitions. [2022-07-12 10:52:58,668 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 181 transitions. Word has length 127 [2022-07-12 10:52:58,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:58,668 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 181 transitions. [2022-07-12 10:52:58,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 10:52:58,669 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 181 transitions. [2022-07-12 10:52:58,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 10:52:58,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:58,676 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:52:58,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:52:58,676 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:52:58,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:52:58,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1259852002, now seen corresponding path program 1 times [2022-07-12 10:52:58,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:52:58,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830475881] [2022-07-12 10:52:58,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:58,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:52:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:52:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:52:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:52:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:52:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:52:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:52:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:52:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:52:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 10:52:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 10:52:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 10:52:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 10:52:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:58,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:52:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:59,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 10:52:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:59,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 10:52:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:59,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:52:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:59,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:52:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:59,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 10:52:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-07-12 10:52:59,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:52:59,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830475881] [2022-07-12 10:52:59,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830475881] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:52:59,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342452500] [2022-07-12 10:52:59,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:52:59,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:52:59,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:52:59,040 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:52:59,041 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:52:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:52:59,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 2728 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 10:52:59,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:52:59,655 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-12 10:52:59,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:52:59,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342452500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:52:59,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:52:59,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-07-12 10:52:59,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79237184] [2022-07-12 10:52:59,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:52:59,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:52:59,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:52:59,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:52:59,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:52:59,660 INFO L87 Difference]: Start difference. First operand 137 states and 181 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 10:52:59,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:52:59,863 INFO L93 Difference]: Finished difference Result 244 states and 327 transitions. [2022-07-12 10:52:59,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 10:52:59,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 127 [2022-07-12 10:52:59,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:52:59,865 INFO L225 Difference]: With dead ends: 244 [2022-07-12 10:52:59,865 INFO L226 Difference]: Without dead ends: 140 [2022-07-12 10:52:59,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:52:59,867 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 208 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:52:59,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 368 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 10:52:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-12 10:52:59,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-07-12 10:52:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 92 states have (on average 1.2173913043478262) internal successors, (112), 94 states have internal predecessors, (112), 36 states have call successors, (36), 10 states have call predecessors, (36), 11 states have return successors, (37), 35 states have call predecessors, (37), 35 states have call successors, (37) [2022-07-12 10:52:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 185 transitions. [2022-07-12 10:52:59,893 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 185 transitions. Word has length 127 [2022-07-12 10:52:59,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:52:59,893 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 185 transitions. [2022-07-12 10:52:59,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 10:52:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 185 transitions. [2022-07-12 10:52:59,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-12 10:52:59,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:52:59,895 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:52:59,918 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:53:00,095 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:53:00,096 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:00,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:00,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2087307667, now seen corresponding path program 1 times [2022-07-12 10:53:00,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:00,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062108811] [2022-07-12 10:53:00,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:00,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:53:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:53:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:53:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:53:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:53:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 10:53:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:53:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 10:53:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:53:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 10:53:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 10:53:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 10:53:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 10:53:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-07-12 10:53:00,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:00,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062108811] [2022-07-12 10:53:00,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062108811] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:00,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123031419] [2022-07-12 10:53:00,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:00,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:00,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:53:00,449 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:53:00,450 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:53:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:00,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 2745 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 10:53:00,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:53:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-12 10:53:00,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:53:00,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123031419] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:53:00,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:53:00,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-12 10:53:00,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958309411] [2022-07-12 10:53:00,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:53:00,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:53:00,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:00,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:53:00,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:53:00,940 INFO L87 Difference]: Start difference. First operand 140 states and 185 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-12 10:53:01,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:01,129 INFO L93 Difference]: Finished difference Result 231 states and 306 transitions. [2022-07-12 10:53:01,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:53:01,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 133 [2022-07-12 10:53:01,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:01,131 INFO L225 Difference]: With dead ends: 231 [2022-07-12 10:53:01,131 INFO L226 Difference]: Without dead ends: 137 [2022-07-12 10:53:01,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-07-12 10:53:01,132 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 232 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:01,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 589 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 10:53:01,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-12 10:53:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-07-12 10:53:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 90 states have (on average 1.211111111111111) internal successors, (109), 91 states have internal predecessors, (109), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-12 10:53:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 180 transitions. [2022-07-12 10:53:01,141 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 180 transitions. Word has length 133 [2022-07-12 10:53:01,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:01,155 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 180 transitions. [2022-07-12 10:53:01,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-12 10:53:01,155 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 180 transitions. [2022-07-12 10:53:01,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-12 10:53:01,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:01,157 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:53:01,179 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:53:01,371 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:53:01,372 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:01,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:01,372 INFO L85 PathProgramCache]: Analyzing trace with hash 388826435, now seen corresponding path program 1 times [2022-07-12 10:53:01,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:01,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189153681] [2022-07-12 10:53:01,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:01,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:53:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:53:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:53:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:53:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:53:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 10:53:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:53:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 10:53:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:53:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 10:53:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 10:53:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 10:53:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 10:53:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-07-12 10:53:01,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:01,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189153681] [2022-07-12 10:53:01,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189153681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:53:01,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:53:01,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:53:01,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61858701] [2022-07-12 10:53:01,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:53:01,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:53:01,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:01,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:53:01,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:53:01,813 INFO L87 Difference]: Start difference. First operand 137 states and 180 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 10:53:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:02,379 INFO L93 Difference]: Finished difference Result 151 states and 198 transitions. [2022-07-12 10:53:02,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:53:02,380 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 145 [2022-07-12 10:53:02,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:02,381 INFO L225 Difference]: With dead ends: 151 [2022-07-12 10:53:02,381 INFO L226 Difference]: Without dead ends: 149 [2022-07-12 10:53:02,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-07-12 10:53:02,382 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 147 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:02,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 692 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 10:53:02,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-12 10:53:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2022-07-12 10:53:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 96 states have (on average 1.1979166666666667) internal successors, (115), 98 states have internal predecessors, (115), 37 states have call successors, (37), 11 states have call predecessors, (37), 12 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2022-07-12 10:53:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 192 transitions. [2022-07-12 10:53:02,392 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 192 transitions. Word has length 145 [2022-07-12 10:53:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:02,392 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 192 transitions. [2022-07-12 10:53:02,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 10:53:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 192 transitions. [2022-07-12 10:53:02,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-12 10:53:02,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:02,394 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:53:02,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:53:02,394 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:02,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:02,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1495986421, now seen corresponding path program 1 times [2022-07-12 10:53:02,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:02,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478228483] [2022-07-12 10:53:02,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:02,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:53:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:53:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:53:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:53:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:53:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 10:53:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:53:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 10:53:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:53:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 10:53:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 10:53:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 10:53:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 10:53:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-07-12 10:53:02,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:02,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478228483] [2022-07-12 10:53:02,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478228483] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:53:02,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:53:02,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:53:02,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125389018] [2022-07-12 10:53:02,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:53:02,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:53:02,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:02,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:53:02,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:53:02,886 INFO L87 Difference]: Start difference. First operand 146 states and 192 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 10:53:03,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:03,290 INFO L93 Difference]: Finished difference Result 286 states and 387 transitions. [2022-07-12 10:53:03,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:53:03,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2022-07-12 10:53:03,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:03,292 INFO L225 Difference]: With dead ends: 286 [2022-07-12 10:53:03,292 INFO L226 Difference]: Without dead ends: 173 [2022-07-12 10:53:03,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:53:03,293 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 214 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:03,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 381 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:53:03,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-07-12 10:53:03,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 151. [2022-07-12 10:53:03,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 37 states have call successors, (37), 11 states have call predecessors, (37), 12 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2022-07-12 10:53:03,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 199 transitions. [2022-07-12 10:53:03,303 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 199 transitions. Word has length 149 [2022-07-12 10:53:03,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:03,303 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 199 transitions. [2022-07-12 10:53:03,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 10:53:03,304 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 199 transitions. [2022-07-12 10:53:03,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-12 10:53:03,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:03,305 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:53:03,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:53:03,305 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:03,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:03,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1237820983, now seen corresponding path program 1 times [2022-07-12 10:53:03,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:03,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270143354] [2022-07-12 10:53:03,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:03,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:53:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:53:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:53:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:53:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:53:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 10:53:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:53:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 10:53:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:53:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 10:53:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 10:53:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 10:53:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 10:53:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-07-12 10:53:03,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:03,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270143354] [2022-07-12 10:53:03,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270143354] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:03,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785827777] [2022-07-12 10:53:03,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:03,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:03,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:53:03,809 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:53:03,838 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:53:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:04,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 2786 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-12 10:53:04,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:53:04,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 10:53:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-12 10:53:04,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:53:04,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785827777] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:53:04,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:53:04,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13] total 21 [2022-07-12 10:53:04,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718702032] [2022-07-12 10:53:04,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:53:04,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 10:53:04,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:04,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 10:53:04,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2022-07-12 10:53:04,656 INFO L87 Difference]: Start difference. First operand 151 states and 199 transitions. Second operand has 15 states, 13 states have (on average 6.384615384615385) internal successors, (83), 14 states have internal predecessors, (83), 7 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2022-07-12 10:53:05,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:05,374 INFO L93 Difference]: Finished difference Result 425 states and 601 transitions. [2022-07-12 10:53:05,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 10:53:05,375 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.384615384615385) internal successors, (83), 14 states have internal predecessors, (83), 7 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) Word has length 149 [2022-07-12 10:53:05,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:05,377 INFO L225 Difference]: With dead ends: 425 [2022-07-12 10:53:05,377 INFO L226 Difference]: Without dead ends: 323 [2022-07-12 10:53:05,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 176 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2022-07-12 10:53:05,379 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 210 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 354 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:05,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1204 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 831 Invalid, 0 Unknown, 354 Unchecked, 0.6s Time] [2022-07-12 10:53:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-12 10:53:05,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 189. [2022-07-12 10:53:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 131 states have (on average 1.2213740458015268) internal successors, (160), 135 states have internal predecessors, (160), 41 states have call successors, (41), 13 states have call predecessors, (41), 16 states have return successors, (50), 40 states have call predecessors, (50), 40 states have call successors, (50) [2022-07-12 10:53:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 251 transitions. [2022-07-12 10:53:05,405 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 251 transitions. Word has length 149 [2022-07-12 10:53:05,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:05,406 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 251 transitions. [2022-07-12 10:53:05,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.384615384615385) internal successors, (83), 14 states have internal predecessors, (83), 7 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2022-07-12 10:53:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 251 transitions. [2022-07-12 10:53:05,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-12 10:53:05,407 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:05,407 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:53:05,429 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:53:05,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:05,624 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:05,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:05,624 INFO L85 PathProgramCache]: Analyzing trace with hash 23096267, now seen corresponding path program 1 times [2022-07-12 10:53:05,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:05,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067475591] [2022-07-12 10:53:05,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:05,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:53:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:53:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:53:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:53:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:53:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 10:53:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:53:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 10:53:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:53:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 10:53:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 10:53:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 10:53:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 10:53:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:05,842 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-07-12 10:53:05,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:05,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067475591] [2022-07-12 10:53:05,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067475591] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:05,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098984468] [2022-07-12 10:53:05,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:05,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:05,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:53:05,844 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:53:05,845 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:53:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:06,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 2781 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 10:53:06,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:53:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-12 10:53:06,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:53:06,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098984468] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:53:06,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:53:06,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-12 10:53:06,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668921872] [2022-07-12 10:53:06,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:53:06,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:53:06,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:06,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:53:06,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:53:06,241 INFO L87 Difference]: Start difference. First operand 189 states and 251 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 10:53:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:06,262 INFO L93 Difference]: Finished difference Result 351 states and 471 transitions. [2022-07-12 10:53:06,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:53:06,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2022-07-12 10:53:06,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:06,264 INFO L225 Difference]: With dead ends: 351 [2022-07-12 10:53:06,264 INFO L226 Difference]: Without dead ends: 198 [2022-07-12 10:53:06,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 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:53:06,265 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 20 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:06,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 532 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 10:53:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-12 10:53:06,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 185. [2022-07-12 10:53:06,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 128 states have (on average 1.2109375) internal successors, (155), 131 states have internal predecessors, (155), 41 states have call successors, (41), 13 states have call predecessors, (41), 15 states have return successors, (48), 40 states have call predecessors, (48), 40 states have call successors, (48) [2022-07-12 10:53:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 244 transitions. [2022-07-12 10:53:06,282 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 244 transitions. Word has length 149 [2022-07-12 10:53:06,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:06,282 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 244 transitions. [2022-07-12 10:53:06,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 10:53:06,282 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 244 transitions. [2022-07-12 10:53:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-12 10:53:06,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:06,283 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:53:06,306 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:53:06,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:06,497 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:06,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:06,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1116974037, now seen corresponding path program 1 times [2022-07-12 10:53:06,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:06,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042498495] [2022-07-12 10:53:06,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:06,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:53:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:53:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:53:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:53:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:53:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 10:53:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:53:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 10:53:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:53:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 10:53:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 10:53:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 10:53:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 10:53:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 10:53:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-07-12 10:53:07,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:07,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042498495] [2022-07-12 10:53:07,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042498495] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:07,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906519632] [2022-07-12 10:53:07,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:07,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:07,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:53:07,239 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:53:07,240 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:53:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:07,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 2831 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-12 10:53:07,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:53:07,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 10:53:07,853 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-07-12 10:53:07,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:53:07,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906519632] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:53:07,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:53:07,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 18 [2022-07-12 10:53:07,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118830315] [2022-07-12 10:53:07,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:53:07,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 10:53:07,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:07,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 10:53:07,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:53:07,856 INFO L87 Difference]: Start difference. First operand 185 states and 244 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 10 states have internal predecessors, (74), 5 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2022-07-12 10:53:08,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:08,004 INFO L93 Difference]: Finished difference Result 325 states and 425 transitions. [2022-07-12 10:53:08,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 10:53:08,004 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 10 states have internal predecessors, (74), 5 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 156 [2022-07-12 10:53:08,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:08,005 INFO L225 Difference]: With dead ends: 325 [2022-07-12 10:53:08,006 INFO L226 Difference]: Without dead ends: 172 [2022-07-12 10:53:08,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-07-12 10:53:08,007 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 88 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:08,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1016 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 121 Invalid, 0 Unknown, 68 Unchecked, 0.1s Time] [2022-07-12 10:53:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-12 10:53:08,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2022-07-12 10:53:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 112 states have (on average 1.2142857142857142) internal successors, (136), 113 states have internal predecessors, (136), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (39), 36 states have call predecessors, (39), 36 states have call successors, (39) [2022-07-12 10:53:08,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 212 transitions. [2022-07-12 10:53:08,020 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 212 transitions. Word has length 156 [2022-07-12 10:53:08,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:08,020 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 212 transitions. [2022-07-12 10:53:08,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 10 states have internal predecessors, (74), 5 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2022-07-12 10:53:08,020 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 212 transitions. [2022-07-12 10:53:08,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-12 10:53:08,022 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:08,022 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 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, 1, 1, 1, 1] [2022-07-12 10:53:08,053 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:53:08,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:08,239 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:08,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:08,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1622537167, now seen corresponding path program 2 times [2022-07-12 10:53:08,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:08,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81312027] [2022-07-12 10:53:08,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:08,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:53:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:53:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:53:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:53:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:53:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:53:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:53:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 10:53:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 10:53:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 10:53:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 10:53:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 10:53:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 10:53:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-12 10:53:08,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:08,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81312027] [2022-07-12 10:53:08,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81312027] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:08,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197111428] [2022-07-12 10:53:08,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:53:08,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:08,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:53:08,625 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:53:08,626 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:53:09,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:53:09,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:53:09,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 2793 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 10:53:09,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:53:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-07-12 10:53:09,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:53:09,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197111428] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:53:09,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:53:09,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2022-07-12 10:53:09,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773825330] [2022-07-12 10:53:09,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:53:09,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:53:09,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:09,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:53:09,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:53:09,109 INFO L87 Difference]: Start difference. First operand 162 states and 212 transitions. Second operand has 9 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 10:53:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:09,227 INFO L93 Difference]: Finished difference Result 289 states and 381 transitions. [2022-07-12 10:53:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:53:09,228 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2022-07-12 10:53:09,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:09,229 INFO L225 Difference]: With dead ends: 289 [2022-07-12 10:53:09,229 INFO L226 Difference]: Without dead ends: 167 [2022-07-12 10:53:09,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-07-12 10:53:09,231 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 12 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:09,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1291 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 10:53:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-12 10:53:09,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-07-12 10:53:09,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 116 states have (on average 1.206896551724138) internal successors, (140), 118 states have internal predecessors, (140), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (42), 36 states have call predecessors, (42), 36 states have call successors, (42) [2022-07-12 10:53:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 219 transitions. [2022-07-12 10:53:09,246 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 219 transitions. Word has length 153 [2022-07-12 10:53:09,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:09,247 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 219 transitions. [2022-07-12 10:53:09,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 10:53:09,247 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 219 transitions. [2022-07-12 10:53:09,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-12 10:53:09,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:09,249 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:09,272 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:53:09,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:09,470 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:09,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:09,470 INFO L85 PathProgramCache]: Analyzing trace with hash -251458092, now seen corresponding path program 1 times [2022-07-12 10:53:09,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:09,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319417921] [2022-07-12 10:53:09,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:09,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:53:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:53:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:53:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:53:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:53:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:53:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 10:53:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:53:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 10:53:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 10:53:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 10:53:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 10:53:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 10:53:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2022-07-12 10:53:09,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:09,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319417921] [2022-07-12 10:53:09,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319417921] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:09,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579900591] [2022-07-12 10:53:09,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:09,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:09,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:53:09,688 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:53:09,689 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:53:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 2798 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 10:53:10,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:53:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-12 10:53:10,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:53:10,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579900591] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:53:10,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:53:10,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-12 10:53:10,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603924936] [2022-07-12 10:53:10,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:53:10,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:53:10,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:10,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:53:10,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:53:10,086 INFO L87 Difference]: Start difference. First operand 167 states and 219 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 10:53:10,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:10,108 INFO L93 Difference]: Finished difference Result 299 states and 397 transitions. [2022-07-12 10:53:10,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:53:10,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2022-07-12 10:53:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:10,109 INFO L225 Difference]: With dead ends: 299 [2022-07-12 10:53:10,109 INFO L226 Difference]: Without dead ends: 170 [2022-07-12 10:53:10,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 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:53:10,110 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 9 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:10,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 525 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 10:53:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-12 10:53:10,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2022-07-12 10:53:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 116 states have (on average 1.1896551724137931) internal successors, (138), 118 states have internal predecessors, (138), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (42), 36 states have call predecessors, (42), 36 states have call successors, (42) [2022-07-12 10:53:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 217 transitions. [2022-07-12 10:53:10,118 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 217 transitions. Word has length 155 [2022-07-12 10:53:10,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:10,119 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 217 transitions. [2022-07-12 10:53:10,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 10:53:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 217 transitions. [2022-07-12 10:53:10,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-12 10:53:10,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:10,120 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:10,140 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:53:10,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:10,340 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:10,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:10,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1378113304, now seen corresponding path program 1 times [2022-07-12 10:53:10,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:10,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102091748] [2022-07-12 10:53:10,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:10,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:53:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:53:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:53:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:53:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:53:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:53:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 10:53:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:53:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 10:53:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 10:53:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 10:53:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 10:53:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 10:53:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-12 10:53:10,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:10,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102091748] [2022-07-12 10:53:10,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102091748] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:10,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237942675] [2022-07-12 10:53:10,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:10,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:10,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:53:10,551 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:53:10,552 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:53:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:10,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 2800 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 10:53:10,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:53:10,941 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-12 10:53:10,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:53:10,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237942675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:53:10,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:53:10,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-12 10:53:10,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32187590] [2022-07-12 10:53:10,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:53:10,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:53:10,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:10,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:53:10,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:53:10,945 INFO L87 Difference]: Start difference. First operand 167 states and 217 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 10:53:10,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:10,964 INFO L93 Difference]: Finished difference Result 305 states and 405 transitions. [2022-07-12 10:53:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:53:10,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2022-07-12 10:53:10,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:10,966 INFO L225 Difference]: With dead ends: 305 [2022-07-12 10:53:10,966 INFO L226 Difference]: Without dead ends: 176 [2022-07-12 10:53:10,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 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:53:10,967 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 34 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:10,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 523 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 10:53:10,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-12 10:53:10,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 163. [2022-07-12 10:53:10,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 112 states have (on average 1.1696428571428572) internal successors, (131), 114 states have internal predecessors, (131), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (42), 36 states have call predecessors, (42), 36 states have call successors, (42) [2022-07-12 10:53:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 210 transitions. [2022-07-12 10:53:10,977 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 210 transitions. Word has length 155 [2022-07-12 10:53:10,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:10,977 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 210 transitions. [2022-07-12 10:53:10,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 10:53:10,977 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 210 transitions. [2022-07-12 10:53:10,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-12 10:53:10,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:10,979 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:53:11,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 10:53:11,191 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,SelfDestructingSolverStorable10 [2022-07-12 10:53:11,191 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:11,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:11,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1565468774, now seen corresponding path program 1 times [2022-07-12 10:53:11,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:11,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173868746] [2022-07-12 10:53:11,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:11,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:53:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:53:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:53:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:53:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:53:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:53:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 10:53:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:53:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 10:53:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 10:53:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 10:53:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 10:53:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 10:53:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-07-12 10:53:11,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:11,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173868746] [2022-07-12 10:53:11,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173868746] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:11,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588145425] [2022-07-12 10:53:11,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:11,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:11,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:53:11,748 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:53:11,749 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:53:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:12,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 2795 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-12 10:53:12,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:53:12,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 10:53:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-12 10:53:12,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:53:12,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588145425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:53:12,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:53:12,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 21 [2022-07-12 10:53:12,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763526963] [2022-07-12 10:53:12,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:53:12,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 10:53:12,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:12,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 10:53:12,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2022-07-12 10:53:12,544 INFO L87 Difference]: Start difference. First operand 163 states and 210 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 7 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2022-07-12 10:53:13,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:13,092 INFO L93 Difference]: Finished difference Result 372 states and 489 transitions. [2022-07-12 10:53:13,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 10:53:13,092 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 7 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) Word has length 155 [2022-07-12 10:53:13,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:13,095 INFO L225 Difference]: With dead ends: 372 [2022-07-12 10:53:13,095 INFO L226 Difference]: Without dead ends: 257 [2022-07-12 10:53:13,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 187 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2022-07-12 10:53:13,096 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 118 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 459 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:13,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1043 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 643 Invalid, 0 Unknown, 459 Unchecked, 0.4s Time] [2022-07-12 10:53:13,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-07-12 10:53:13,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 204. [2022-07-12 10:53:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 147 states have (on average 1.1700680272108843) internal successors, (172), 151 states have internal predecessors, (172), 39 states have call successors, (39), 14 states have call predecessors, (39), 17 states have return successors, (50), 38 states have call predecessors, (50), 38 states have call successors, (50) [2022-07-12 10:53:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 261 transitions. [2022-07-12 10:53:13,106 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 261 transitions. Word has length 155 [2022-07-12 10:53:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:13,106 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 261 transitions. [2022-07-12 10:53:13,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 7 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2022-07-12 10:53:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 261 transitions. [2022-07-12 10:53:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-12 10:53:13,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:13,114 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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:53:13,139 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:53:13,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:13,335 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:13,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:13,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1596313372, now seen corresponding path program 1 times [2022-07-12 10:53:13,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:13,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342794791] [2022-07-12 10:53:13,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:13,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:53:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:53:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:53:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:53:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:53:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:53:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 10:53:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:53:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:53:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 10:53:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 10:53:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 10:53:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 10:53:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:13,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 10:53:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2022-07-12 10:53:14,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:14,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342794791] [2022-07-12 10:53:14,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342794791] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:14,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511742748] [2022-07-12 10:53:14,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:14,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:14,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:53:14,053 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:53:14,055 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:53:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:14,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 2840 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-12 10:53:14,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:53:14,456 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:53:14,621 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 5 treesize of output 3 [2022-07-12 10:53:14,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:53:14,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-12 10:53:14,964 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 5 treesize of output 3 [2022-07-12 10:53:15,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:53:15,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-12 10:53:15,050 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:53:15,427 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-12 10:53:15,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-12 10:53:15,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 10 treesize of output 6 [2022-07-12 10:53:15,659 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 10:53:15,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 10:53:15,771 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:53:15,779 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_831 (Array Int Int))) (= (store |c_old(#memory_int)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_831) |c_#memory_int|)) is different from true [2022-07-12 10:53:15,786 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 19 treesize of output 21 [2022-07-12 10:53:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 74 proven. 136 refuted. 0 times theorem prover too weak. 54 trivial. 2 not checked. [2022-07-12 10:53:26,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:53:26,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_835 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#old_byte_from_str~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.offset|)) 18446744073709551616) 0))) is different from false [2022-07-12 10:53:26,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511742748] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:26,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:53:26,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 29] total 41 [2022-07-12 10:53:26,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055076673] [2022-07-12 10:53:26,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:53:26,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-12 10:53:26,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:26,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-12 10:53:26,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1816, Unknown=4, NotChecked=174, Total=2162 [2022-07-12 10:53:26,845 INFO L87 Difference]: Start difference. First operand 204 states and 261 transitions. Second operand has 41 states, 38 states have (on average 4.421052631578948) internal successors, (168), 34 states have internal predecessors, (168), 16 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (40), 14 states have call predecessors, (40), 15 states have call successors, (40) [2022-07-12 10:53:33,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:33,916 INFO L93 Difference]: Finished difference Result 522 states and 710 transitions. [2022-07-12 10:53:33,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-12 10:53:33,917 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 4.421052631578948) internal successors, (168), 34 states have internal predecessors, (168), 16 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (40), 14 states have call predecessors, (40), 15 states have call successors, (40) Word has length 162 [2022-07-12 10:53:33,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:33,919 INFO L225 Difference]: With dead ends: 522 [2022-07-12 10:53:33,919 INFO L226 Difference]: Without dead ends: 434 [2022-07-12 10:53:33,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 227 SyntacticMatches, 20 SemanticMatches, 88 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2361 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=814, Invalid=6840, Unknown=10, NotChecked=346, Total=8010 [2022-07-12 10:53:33,922 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 342 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 1898 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 4279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2212 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:33,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 2010 Invalid, 4279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1898 Invalid, 0 Unknown, 2212 Unchecked, 1.2s Time] [2022-07-12 10:53:33,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-07-12 10:53:33,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 331. [2022-07-12 10:53:33,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 240 states have (on average 1.15) internal successors, (276), 248 states have internal predecessors, (276), 61 states have call successors, (61), 23 states have call predecessors, (61), 29 states have return successors, (94), 59 states have call predecessors, (94), 60 states have call successors, (94) [2022-07-12 10:53:33,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 431 transitions. [2022-07-12 10:53:33,936 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 431 transitions. Word has length 162 [2022-07-12 10:53:33,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:33,945 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 431 transitions. [2022-07-12 10:53:33,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 4.421052631578948) internal successors, (168), 34 states have internal predecessors, (168), 16 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (40), 14 states have call predecessors, (40), 15 states have call successors, (40) [2022-07-12 10:53:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 431 transitions. [2022-07-12 10:53:33,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-12 10:53:33,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:33,947 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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:53:33,967 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:53:34,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 10:53:34,167 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:34,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:34,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1418790246, now seen corresponding path program 2 times [2022-07-12 10:53:34,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:34,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347658398] [2022-07-12 10:53:34,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:34,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:53:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:53:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:53:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:53:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:53:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:53:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 10:53:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:53:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:53:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 10:53:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 10:53:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 10:53:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 10:53:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 10:53:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2022-07-12 10:53:34,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:34,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347658398] [2022-07-12 10:53:34,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347658398] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:53:34,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:53:34,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 10:53:34,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837440124] [2022-07-12 10:53:34,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:53:34,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 10:53:34,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:34,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 10:53:34,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-07-12 10:53:34,656 INFO L87 Difference]: Start difference. First operand 331 states and 431 transitions. Second operand has 15 states, 14 states have (on average 5.5) internal successors, (77), 13 states have internal predecessors, (77), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-12 10:53:35,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:35,714 INFO L93 Difference]: Finished difference Result 499 states and 666 transitions. [2022-07-12 10:53:35,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 10:53:35,715 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.5) internal successors, (77), 13 states have internal predecessors, (77), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2022-07-12 10:53:35,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:35,716 INFO L225 Difference]: With dead ends: 499 [2022-07-12 10:53:35,716 INFO L226 Difference]: Without dead ends: 403 [2022-07-12 10:53:35,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-07-12 10:53:35,717 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 235 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:35,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 912 Invalid, 1529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 10:53:35,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-07-12 10:53:35,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 348. [2022-07-12 10:53:35,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 252 states have (on average 1.1468253968253967) internal successors, (289), 262 states have internal predecessors, (289), 64 states have call successors, (64), 23 states have call predecessors, (64), 31 states have return successors, (111), 62 states have call predecessors, (111), 63 states have call successors, (111) [2022-07-12 10:53:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 464 transitions. [2022-07-12 10:53:35,734 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 464 transitions. Word has length 162 [2022-07-12 10:53:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:35,734 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 464 transitions. [2022-07-12 10:53:35,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.5) internal successors, (77), 13 states have internal predecessors, (77), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-12 10:53:35,734 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 464 transitions. [2022-07-12 10:53:35,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-12 10:53:35,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:35,736 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:53:35,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 10:53:35,737 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:35,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:35,737 INFO L85 PathProgramCache]: Analyzing trace with hash -427723094, now seen corresponding path program 1 times [2022-07-12 10:53:35,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:35,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553061880] [2022-07-12 10:53:35,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:35,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:35,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:35,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:35,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:35,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:35,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:53:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:35,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:53:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:35,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:53:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:35,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:53:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:35,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:35,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:53:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:35,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:53:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:35,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 10:53:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:35,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:53:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:35,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:53:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:35,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 10:53:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:36,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 10:53:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:36,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 10:53:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:36,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 10:53:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:36,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:36,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:36,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 10:53:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2022-07-12 10:53:36,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:36,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553061880] [2022-07-12 10:53:36,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553061880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:53:36,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:53:36,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 10:53:36,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360602897] [2022-07-12 10:53:36,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:53:36,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 10:53:36,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:36,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 10:53:36,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:53:36,183 INFO L87 Difference]: Start difference. First operand 348 states and 464 transitions. Second operand has 14 states, 13 states have (on average 5.923076923076923) internal successors, (77), 12 states have internal predecessors, (77), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-12 10:53:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:37,151 INFO L93 Difference]: Finished difference Result 501 states and 675 transitions. [2022-07-12 10:53:37,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 10:53:37,151 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.923076923076923) internal successors, (77), 12 states have internal predecessors, (77), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2022-07-12 10:53:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:37,153 INFO L225 Difference]: With dead ends: 501 [2022-07-12 10:53:37,153 INFO L226 Difference]: Without dead ends: 398 [2022-07-12 10:53:37,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-07-12 10:53:37,154 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 234 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:37,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 849 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 10:53:37,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-07-12 10:53:37,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 353. [2022-07-12 10:53:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 256 states have (on average 1.14453125) internal successors, (293), 267 states have internal predecessors, (293), 64 states have call successors, (64), 23 states have call predecessors, (64), 32 states have return successors, (118), 62 states have call predecessors, (118), 63 states have call successors, (118) [2022-07-12 10:53:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 475 transitions. [2022-07-12 10:53:37,170 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 475 transitions. Word has length 162 [2022-07-12 10:53:37,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:37,170 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 475 transitions. [2022-07-12 10:53:37,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.923076923076923) internal successors, (77), 12 states have internal predecessors, (77), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-12 10:53:37,170 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 475 transitions. [2022-07-12 10:53:37,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-12 10:53:37,171 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:37,172 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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:53:37,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 10:53:37,172 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:37,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:37,172 INFO L85 PathProgramCache]: Analyzing trace with hash -169557656, now seen corresponding path program 3 times [2022-07-12 10:53:37,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:37,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179486752] [2022-07-12 10:53:37,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:37,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:53:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:53:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:53:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:53:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:53:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:53:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 10:53:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:53:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:53:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 10:53:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 10:53:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 10:53:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 10:53:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 10:53:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-07-12 10:53:37,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:37,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179486752] [2022-07-12 10:53:37,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179486752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:53:37,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:53:37,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:53:37,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176722198] [2022-07-12 10:53:37,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:53:37,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:53:37,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:37,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:53:37,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:53:37,523 INFO L87 Difference]: Start difference. First operand 353 states and 475 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-12 10:53:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:37,909 INFO L93 Difference]: Finished difference Result 495 states and 657 transitions. [2022-07-12 10:53:37,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:53:37,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2022-07-12 10:53:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:37,911 INFO L225 Difference]: With dead ends: 495 [2022-07-12 10:53:37,911 INFO L226 Difference]: Without dead ends: 351 [2022-07-12 10:53:37,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:53:37,913 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 159 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:37,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 384 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:53:37,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-12 10:53:37,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 346. [2022-07-12 10:53:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 250 states have (on average 1.136) internal successors, (284), 260 states have internal predecessors, (284), 64 states have call successors, (64), 23 states have call predecessors, (64), 31 states have return successors, (108), 62 states have call predecessors, (108), 63 states have call successors, (108) [2022-07-12 10:53:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 456 transitions. [2022-07-12 10:53:37,926 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 456 transitions. Word has length 162 [2022-07-12 10:53:37,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:37,927 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 456 transitions. [2022-07-12 10:53:37,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-12 10:53:37,927 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 456 transitions. [2022-07-12 10:53:37,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-12 10:53:37,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:37,928 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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:53:37,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 10:53:37,929 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:37,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:37,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1998554157, now seen corresponding path program 1 times [2022-07-12 10:53:37,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:37,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94167192] [2022-07-12 10:53:37,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:37,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:53:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:53:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:53:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:53:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:53:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:53:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 10:53:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:53:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:53:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 10:53:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 10:53:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 10:53:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 10:53:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 10:53:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-07-12 10:53:38,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:38,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94167192] [2022-07-12 10:53:38,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94167192] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:38,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028346217] [2022-07-12 10:53:38,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:38,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:38,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:53:38,288 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:53:38,289 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:53:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:38,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 2839 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-12 10:53:38,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:53:38,749 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:53:38,953 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1142 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_save_byte_from_array_~storage#1.base| v_ArrVal_1142))) is different from true [2022-07-12 10:53:38,954 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:53:38,960 WARN L855 $PredicateComparison]: unable to prove that (exists ((|save_byte_from_array_~storage#1.base| Int) (v_ArrVal_1143 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| v_ArrVal_1143))) is different from true [2022-07-12 10:53:38,980 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 10:53:38,980 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 26 treesize of output 30 [2022-07-12 10:53:38,984 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 15 treesize of output 11 [2022-07-12 10:53:39,248 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 27 treesize of output 15 [2022-07-12 10:53:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 94 proven. 32 refuted. 0 times theorem prover too weak. 138 trivial. 2 not checked. [2022-07-12 10:53:39,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:53:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-07-12 10:53:39,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028346217] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:53:39,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:53:39,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 10] total 30 [2022-07-12 10:53:39,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776783119] [2022-07-12 10:53:39,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:53:39,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 10:53:39,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:53:39,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 10:53:39,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=679, Unknown=2, NotChecked=106, Total=870 [2022-07-12 10:53:39,639 INFO L87 Difference]: Start difference. First operand 346 states and 456 transitions. Second operand has 30 states, 27 states have (on average 5.2592592592592595) internal successors, (142), 28 states have internal predecessors, (142), 14 states have call successors, (45), 6 states have call predecessors, (45), 7 states have return successors, (40), 11 states have call predecessors, (40), 14 states have call successors, (40) [2022-07-12 10:53:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:53:43,882 INFO L93 Difference]: Finished difference Result 934 states and 1364 transitions. [2022-07-12 10:53:43,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-12 10:53:43,883 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 5.2592592592592595) internal successors, (142), 28 states have internal predecessors, (142), 14 states have call successors, (45), 6 states have call predecessors, (45), 7 states have return successors, (40), 11 states have call predecessors, (40), 14 states have call successors, (40) Word has length 162 [2022-07-12 10:53:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:53:43,886 INFO L225 Difference]: With dead ends: 934 [2022-07-12 10:53:43,886 INFO L226 Difference]: Without dead ends: 756 [2022-07-12 10:53:43,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 342 SyntacticMatches, 12 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=381, Invalid=2573, Unknown=24, NotChecked=214, Total=3192 [2022-07-12 10:53:43,888 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 542 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 5055 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 6979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 5055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1439 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-12 10:53:43,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1911 Invalid, 6979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 5055 Invalid, 0 Unknown, 1439 Unchecked, 3.4s Time] [2022-07-12 10:53:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-07-12 10:53:43,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 444. [2022-07-12 10:53:43,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 324 states have (on average 1.126543209876543) internal successors, (365), 333 states have internal predecessors, (365), 83 states have call successors, (83), 29 states have call predecessors, (83), 36 states have return successors, (150), 81 states have call predecessors, (150), 82 states have call successors, (150) [2022-07-12 10:53:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 598 transitions. [2022-07-12 10:53:43,916 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 598 transitions. Word has length 162 [2022-07-12 10:53:43,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:53:43,916 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 598 transitions. [2022-07-12 10:53:43,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 5.2592592592592595) internal successors, (142), 28 states have internal predecessors, (142), 14 states have call successors, (45), 6 states have call predecessors, (45), 7 states have return successors, (40), 11 states have call predecessors, (40), 14 states have call successors, (40) [2022-07-12 10:53:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 598 transitions. [2022-07-12 10:53:43,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-12 10:53:43,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:53:43,918 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:53:43,938 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:53:44,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 10:53:44,138 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:53:44,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:53:44,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1609847333, now seen corresponding path program 1 times [2022-07-12 10:53:44,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:53:44,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029109278] [2022-07-12 10:53:44,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:44,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:53:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:53:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:53:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:53:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:53:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:53:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:53:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:53:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:53:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:53:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 10:53:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:53:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:53:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 10:53:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 10:53:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 10:53:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 10:53:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:53:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:53:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 10:53:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:44,899 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-07-12 10:53:44,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:53:44,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029109278] [2022-07-12 10:53:44,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029109278] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:53:44,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899851714] [2022-07-12 10:53:44,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:53:44,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:53:44,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:53:44,901 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:53:44,902 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:53:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:53:45,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 2841 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-12 10:53:45,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:53:45,444 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:53:47,373 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 11 treesize of output 7 [2022-07-12 10:53:49,380 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1260 Int) (|save_byte_from_array_~storage#1.base| Int) (v_ArrVal_1263 Int)) (= (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| (store (store (select |c_old(#memory_int)| |save_byte_from_array_~storage#1.base|) |c_save_byte_from_array_#in~storage#1.offset| v_ArrVal_1260) (+ |c_save_byte_from_array_#in~storage#1.offset| 8) v_ArrVal_1263)) |c_#memory_int|)) is different from true [2022-07-12 10:53:49,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:53:49,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:53:49,396 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 10:53:49,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2022-07-12 10:54:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 135 proven. 47 refuted. 0 times theorem prover too weak. 90 trivial. 2 not checked. [2022-07-12 10:54:20,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:54:21,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899851714] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:54:21,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:54:21,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 53 [2022-07-12 10:54:21,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852009034] [2022-07-12 10:54:21,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:54:21,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-12 10:54:21,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:54:21,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-12 10:54:21,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3212, Unknown=8, NotChecked=114, Total=3540 [2022-07-12 10:54:21,213 INFO L87 Difference]: Start difference. First operand 444 states and 598 transitions. Second operand has 53 states, 46 states have (on average 3.3043478260869565) internal successors, (152), 46 states have internal predecessors, (152), 24 states have call successors, (41), 8 states have call predecessors, (41), 13 states have return successors, (40), 22 states have call predecessors, (40), 24 states have call successors, (40) [2022-07-12 10:55:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:55:38,269 INFO L93 Difference]: Finished difference Result 859 states and 1174 transitions. [2022-07-12 10:55:38,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-07-12 10:55:38,269 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 46 states have (on average 3.3043478260869565) internal successors, (152), 46 states have internal predecessors, (152), 24 states have call successors, (41), 8 states have call predecessors, (41), 13 states have return successors, (40), 22 states have call predecessors, (40), 24 states have call successors, (40) Word has length 166 [2022-07-12 10:55:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:55:38,272 INFO L225 Difference]: With dead ends: 859 [2022-07-12 10:55:38,272 INFO L226 Difference]: Without dead ends: 704 [2022-07-12 10:55:38,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 198 SyntacticMatches, 13 SemanticMatches, 106 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3150 ImplicationChecksByTransitivity, 108.6s TimeCoverageRelationStatistics Valid=827, Invalid=10453, Unknown=66, NotChecked=210, Total=11556 [2022-07-12 10:55:38,275 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 477 mSDsluCounter, 2269 mSDsCounter, 0 mSdLazyCounter, 6643 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 2445 SdHoareTripleChecker+Invalid, 9306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 6643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2283 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-12 10:55:38,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 2445 Invalid, 9306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 6643 Invalid, 0 Unknown, 2283 Unchecked, 3.9s Time] [2022-07-12 10:55:38,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-07-12 10:55:38,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 538. [2022-07-12 10:55:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 396 states have (on average 1.1262626262626263) internal successors, (446), 409 states have internal predecessors, (446), 96 states have call successors, (96), 34 states have call predecessors, (96), 45 states have return successors, (174), 94 states have call predecessors, (174), 95 states have call successors, (174) [2022-07-12 10:55:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 716 transitions. [2022-07-12 10:55:38,305 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 716 transitions. Word has length 166 [2022-07-12 10:55:38,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:55:38,306 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 716 transitions. [2022-07-12 10:55:38,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 46 states have (on average 3.3043478260869565) internal successors, (152), 46 states have internal predecessors, (152), 24 states have call successors, (41), 8 states have call predecessors, (41), 13 states have return successors, (40), 22 states have call predecessors, (40), 24 states have call successors, (40) [2022-07-12 10:55:38,306 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 716 transitions. [2022-07-12 10:55:38,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-12 10:55:38,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:55:38,308 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:38,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 10:55:38,531 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,SelfDestructingSolverStorable17 [2022-07-12 10:55:38,532 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:55:38,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:55:38,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1758298720, now seen corresponding path program 1 times [2022-07-12 10:55:38,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:55:38,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18714769] [2022-07-12 10:55:38,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:55:38,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:55:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:55:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:55:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:55:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:55:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:55:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:55:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:55:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:55:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:55:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:55:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:55:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 10:55:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:55:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 10:55:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 10:55:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 10:55:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 10:55:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:55:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:55:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 10:55:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:38,899 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2022-07-12 10:55:38,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:55:38,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18714769] [2022-07-12 10:55:38,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18714769] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:55:38,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654519514] [2022-07-12 10:55:38,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:55:38,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:55:38,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:55:38,901 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:55:38,902 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:55:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:39,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 2802 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-12 10:55:39,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:55:39,418 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:55:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 117 proven. 27 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-12 10:55:40,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:55:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 14 proven. 28 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-07-12 10:55:40,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654519514] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:55:40,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:55:40,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 11] total 32 [2022-07-12 10:55:40,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117559015] [2022-07-12 10:55:40,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:55:40,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 10:55:40,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:55:40,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 10:55:40,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2022-07-12 10:55:40,715 INFO L87 Difference]: Start difference. First operand 538 states and 716 transitions. Second operand has 32 states, 30 states have (on average 5.733333333333333) internal successors, (172), 29 states have internal predecessors, (172), 11 states have call successors, (48), 7 states have call predecessors, (48), 9 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) [2022-07-12 10:55:44,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:55:44,908 INFO L93 Difference]: Finished difference Result 1062 states and 1441 transitions. [2022-07-12 10:55:44,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-07-12 10:55:44,908 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 5.733333333333333) internal successors, (172), 29 states have internal predecessors, (172), 11 states have call successors, (48), 7 states have call predecessors, (48), 9 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) Word has length 159 [2022-07-12 10:55:44,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:55:44,911 INFO L225 Difference]: With dead ends: 1062 [2022-07-12 10:55:44,911 INFO L226 Difference]: Without dead ends: 713 [2022-07-12 10:55:44,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 328 SyntacticMatches, 12 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=616, Invalid=4783, Unknown=3, NotChecked=0, Total=5402 [2022-07-12 10:55:44,913 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 368 mSDsluCounter, 3226 mSDsCounter, 0 mSdLazyCounter, 5315 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 3510 SdHoareTripleChecker+Invalid, 6249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 5315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 669 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 10:55:44,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 3510 Invalid, 6249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 5315 Invalid, 0 Unknown, 669 Unchecked, 2.9s Time] [2022-07-12 10:55:44,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-07-12 10:55:44,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 500. [2022-07-12 10:55:44,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 354 states have (on average 1.115819209039548) internal successors, (395), 361 states have internal predecessors, (395), 102 states have call successors, (102), 38 states have call predecessors, (102), 43 states have return successors, (153), 100 states have call predecessors, (153), 101 states have call successors, (153) [2022-07-12 10:55:44,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 650 transitions. [2022-07-12 10:55:44,945 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 650 transitions. Word has length 159 [2022-07-12 10:55:44,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:55:44,945 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 650 transitions. [2022-07-12 10:55:44,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 5.733333333333333) internal successors, (172), 29 states have internal predecessors, (172), 11 states have call successors, (48), 7 states have call predecessors, (48), 9 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) [2022-07-12 10:55:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 650 transitions. [2022-07-12 10:55:44,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-12 10:55:44,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:55:44,947 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:55:44,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 10:55:45,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:55:45,163 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:55:45,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:55:45,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1181025098, now seen corresponding path program 1 times [2022-07-12 10:55:45,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:55:45,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990354882] [2022-07-12 10:55:45,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:55:45,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:55:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:55:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:55:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:55:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:55:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:55:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:55:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:55:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:55:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:55:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:55:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:55:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 10:55:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:55:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:55:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 10:55:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 10:55:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 10:55:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 10:55:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:55:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:55:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 10:55:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:45,915 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2022-07-12 10:55:45,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:55:45,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990354882] [2022-07-12 10:55:45,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990354882] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:55:45,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435643082] [2022-07-12 10:55:45,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:55:45,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:55:45,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:55:45,917 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:55:45,918 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:55:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:55:46,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 2857 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-12 10:55:46,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:55:46,672 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1438 (Array Int Int))) (= (store |c_old(#memory_int)| |c_save_byte_from_array_~storage#1.base| v_ArrVal_1438) |c_#memory_int|)) is different from true [2022-07-12 10:55:46,674 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:55:46,679 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1439 (Array Int Int)) (|save_byte_from_array_~storage#1.base| Int)) (= (store |c_old(#memory_int)| |save_byte_from_array_~storage#1.base| v_ArrVal_1439) |c_#memory_int|)) is different from true [2022-07-12 10:55:46,692 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 10:55:46,692 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:55:46,695 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:56:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 135 proven. 40 refuted. 0 times theorem prover too weak. 99 trivial. 2 not checked. [2022-07-12 10:56:06,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:56:07,169 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 30 proven. 14 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2022-07-12 10:56:07,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435643082] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:56:07,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:56:07,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 12] total 57 [2022-07-12 10:56:07,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422093780] [2022-07-12 10:56:07,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:56:07,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-12 10:56:07,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:07,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-12 10:56:07,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2781, Unknown=7, NotChecked=214, Total=3192 [2022-07-12 10:56:07,171 INFO L87 Difference]: Start difference. First operand 500 states and 650 transitions. Second operand has 57 states, 52 states have (on average 4.0) internal successors, (208), 53 states have internal predecessors, (208), 20 states have call successors, (60), 7 states have call predecessors, (60), 15 states have return successors, (59), 18 states have call predecessors, (59), 20 states have call successors, (59) [2022-07-12 10:56:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:28,452 INFO L93 Difference]: Finished difference Result 1195 states and 1659 transitions. [2022-07-12 10:56:28,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-07-12 10:56:28,452 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 52 states have (on average 4.0) internal successors, (208), 53 states have internal predecessors, (208), 20 states have call successors, (60), 7 states have call predecessors, (60), 15 states have return successors, (59), 18 states have call predecessors, (59), 20 states have call successors, (59) Word has length 169 [2022-07-12 10:56:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:28,456 INFO L225 Difference]: With dead ends: 1195 [2022-07-12 10:56:28,456 INFO L226 Difference]: Without dead ends: 989 [2022-07-12 10:56:28,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 360 SyntacticMatches, 16 SemanticMatches, 128 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4431 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=1304, Invalid=14941, Unknown=19, NotChecked=506, Total=16770 [2022-07-12 10:56:28,461 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 1418 mSDsluCounter, 3974 mSDsCounter, 0 mSdLazyCounter, 13906 mSolverCounterSat, 1657 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 4267 SdHoareTripleChecker+Invalid, 19006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1657 IncrementalHoareTripleChecker+Valid, 13906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3443 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:28,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 4267 Invalid, 19006 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1657 Valid, 13906 Invalid, 0 Unknown, 3443 Unchecked, 10.8s Time] [2022-07-12 10:56:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2022-07-12 10:56:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 537. [2022-07-12 10:56:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 383 states have (on average 1.1018276762402088) internal successors, (422), 388 states have internal predecessors, (422), 108 states have call successors, (108), 42 states have call predecessors, (108), 45 states have return successors, (147), 106 states have call predecessors, (147), 107 states have call successors, (147) [2022-07-12 10:56:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 677 transitions. [2022-07-12 10:56:28,548 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 677 transitions. Word has length 169 [2022-07-12 10:56:28,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:28,548 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 677 transitions. [2022-07-12 10:56:28,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 52 states have (on average 4.0) internal successors, (208), 53 states have internal predecessors, (208), 20 states have call successors, (60), 7 states have call predecessors, (60), 15 states have return successors, (59), 18 states have call predecessors, (59), 20 states have call successors, (59) [2022-07-12 10:56:28,549 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 677 transitions. [2022-07-12 10:56:28,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-12 10:56:28,550 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:28,550 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 1, 1, 1, 1, 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,587 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:56:28,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:28,770 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:28,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:28,771 INFO L85 PathProgramCache]: Analyzing trace with hash -61569311, now seen corresponding path program 1 times [2022-07-12 10:56:28,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:28,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238046554] [2022-07-12 10:56:28,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:28,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:56:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:56:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:56:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:56:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:56:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:56:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 10:56:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 10:56:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 10:56:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 10:56:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 10:56:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 10:56:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 10:56:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 10:56:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 10:56:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 10:56:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:56:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 10:56:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2022-07-12 10:56:29,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:29,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238046554] [2022-07-12 10:56:29,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238046554] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:29,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777363040] [2022-07-12 10:56:29,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:29,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:29,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:29,897 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:56:29,898 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:56:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:30,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 2853 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-12 10:56:30,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:30,364 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:56:30,534 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 10:56:30,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 10:56:30,911 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 10:56:30,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 10:56:30,918 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:31,269 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-12 10:56:31,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-12 10:56:31,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 10 treesize of output 6 [2022-07-12 10:56:31,482 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 10:56:31,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 10:56:31,598 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:31,604 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1563 (Array Int Int))) (= (store |c_old(#memory_int)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_1563) |c_#memory_int|)) is different from true [2022-07-12 10:56:31,610 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 19 treesize of output 21 [2022-07-12 10:56:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 86 proven. 124 refuted. 0 times theorem prover too weak. 54 trivial. 2 not checked. [2022-07-12 10:56:52,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:56:52,922 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1567 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#old_byte_from_str~0#1.base| v_ArrVal_1567) |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.offset|)) 18446744073709551616) 0))) is different from false [2022-07-12 10:56:52,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777363040] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:52,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:56:52,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26] total 40 [2022-07-12 10:56:52,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254309391] [2022-07-12 10:56:52,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:56:52,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-12 10:56:52,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:52,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-12 10:56:52,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1741, Unknown=5, NotChecked=170, Total=2070 [2022-07-12 10:56:52,925 INFO L87 Difference]: Start difference. First operand 537 states and 677 transitions. Second operand has 40 states, 36 states have (on average 4.833333333333333) internal successors, (174), 35 states have internal predecessors, (174), 17 states have call successors, (43), 10 states have call predecessors, (43), 11 states have return successors, (42), 14 states have call predecessors, (42), 16 states have call successors, (42) [2022-07-12 10:56:59,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:59,948 INFO L93 Difference]: Finished difference Result 921 states and 1212 transitions. [2022-07-12 10:56:59,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-12 10:56:59,948 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 4.833333333333333) internal successors, (174), 35 states have internal predecessors, (174), 17 states have call successors, (43), 10 states have call predecessors, (43), 11 states have return successors, (42), 14 states have call predecessors, (42), 16 states have call successors, (42) Word has length 167 [2022-07-12 10:56:59,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:59,951 INFO L225 Difference]: With dead ends: 921 [2022-07-12 10:56:59,951 INFO L226 Difference]: Without dead ends: 757 [2022-07-12 10:56:59,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 231 SyntacticMatches, 25 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1930 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=450, Invalid=5710, Unknown=10, NotChecked=310, Total=6480 [2022-07-12 10:56:59,953 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 453 mSDsluCounter, 2736 mSDsCounter, 0 mSdLazyCounter, 2881 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 3007 SdHoareTripleChecker+Invalid, 5473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 2881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2218 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:59,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 3007 Invalid, 5473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 2881 Invalid, 0 Unknown, 2218 Unchecked, 1.9s Time] [2022-07-12 10:56:59,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2022-07-12 10:57:00,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 482. [2022-07-12 10:57:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 348 states have (on average 1.1005747126436782) internal successors, (383), 353 states have internal predecessors, (383), 88 states have call successors, (88), 42 states have call predecessors, (88), 45 states have return successors, (110), 86 states have call predecessors, (110), 87 states have call successors, (110) [2022-07-12 10:57:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 581 transitions. [2022-07-12 10:57:00,010 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 581 transitions. Word has length 167 [2022-07-12 10:57:00,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:00,010 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 581 transitions. [2022-07-12 10:57:00,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 4.833333333333333) internal successors, (174), 35 states have internal predecessors, (174), 17 states have call successors, (43), 10 states have call predecessors, (43), 11 states have return successors, (42), 14 states have call predecessors, (42), 16 states have call successors, (42) [2022-07-12 10:57:00,010 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 581 transitions. [2022-07-12 10:57:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-12 10:57:00,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:00,012 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:57:00,035 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:00,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:00,229 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:00,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:00,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2050665169, now seen corresponding path program 1 times [2022-07-12 10:57:00,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:00,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441398616] [2022-07-12 10:57:00,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:00,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:57:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:57:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:57:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:57:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:57:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:57:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:57:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:57:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 10:57:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:57:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 10:57:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 10:57:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 10:57:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 10:57:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:57:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 10:57:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-07-12 10:57:00,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:00,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441398616] [2022-07-12 10:57:00,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441398616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:00,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:00,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 10:57:00,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093706205] [2022-07-12 10:57:00,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:00,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 10:57:00,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:00,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 10:57:00,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:57:00,496 INFO L87 Difference]: Start difference. First operand 482 states and 581 transitions. Second operand has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-12 10:57:01,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:01,201 INFO L93 Difference]: Finished difference Result 490 states and 589 transitions. [2022-07-12 10:57:01,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 10:57:01,204 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2022-07-12 10:57:01,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:01,205 INFO L225 Difference]: With dead ends: 490 [2022-07-12 10:57:01,205 INFO L226 Difference]: Without dead ends: 488 [2022-07-12 10:57:01,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-07-12 10:57:01,206 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 154 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:01,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 845 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 10:57:01,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-07-12 10:57:01,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 481. [2022-07-12 10:57:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 348 states have (on average 1.1005747126436782) internal successors, (383), 353 states have internal predecessors, (383), 87 states have call successors, (87), 42 states have call predecessors, (87), 45 states have return successors, (109), 85 states have call predecessors, (109), 86 states have call successors, (109) [2022-07-12 10:57:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 579 transitions. [2022-07-12 10:57:01,252 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 579 transitions. Word has length 164 [2022-07-12 10:57:01,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:01,252 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 579 transitions. [2022-07-12 10:57:01,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-12 10:57:01,252 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 579 transitions. [2022-07-12 10:57:01,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-12 10:57:01,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:01,254 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:57:01,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 10:57:01,254 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:01,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:01,254 INFO L85 PathProgramCache]: Analyzing trace with hash 969726479, now seen corresponding path program 1 times [2022-07-12 10:57:01,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:01,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091299407] [2022-07-12 10:57:01,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:01,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 10:57:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 10:57:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 10:57:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 10:57:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 10:57:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 10:57:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:57:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:57:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:57:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 10:57:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:57:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 10:57:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 10:57:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 10:57:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 10:57:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 10:57:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 10:57:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 10:57:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2022-07-12 10:57:02,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:02,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091299407] [2022-07-12 10:57:02,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091299407] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:02,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048334128] [2022-07-12 10:57:02,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:02,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:02,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:02,124 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:02,125 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:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 2849 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-12 10:57:02,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:02,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:57:02,718 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