./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_secure_zero_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_secure_zero_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 9db28b965fea5f2f8d3364c7a869d0042b63b50d32f7a417c3baadcb401d0709 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:56:41,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:56:41,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:56:41,683 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:56:41,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:56:41,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:56:41,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:56:41,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:56:41,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:56:41,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:56:41,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:56:41,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:56:41,697 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:56:41,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:56:41,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:56:41,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:56:41,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:56:41,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:56:41,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:56:41,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:56:41,710 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:56:41,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:56:41,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:56:41,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:56:41,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:56:41,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:56:41,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:56:41,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:56:41,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:56:41,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:56:41,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:56:41,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:56:41,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:56:41,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:56:41,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:56:41,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:56:41,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:56:41,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:56:41,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:56:41,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:56:41,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:56:41,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:56:41,725 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 10:56:41,746 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:56:41,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:56:41,747 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:56:41,747 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:56:41,748 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:56:41,748 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:56:41,748 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:56:41,748 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:56:41,748 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:56:41,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:56:41,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:56:41,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:56:41,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:56:41,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:56:41,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:56:41,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:56:41,750 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:56:41,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:56:41,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:56:41,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:56:41,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:56:41,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:56:41,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:56:41,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:56:41,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:56:41,752 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:56:41,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:56:41,753 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:56:41,753 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:56:41,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:56:41,753 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 -> 9db28b965fea5f2f8d3364c7a869d0042b63b50d32f7a417c3baadcb401d0709 [2022-07-12 10:56:41,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:56:41,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:56:41,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:56:41,924 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:56:41,924 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:56:41,925 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_secure_zero_harness.i [2022-07-12 10:56:41,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/170188761/a001221b9f084e4ab434f13005cd3181/FLAGe7434d32a [2022-07-12 10:56:42,585 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:56:42,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_secure_zero_harness.i [2022-07-12 10:56:42,611 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/170188761/a001221b9f084e4ab434f13005cd3181/FLAGe7434d32a [2022-07-12 10:56:42,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/170188761/a001221b9f084e4ab434f13005cd3181 [2022-07-12 10:56:42,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:56:42,955 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:56:42,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:56:42,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:56:42,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:56:42,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:56:42" (1/1) ... [2022-07-12 10:56:42,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5182c9b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:42, skipping insertion in model container [2022-07-12 10:56:42,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:56:42" (1/1) ... [2022-07-12 10:56:42,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:56:43,047 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:56:43,200 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_secure_zero_harness.i[4498,4511] [2022-07-12 10:56:43,205 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_secure_zero_harness.i[4558,4571] [2022-07-12 10:56:43,659 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:43,660 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:43,660 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:43,661 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:43,661 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:43,669 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:43,669 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:43,670 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:43,671 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:43,869 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 10:56:43,870 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 10:56:43,870 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 10:56:43,871 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 10:56:43,872 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 10:56:43,872 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 10:56:43,873 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 10:56:43,873 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 10:56:43,873 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 10:56:43,874 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 10:56:43,957 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 10:56:44,054 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:44,074 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:44,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:56:44,172 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:56:44,190 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_secure_zero_harness.i[4498,4511] [2022-07-12 10:56:44,192 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_secure_zero_harness.i[4558,4571] [2022-07-12 10:56:44,221 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:44,222 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:44,222 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:44,223 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:44,226 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:44,234 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:44,235 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:44,236 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:44,236 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:44,268 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 10:56:44,268 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 10:56:44,269 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 10:56:44,270 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 10:56:44,271 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 10:56:44,271 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 10:56:44,271 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 10:56:44,272 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 10:56:44,272 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 10:56:44,272 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 10:56:44,287 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 10:56:44,332 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:44,333 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:44,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:56:44,528 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:56:44,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:44 WrapperNode [2022-07-12 10:56:44,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:56:44,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:56:44,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:56:44,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:56:44,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:44" (1/1) ... [2022-07-12 10:56:44,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:44" (1/1) ... [2022-07-12 10:56:44,671 INFO L137 Inliner]: procedures = 691, calls = 2614, calls flagged for inlining = 60, calls inlined = 8, statements flattened = 796 [2022-07-12 10:56:44,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:56:44,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:56:44,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:56:44,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:56:44,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:44" (1/1) ... [2022-07-12 10:56:44,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:44" (1/1) ... [2022-07-12 10:56:44,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:44" (1/1) ... [2022-07-12 10:56:44,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:44" (1/1) ... [2022-07-12 10:56:44,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:44" (1/1) ... [2022-07-12 10:56:44,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:44" (1/1) ... [2022-07-12 10:56:44,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:44" (1/1) ... [2022-07-12 10:56:44,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:56:44,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:56:44,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:56:44,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:56:44,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:44" (1/1) ... [2022-07-12 10:56:44,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:56:44,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:44,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 10:56:44,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 10:56:44,837 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-12 10:56:44,837 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-12 10:56:44,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:56:44,838 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 10:56:44,838 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 10:56:44,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:56:44,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 10:56:44,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 10:56:44,839 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_secure_zero [2022-07-12 10:56:44,839 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_secure_zero [2022-07-12 10:56:44,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 10:56:44,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:56:44,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 10:56:44,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:56:44,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:56:44,841 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 10:56:44,841 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 10:56:44,841 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 10:56:44,841 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 10:56:44,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:56:44,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 10:56:44,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 10:56:44,841 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-12 10:56:44,842 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-12 10:56:44,842 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 10:56:44,842 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 10:56:44,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:56:44,842 INFO L130 BoogieDeclarations]: Found specification of procedure memset_impl [2022-07-12 10:56:44,843 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_impl [2022-07-12 10:56:44,843 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2022-07-12 10:56:44,843 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2022-07-12 10:56:44,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:56:45,074 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:56:45,075 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:56:45,712 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:56:45,718 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:56:45,719 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 10:56:45,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:56:45 BoogieIcfgContainer [2022-07-12 10:56:45,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:56:45,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:56:45,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:56:45,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:56:45,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:56:42" (1/3) ... [2022-07-12 10:56:45,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0d185b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:56:45, skipping insertion in model container [2022-07-12 10:56:45,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:44" (2/3) ... [2022-07-12 10:56:45,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0d185b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:56:45, skipping insertion in model container [2022-07-12 10:56:45,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:56:45" (3/3) ... [2022-07-12 10:56:45,727 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_secure_zero_harness.i [2022-07-12 10:56:45,736 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:56:45,736 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:56:45,789 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:56:45,795 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@322649c0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@37486564 [2022-07-12 10:56:45,795 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 10:56:45,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 71 states have internal predecessors, (86), 21 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-12 10:56:45,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 10:56:45,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:45,808 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:56:45,809 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:45,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:45,813 INFO L85 PathProgramCache]: Analyzing trace with hash -70528239, now seen corresponding path program 1 times [2022-07-12 10:56:45,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:45,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711364030] [2022-07-12 10:56:45,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:45,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:56:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 10:56:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 10:56:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:56:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-12 10:56:46,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:46,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711364030] [2022-07-12 10:56:46,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711364030] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:46,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:46,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:56:46,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521979449] [2022-07-12 10:56:46,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:46,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:56:46,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:46,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:56:46,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:56:46,363 INFO L87 Difference]: Start difference. First operand has 103 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 71 states have internal predecessors, (86), 21 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:56:46,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:46,474 INFO L93 Difference]: Finished difference Result 202 states and 265 transitions. [2022-07-12 10:56:46,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:56:46,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2022-07-12 10:56:46,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:46,481 INFO L225 Difference]: With dead ends: 202 [2022-07-12 10:56:46,481 INFO L226 Difference]: Without dead ends: 98 [2022-07-12 10:56:46,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:56:46,493 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 58 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:46,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 138 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 10:56:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-12 10:56:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-12 10:56:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.196969696969697) internal successors, (79), 67 states have internal predecessors, (79), 21 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-12 10:56:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2022-07-12 10:56:46,536 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 65 [2022-07-12 10:56:46,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:46,537 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2022-07-12 10:56:46,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:56:46,537 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2022-07-12 10:56:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 10:56:46,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:46,549 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:56:46,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:56:46,550 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:46,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:46,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1061132297, now seen corresponding path program 1 times [2022-07-12 10:56:46,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:46,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519555227] [2022-07-12 10:56:46,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:46,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:56:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 10:56:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 10:56:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 10:56:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,831 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-12 10:56:46,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:46,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519555227] [2022-07-12 10:56:46,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519555227] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:46,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294657082] [2022-07-12 10:56:46,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:46,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:46,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:46,834 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:46,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 10:56:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:47,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 2469 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 10:56:47,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 10:56:47,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:47,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294657082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:47,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:47,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-07-12 10:56:47,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129484960] [2022-07-12 10:56:47,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:47,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:56:47,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:47,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:56:47,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:56:47,337 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 10:56:47,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:47,415 INFO L93 Difference]: Finished difference Result 174 states and 217 transitions. [2022-07-12 10:56:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 10:56:47,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 65 [2022-07-12 10:56:47,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:47,418 INFO L225 Difference]: With dead ends: 174 [2022-07-12 10:56:47,418 INFO L226 Difference]: Without dead ends: 101 [2022-07-12 10:56:47,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:56:47,419 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 140 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:47,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 272 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 10:56:47,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-12 10:56:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-12 10:56:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 21 states have call successors, (21), 10 states have call predecessors, (21), 11 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2022-07-12 10:56:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2022-07-12 10:56:47,428 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 65 [2022-07-12 10:56:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:47,429 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2022-07-12 10:56:47,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 10:56:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2022-07-12 10:56:47,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 10:56:47,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:47,430 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:56:47,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:47,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:47,648 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:47,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:47,648 INFO L85 PathProgramCache]: Analyzing trace with hash -883820620, now seen corresponding path program 1 times [2022-07-12 10:56:47,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:47,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195752280] [2022-07-12 10:56:47,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:47,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:47,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:47,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:47,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:47,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:47,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:56:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 10:56:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:56:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 10:56:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,058 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 10:56:48,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:48,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195752280] [2022-07-12 10:56:48,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195752280] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:48,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482988388] [2022-07-12 10:56:48,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:48,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:48,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:48,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:48,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 10:56:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 2486 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 10:56:48,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 10:56:48,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:48,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482988388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:48,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:48,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2022-07-12 10:56:48,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380653847] [2022-07-12 10:56:48,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:48,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:56:48,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:48,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:56:48,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:56:48,499 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-12 10:56:48,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:48,633 INFO L93 Difference]: Finished difference Result 172 states and 211 transitions. [2022-07-12 10:56:48,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:56:48,633 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 71 [2022-07-12 10:56:48,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:48,636 INFO L225 Difference]: With dead ends: 172 [2022-07-12 10:56:48,636 INFO L226 Difference]: Without dead ends: 98 [2022-07-12 10:56:48,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-07-12 10:56:48,639 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 150 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:48,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 413 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 10:56:48,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-12 10:56:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-12 10:56:48,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 67 states have internal predecessors, (78), 21 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-12 10:56:48,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2022-07-12 10:56:48,648 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 71 [2022-07-12 10:56:48,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:48,648 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2022-07-12 10:56:48,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-12 10:56:48,648 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2022-07-12 10:56:48,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-12 10:56:48,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:48,649 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:48,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-12 10:56:48,863 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:48,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:48,864 INFO L85 PathProgramCache]: Analyzing trace with hash 81192906, now seen corresponding path program 1 times [2022-07-12 10:56:48,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:48,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044671255] [2022-07-12 10:56:48,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:48,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:56:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 10:56:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 10:56:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 10:56:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-12 10:56:49,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:49,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044671255] [2022-07-12 10:56:49,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044671255] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:49,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:49,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:56:49,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031117054] [2022-07-12 10:56:49,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:49,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:56:49,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:49,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:56:49,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:56:49,085 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-12 10:56:49,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:49,414 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2022-07-12 10:56:49,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:56:49,415 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 83 [2022-07-12 10:56:49,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:49,416 INFO L225 Difference]: With dead ends: 110 [2022-07-12 10:56:49,416 INFO L226 Difference]: Without dead ends: 108 [2022-07-12 10:56:49,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-07-12 10:56:49,417 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 84 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:49,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 338 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:56:49,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-12 10:56:49,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2022-07-12 10:56:49,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 74 states have internal predecessors, (84), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (25), 21 states have call predecessors, (25), 21 states have call successors, (25) [2022-07-12 10:56:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2022-07-12 10:56:49,424 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 83 [2022-07-12 10:56:49,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:49,425 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2022-07-12 10:56:49,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-12 10:56:49,425 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2022-07-12 10:56:49,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-12 10:56:49,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:49,427 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 10:56:49,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:56:49,427 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:49,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:49,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1920648402, now seen corresponding path program 1 times [2022-07-12 10:56:49,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:49,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266321363] [2022-07-12 10:56:49,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:49,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:56:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 10:56:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 10:56:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 10:56:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,675 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-12 10:56:49,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:49,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266321363] [2022-07-12 10:56:49,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266321363] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:49,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:49,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:56:49,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169019022] [2022-07-12 10:56:49,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:49,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:56:49,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:49,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:56:49,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:56:49,677 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:56:50,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:50,046 INFO L93 Difference]: Finished difference Result 214 states and 275 transitions. [2022-07-12 10:56:50,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:56:50,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 87 [2022-07-12 10:56:50,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:50,047 INFO L225 Difference]: With dead ends: 214 [2022-07-12 10:56:50,047 INFO L226 Difference]: Without dead ends: 132 [2022-07-12 10:56:50,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:56:50,048 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 126 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:50,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 245 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:56:50,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-12 10:56:50,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2022-07-12 10:56:50,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 79 states have internal predecessors, (91), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (25), 21 states have call predecessors, (25), 21 states have call successors, (25) [2022-07-12 10:56:50,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2022-07-12 10:56:50,058 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 87 [2022-07-12 10:56:50,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:50,058 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2022-07-12 10:56:50,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:56:50,058 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-07-12 10:56:50,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-12 10:56:50,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:50,069 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 10:56:50,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:56:50,069 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:50,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:50,070 INFO L85 PathProgramCache]: Analyzing trace with hash -2116153456, now seen corresponding path program 1 times [2022-07-12 10:56:50,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:50,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350779937] [2022-07-12 10:56:50,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:50,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:56:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 10:56:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 10:56:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 10:56:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 10:56:50,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:50,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350779937] [2022-07-12 10:56:50,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350779937] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:50,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893122682] [2022-07-12 10:56:50,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:50,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:50,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:50,480 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:50,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 10:56:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 2527 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 10:56:50,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:50,867 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:56:51,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:56:51,107 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-12 10:56:51,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 1 [2022-07-12 10:56:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 10:56:51,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:51,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893122682] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:51,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:51,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 17 [2022-07-12 10:56:51,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970329453] [2022-07-12 10:56:51,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:51,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 10:56:51,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:51,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 10:56:51,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-07-12 10:56:51,111 INFO L87 Difference]: Start difference. First operand 112 states and 138 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-12 10:56:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:51,164 INFO L93 Difference]: Finished difference Result 222 states and 275 transitions. [2022-07-12 10:56:51,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 10:56:51,165 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 87 [2022-07-12 10:56:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:51,166 INFO L225 Difference]: With dead ends: 222 [2022-07-12 10:56:51,166 INFO L226 Difference]: Without dead ends: 131 [2022-07-12 10:56:51,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:56:51,167 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 25 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:51,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 819 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 99 Unchecked, 0.0s Time] [2022-07-12 10:56:51,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-12 10:56:51,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-12 10:56:51,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 95 states have (on average 1.2) internal successors, (114), 97 states have internal predecessors, (114), 22 states have call successors, (22), 12 states have call predecessors, (22), 13 states have return successors, (25), 21 states have call predecessors, (25), 21 states have call successors, (25) [2022-07-12 10:56:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 161 transitions. [2022-07-12 10:56:51,177 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 161 transitions. Word has length 87 [2022-07-12 10:56:51,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:51,177 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 161 transitions. [2022-07-12 10:56:51,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-12 10:56:51,178 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 161 transitions. [2022-07-12 10:56:51,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-12 10:56:51,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:51,179 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 10:56:51,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:51,395 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:56:51,395 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:51,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:51,396 INFO L85 PathProgramCache]: Analyzing trace with hash -729368046, now seen corresponding path program 1 times [2022-07-12 10:56:51,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:51,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141154286] [2022-07-12 10:56:51,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:51,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:56:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 10:56:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 10:56:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 10:56:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,525 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 10:56:51,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:51,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141154286] [2022-07-12 10:56:51,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141154286] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:51,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44454600] [2022-07-12 10:56:51,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:51,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:51,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:51,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:51,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 10:56:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 2522 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 10:56:51,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 10:56:51,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:51,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44454600] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:51,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:51,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-12 10:56:51,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151179726] [2022-07-12 10:56:51,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:51,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:56:51,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:51,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:56:51,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:56:51,893 INFO L87 Difference]: Start difference. First operand 131 states and 161 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:56:51,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:51,910 INFO L93 Difference]: Finished difference Result 231 states and 291 transitions. [2022-07-12 10:56:51,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:56:51,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 87 [2022-07-12 10:56:51,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:51,912 INFO L225 Difference]: With dead ends: 231 [2022-07-12 10:56:51,912 INFO L226 Difference]: Without dead ends: 140 [2022-07-12 10:56:51,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:56:51,913 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 20 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 349 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:56:51,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 349 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 10:56:51,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-12 10:56:51,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 123. [2022-07-12 10:56:51,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 89 states have internal predecessors, (105), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (24), 21 states have call predecessors, (24), 21 states have call successors, (24) [2022-07-12 10:56:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 151 transitions. [2022-07-12 10:56:51,927 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 151 transitions. Word has length 87 [2022-07-12 10:56:51,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:51,927 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 151 transitions. [2022-07-12 10:56:51,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:56:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions. [2022-07-12 10:56:51,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-12 10:56:51,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:51,929 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:56:51,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:52,148 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:56:52,148 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:52,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:52,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2043691690, now seen corresponding path program 2 times [2022-07-12 10:56:52,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:52,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698441819] [2022-07-12 10:56:52,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:52,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:56:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:56:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 10:56:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:56:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 10:56:52,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:52,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698441819] [2022-07-12 10:56:52,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698441819] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:52,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569443733] [2022-07-12 10:56:52,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:56:52,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:52,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:52,387 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:52,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 10:56:52,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 10:56:52,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:56:52,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 2334 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 10:56:52,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:52,750 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-12 10:56:52,751 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 21 treesize of output 20 [2022-07-12 10:56:52,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:52,756 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 21 treesize of output 20 [2022-07-12 10:56:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-12 10:56:53,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:53,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569443733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:53,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:53,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2022-07-12 10:56:53,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637205093] [2022-07-12 10:56:53,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:53,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:56:53,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:53,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:56:53,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-12 10:56:53,022 INFO L87 Difference]: Start difference. First operand 123 states and 151 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:56:53,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:53,219 INFO L93 Difference]: Finished difference Result 226 states and 276 transitions. [2022-07-12 10:56:53,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:56:53,220 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 91 [2022-07-12 10:56:53,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:53,220 INFO L225 Difference]: With dead ends: 226 [2022-07-12 10:56:53,221 INFO L226 Difference]: Without dead ends: 160 [2022-07-12 10:56:53,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-12 10:56:53,221 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 64 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:53,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 504 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 101 Unchecked, 0.0s Time] [2022-07-12 10:56:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-12 10:56:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-07-12 10:56:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 125 states have internal predecessors, (148), 23 states have call successors, (23), 13 states have call predecessors, (23), 14 states have return successors, (26), 21 states have call predecessors, (26), 22 states have call successors, (26) [2022-07-12 10:56:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 197 transitions. [2022-07-12 10:56:53,227 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 197 transitions. Word has length 91 [2022-07-12 10:56:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:53,228 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 197 transitions. [2022-07-12 10:56:53,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:56:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 197 transitions. [2022-07-12 10:56:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-12 10:56:53,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:53,229 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:56:53,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:53,442 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:56:53,442 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:53,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:53,442 INFO L85 PathProgramCache]: Analyzing trace with hash 971411928, now seen corresponding path program 2 times [2022-07-12 10:56:53,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:53,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723946201] [2022-07-12 10:56:53,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:53,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:56:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:56:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 10:56:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:56:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,649 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 10:56:53,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:53,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723946201] [2022-07-12 10:56:53,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723946201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:53,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:53,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:56:53,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272741347] [2022-07-12 10:56:53,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:53,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:56:53,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:53,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:56:53,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:56:53,651 INFO L87 Difference]: Start difference. First operand 160 states and 197 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:56:53,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:53,989 INFO L93 Difference]: Finished difference Result 259 states and 316 transitions. [2022-07-12 10:56:53,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:56:53,989 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 91 [2022-07-12 10:56:53,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:53,990 INFO L225 Difference]: With dead ends: 259 [2022-07-12 10:56:53,990 INFO L226 Difference]: Without dead ends: 187 [2022-07-12 10:56:53,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:56:53,991 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 136 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:53,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 272 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:56:53,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-12 10:56:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 169. [2022-07-12 10:56:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 130 states have (on average 1.2076923076923076) internal successors, (157), 134 states have internal predecessors, (157), 23 states have call successors, (23), 13 states have call predecessors, (23), 15 states have return successors, (29), 21 states have call predecessors, (29), 22 states have call successors, (29) [2022-07-12 10:56:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 209 transitions. [2022-07-12 10:56:53,998 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 209 transitions. Word has length 91 [2022-07-12 10:56:53,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:53,998 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 209 transitions. [2022-07-12 10:56:53,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:56:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 209 transitions. [2022-07-12 10:56:53,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-12 10:56:53,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:53,999 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:56:54,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 10:56:54,000 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:54,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:54,000 INFO L85 PathProgramCache]: Analyzing trace with hash -875101412, now seen corresponding path program 1 times [2022-07-12 10:56:54,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:54,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573485563] [2022-07-12 10:56:54,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:54,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:54,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:54,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:54,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:54,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:54,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:54,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:56:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:54,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:56:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:54,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 10:56:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:54,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:56:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 10:56:54,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:54,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573485563] [2022-07-12 10:56:54,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573485563] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:54,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055070340] [2022-07-12 10:56:54,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:54,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:54,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:54,182 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:54,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 10:56:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:54,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 2531 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 10:56:54,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:54,675 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-12 10:56:54,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 10:56:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 10:56:54,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:56:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 10:56:55,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055070340] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:56:55,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:56:55,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 24 [2022-07-12 10:56:55,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404245799] [2022-07-12 10:56:55,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:56:55,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 10:56:55,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:55,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 10:56:55,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2022-07-12 10:56:55,225 INFO L87 Difference]: Start difference. First operand 169 states and 209 transitions. Second operand has 24 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 22 states have internal predecessors, (100), 4 states have call successors, (19), 4 states have call predecessors, (19), 7 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-12 10:56:56,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:56,607 INFO L93 Difference]: Finished difference Result 368 states and 465 transitions. [2022-07-12 10:56:56,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 10:56:56,607 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 22 states have internal predecessors, (100), 4 states have call successors, (19), 4 states have call predecessors, (19), 7 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 91 [2022-07-12 10:56:56,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:56,609 INFO L225 Difference]: With dead ends: 368 [2022-07-12 10:56:56,609 INFO L226 Difference]: Without dead ends: 233 [2022-07-12 10:56:56,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 186 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=321, Invalid=1659, Unknown=0, NotChecked=0, Total=1980 [2022-07-12 10:56:56,610 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 284 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 326 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:56,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 544 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1389 Invalid, 0 Unknown, 326 Unchecked, 0.8s Time] [2022-07-12 10:56:56,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-12 10:56:56,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 222. [2022-07-12 10:56:56,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 173 states have (on average 1.1734104046242775) internal successors, (203), 183 states have internal predecessors, (203), 25 states have call successors, (25), 15 states have call predecessors, (25), 23 states have return successors, (49), 23 states have call predecessors, (49), 24 states have call successors, (49) [2022-07-12 10:56:56,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 277 transitions. [2022-07-12 10:56:56,619 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 277 transitions. Word has length 91 [2022-07-12 10:56:56,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:56,619 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 277 transitions. [2022-07-12 10:56:56,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 22 states have internal predecessors, (100), 4 states have call successors, (19), 4 states have call predecessors, (19), 7 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-12 10:56:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 277 transitions. [2022-07-12 10:56:56,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-12 10:56:56,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:56,620 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:56:56,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:56,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:56,842 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:56,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:56,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1597930877, now seen corresponding path program 1 times [2022-07-12 10:56:56,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:56,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992798547] [2022-07-12 10:56:56,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:56,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:56:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:56:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:56:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-12 10:56:56,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:56,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992798547] [2022-07-12 10:56:56,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992798547] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:56,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781629195] [2022-07-12 10:56:56,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:56,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:56,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:56,977 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:57,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 10:56:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 2533 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 10:56:57,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 10:56:57,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:57,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781629195] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:57,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:57,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-12 10:56:57,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634120029] [2022-07-12 10:56:57,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:57,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:56:57,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:57,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:56:57,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:56:57,340 INFO L87 Difference]: Start difference. First operand 222 states and 277 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:56:57,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:57,359 INFO L93 Difference]: Finished difference Result 404 states and 514 transitions. [2022-07-12 10:56:57,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:56:57,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2022-07-12 10:56:57,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:57,360 INFO L225 Difference]: With dead ends: 404 [2022-07-12 10:56:57,360 INFO L226 Difference]: Without dead ends: 207 [2022-07-12 10:56:57,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:56:57,361 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 9 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 342 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:56:57,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 342 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 10:56:57,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-12 10:56:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 198. [2022-07-12 10:56:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 152 states have (on average 1.144736842105263) internal successors, (174), 159 states have internal predecessors, (174), 25 states have call successors, (25), 15 states have call predecessors, (25), 20 states have return successors, (40), 23 states have call predecessors, (40), 24 states have call successors, (40) [2022-07-12 10:56:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 239 transitions. [2022-07-12 10:56:57,377 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 239 transitions. Word has length 93 [2022-07-12 10:56:57,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:57,377 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 239 transitions. [2022-07-12 10:56:57,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:56:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 239 transitions. [2022-07-12 10:56:57,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-12 10:56:57,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:57,378 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:56:57,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:57,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:57,598 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:57,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:57,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1845910727, now seen corresponding path program 1 times [2022-07-12 10:56:57,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:57,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609613708] [2022-07-12 10:56:57,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:57,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:56:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:56:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:56:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-12 10:56:57,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:57,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609613708] [2022-07-12 10:56:57,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609613708] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:57,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203499111] [2022-07-12 10:56:57,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:57,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:57,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:57,718 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:57,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 10:56:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 2535 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 10:56:58,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-12 10:56:58,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:58,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203499111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:58,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:58,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-12 10:56:58,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408098569] [2022-07-12 10:56:58,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:58,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:56:58,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:58,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:56:58,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:56:58,048 INFO L87 Difference]: Start difference. First operand 198 states and 239 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:56:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:58,066 INFO L93 Difference]: Finished difference Result 350 states and 436 transitions. [2022-07-12 10:56:58,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:56:58,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2022-07-12 10:56:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:58,067 INFO L225 Difference]: With dead ends: 350 [2022-07-12 10:56:58,067 INFO L226 Difference]: Without dead ends: 182 [2022-07-12 10:56:58,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:56:58,068 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 34 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 340 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:56:58,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 340 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 10:56:58,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-12 10:56:58,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2022-07-12 10:56:58,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 136 states have (on average 1.125) internal successors, (153), 141 states have internal predecessors, (153), 25 states have call successors, (25), 15 states have call predecessors, (25), 18 states have return successors, (36), 23 states have call predecessors, (36), 24 states have call successors, (36) [2022-07-12 10:56:58,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 214 transitions. [2022-07-12 10:56:58,074 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 214 transitions. Word has length 93 [2022-07-12 10:56:58,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:58,075 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 214 transitions. [2022-07-12 10:56:58,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 10:56:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 214 transitions. [2022-07-12 10:56:58,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-12 10:56:58,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:58,076 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 10:56:58,097 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:56:58,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 10:56:58,295 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:58,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:58,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1337532371, now seen corresponding path program 1 times [2022-07-12 10:56:58,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:58,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155997688] [2022-07-12 10:56:58,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:58,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:56:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 10:56:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:56:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,493 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-12 10:56:58,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:58,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155997688] [2022-07-12 10:56:58,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155997688] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:58,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172674875] [2022-07-12 10:56:58,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:58,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:58,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:58,495 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:58,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 10:56:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 2537 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 10:56:58,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:58,920 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:56:59,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:56:59,190 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:56:59,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 11 [2022-07-12 10:56:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 10:56:59,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:59,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172674875] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:59,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:59,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2022-07-12 10:56:59,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169766531] [2022-07-12 10:56:59,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:59,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:56:59,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:59,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:56:59,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-12 10:56:59,207 INFO L87 Difference]: Start difference. First operand 180 states and 214 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 9 states have internal predecessors, (58), 6 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-12 10:56:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:59,330 INFO L93 Difference]: Finished difference Result 367 states and 438 transitions. [2022-07-12 10:56:59,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:56:59,331 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 9 states have internal predecessors, (58), 6 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 97 [2022-07-12 10:56:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:59,333 INFO L225 Difference]: With dead ends: 367 [2022-07-12 10:56:59,333 INFO L226 Difference]: Without dead ends: 248 [2022-07-12 10:56:59,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 99 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2022-07-12 10:56:59,334 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 22 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:59,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 887 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-07-12 10:56:59,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-12 10:56:59,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 233. [2022-07-12 10:56:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 179 states have (on average 1.1229050279329609) internal successors, (201), 185 states have internal predecessors, (201), 30 states have call successors, (30), 19 states have call predecessors, (30), 23 states have return successors, (47), 28 states have call predecessors, (47), 29 states have call successors, (47) [2022-07-12 10:56:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 278 transitions. [2022-07-12 10:56:59,342 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 278 transitions. Word has length 97 [2022-07-12 10:56:59,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:59,342 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 278 transitions. [2022-07-12 10:56:59,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 9 states have internal predecessors, (58), 6 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-12 10:56:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 278 transitions. [2022-07-12 10:56:59,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-12 10:56:59,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:59,344 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 10:56:59,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 10:56:59,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 10:56:59,551 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:59,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:59,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1898232149, now seen corresponding path program 1 times [2022-07-12 10:56:59,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:59,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585495503] [2022-07-12 10:56:59,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:59,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:56:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 10:56:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:56:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-12 10:56:59,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:59,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585495503] [2022-07-12 10:56:59,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585495503] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:59,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852672253] [2022-07-12 10:56:59,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:59,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:59,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:59,740 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:56:59,755 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:57:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 2542 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-12 10:57:00,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:00,147 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:00,424 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:57:00,425 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:57:00,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 11 [2022-07-12 10:57:00,440 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 10:57:00,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:57:00,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852672253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:00,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:57:00,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2022-07-12 10:57:00,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125879039] [2022-07-12 10:57:00,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:00,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:57:00,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:00,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:57:00,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-12 10:57:00,442 INFO L87 Difference]: Start difference. First operand 233 states and 278 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 9 states have internal predecessors, (58), 6 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-12 10:57:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:00,544 INFO L93 Difference]: Finished difference Result 385 states and 441 transitions. [2022-07-12 10:57:00,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:57:00,546 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 9 states have internal predecessors, (58), 6 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 97 [2022-07-12 10:57:00,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:00,547 INFO L225 Difference]: With dead ends: 385 [2022-07-12 10:57:00,547 INFO L226 Difference]: Without dead ends: 266 [2022-07-12 10:57:00,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 99 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2022-07-12 10:57:00,548 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 25 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:00,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 650 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-07-12 10:57:00,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-12 10:57:00,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 245. [2022-07-12 10:57:00,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 190 states have (on average 1.1157894736842104) internal successors, (212), 197 states have internal predecessors, (212), 29 states have call successors, (29), 20 states have call predecessors, (29), 25 states have return successors, (43), 27 states have call predecessors, (43), 28 states have call successors, (43) [2022-07-12 10:57:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 284 transitions. [2022-07-12 10:57:00,557 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 284 transitions. Word has length 97 [2022-07-12 10:57:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:00,557 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 284 transitions. [2022-07-12 10:57:00,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 9 states have internal predecessors, (58), 6 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-12 10:57:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 284 transitions. [2022-07-12 10:57:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-12 10:57:00,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:00,558 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:57:00,580 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:57:00,758 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,SelfDestructingSolverStorable13 [2022-07-12 10:57:00,759 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:00,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:00,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2013780926, now seen corresponding path program 1 times [2022-07-12 10:57:00,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:00,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559131068] [2022-07-12 10:57:00,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:00,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:57:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:57:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:57:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 10:57:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:57:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 10:57:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,976 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-12 10:57:00,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:00,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559131068] [2022-07-12 10:57:00,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559131068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:00,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:00,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:57:00,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782833928] [2022-07-12 10:57:00,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:00,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:57:00,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:00,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:57:00,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:57:00,978 INFO L87 Difference]: Start difference. First operand 245 states and 284 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-12 10:57:01,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:01,396 INFO L93 Difference]: Finished difference Result 263 states and 303 transitions. [2022-07-12 10:57:01,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:57:01,396 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2022-07-12 10:57:01,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:01,397 INFO L225 Difference]: With dead ends: 263 [2022-07-12 10:57:01,397 INFO L226 Difference]: Without dead ends: 261 [2022-07-12 10:57:01,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 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:57:01,398 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 139 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:01,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 325 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:57:01,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-12 10:57:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2022-07-12 10:57:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 193 states have (on average 1.1139896373056994) internal successors, (215), 200 states have internal predecessors, (215), 30 states have call successors, (30), 21 states have call predecessors, (30), 26 states have return successors, (44), 28 states have call predecessors, (44), 29 states have call successors, (44) [2022-07-12 10:57:01,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 289 transitions. [2022-07-12 10:57:01,406 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 289 transitions. Word has length 109 [2022-07-12 10:57:01,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:01,407 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 289 transitions. [2022-07-12 10:57:01,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-12 10:57:01,407 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 289 transitions. [2022-07-12 10:57:01,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-12 10:57:01,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:01,408 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:57:01,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 10:57:01,410 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:01,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:01,410 INFO L85 PathProgramCache]: Analyzing trace with hash 920679761, now seen corresponding path program 1 times [2022-07-12 10:57:01,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:01,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821885311] [2022-07-12 10:57:01,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:01,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:57:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:57:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:57:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 10:57:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 10:57:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 10:57:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,803 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-12 10:57:01,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:01,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821885311] [2022-07-12 10:57:01,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821885311] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:01,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024045544] [2022-07-12 10:57:01,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:01,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:01,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:01,805 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:57:01,806 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:57:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 2629 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 10:57:02,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:02,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:57:02,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:57:02,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 10:57:02,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 10:57:02,395 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 10:57:02,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:57:02,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024045544] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:02,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:57:02,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-07-12 10:57:02,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424393147] [2022-07-12 10:57:02,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:02,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:57:02,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:02,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:57:02,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2022-07-12 10:57:02,397 INFO L87 Difference]: Start difference. First operand 250 states and 289 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 9 states have internal predecessors, (79), 4 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-12 10:57:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:02,640 INFO L93 Difference]: Finished difference Result 367 states and 423 transitions. [2022-07-12 10:57:02,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:57:02,640 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 9 states have internal predecessors, (79), 4 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 111 [2022-07-12 10:57:02,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:02,641 INFO L225 Difference]: With dead ends: 367 [2022-07-12 10:57:02,641 INFO L226 Difference]: Without dead ends: 257 [2022-07-12 10:57:02,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2022-07-12 10:57:02,642 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 51 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:02,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 674 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-07-12 10:57:02,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-07-12 10:57:02,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2022-07-12 10:57:02,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 198 states have (on average 1.1111111111111112) internal successors, (220), 204 states have internal predecessors, (220), 31 states have call successors, (31), 22 states have call predecessors, (31), 27 states have return successors, (44), 30 states have call predecessors, (44), 30 states have call successors, (44) [2022-07-12 10:57:02,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 295 transitions. [2022-07-12 10:57:02,653 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 295 transitions. Word has length 111 [2022-07-12 10:57:02,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:02,653 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 295 transitions. [2022-07-12 10:57:02,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 9 states have internal predecessors, (79), 4 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-12 10:57:02,654 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 295 transitions. [2022-07-12 10:57:02,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 10:57:02,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:02,655 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:57:02,685 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:57:02,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 10:57:02,886 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:02,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:02,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1859335804, now seen corresponding path program 1 times [2022-07-12 10:57:02,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:02,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338323494] [2022-07-12 10:57:02,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:02,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:57:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:57:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 10:57:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 10:57:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:57:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 10:57:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,345 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-12 10:57:03,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:03,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338323494] [2022-07-12 10:57:03,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338323494] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:03,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070426131] [2022-07-12 10:57:03,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:03,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:03,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:03,348 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:57:03,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 10:57:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 2587 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 10:57:03,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:03,808 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:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 47 proven. 26 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 10:57:04,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:57:04,193 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 40 treesize of output 34 [2022-07-12 10:57:04,264 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-12 10:57:04,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070426131] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:04,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:57:04,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14, 12] total 30 [2022-07-12 10:57:04,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61465554] [2022-07-12 10:57:04,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:04,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:57:04,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:04,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:57:04,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2022-07-12 10:57:04,266 INFO L87 Difference]: Start difference. First operand 257 states and 295 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 8 states have internal predecessors, (50), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-12 10:57:04,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:04,612 INFO L93 Difference]: Finished difference Result 341 states and 389 transitions. [2022-07-12 10:57:04,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:57:04,612 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 8 states have internal predecessors, (50), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 113 [2022-07-12 10:57:04,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:04,614 INFO L225 Difference]: With dead ends: 341 [2022-07-12 10:57:04,614 INFO L226 Difference]: Without dead ends: 241 [2022-07-12 10:57:04,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 10:57:04,615 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 70 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:04,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 315 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:57:04,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-12 10:57:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 184. [2022-07-12 10:57:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 139 states have (on average 1.1151079136690647) internal successors, (155), 144 states have internal predecessors, (155), 24 states have call successors, (24), 16 states have call predecessors, (24), 20 states have return successors, (31), 23 states have call predecessors, (31), 23 states have call successors, (31) [2022-07-12 10:57:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 210 transitions. [2022-07-12 10:57:04,626 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 210 transitions. Word has length 113 [2022-07-12 10:57:04,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:04,626 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 210 transitions. [2022-07-12 10:57:04,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 8 states have internal predecessors, (50), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-12 10:57:04,626 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 210 transitions. [2022-07-12 10:57:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 10:57:04,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:04,628 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:57:04,649 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:57:04,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 10:57:04,843 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:04,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1216300311, now seen corresponding path program 1 times [2022-07-12 10:57:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:04,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169040704] [2022-07-12 10:57:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:04,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:04,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:04,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:04,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:57:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:04,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:04,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:57:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:04,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:04,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:57:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:04,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 10:57:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:05,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 10:57:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:05,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:05,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:05,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 10:57:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:05,041 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-12 10:57:05,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:05,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169040704] [2022-07-12 10:57:05,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169040704] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:05,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522249155] [2022-07-12 10:57:05,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:05,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:05,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:05,061 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:05,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 10:57:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:05,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 2636 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-12 10:57:05,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:05,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:57:05,823 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:57:05,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 13 [2022-07-12 10:57:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 47 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 10:57:05,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:57:06,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-12 10:57:06,309 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-12 10:57:06,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2022-07-12 10:57:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-12 10:57:06,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522249155] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:57:06,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:57:06,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 13] total 32 [2022-07-12 10:57:06,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042691680] [2022-07-12 10:57:06,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:57:06,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 10:57:06,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:06,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 10:57:06,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=913, Unknown=0, NotChecked=0, Total=992 [2022-07-12 10:57:06,325 INFO L87 Difference]: Start difference. First operand 184 states and 210 transitions. Second operand has 32 states, 27 states have (on average 5.185185185185185) internal successors, (140), 27 states have internal predecessors, (140), 14 states have call successors, (34), 7 states have call predecessors, (34), 8 states have return successors, (30), 11 states have call predecessors, (30), 14 states have call successors, (30) [2022-07-12 10:57:08,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:08,470 INFO L93 Difference]: Finished difference Result 348 states and 401 transitions. [2022-07-12 10:57:08,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-12 10:57:08,471 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 5.185185185185185) internal successors, (140), 27 states have internal predecessors, (140), 14 states have call successors, (34), 7 states have call predecessors, (34), 8 states have return successors, (30), 11 states have call predecessors, (30), 14 states have call successors, (30) Word has length 115 [2022-07-12 10:57:08,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:08,472 INFO L225 Difference]: With dead ends: 348 [2022-07-12 10:57:08,472 INFO L226 Difference]: Without dead ends: 198 [2022-07-12 10:57:08,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 226 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=434, Invalid=4674, Unknown=4, NotChecked=0, Total=5112 [2022-07-12 10:57:08,473 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 278 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 262 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:08,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1048 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2222 Invalid, 0 Unknown, 262 Unchecked, 1.0s Time] [2022-07-12 10:57:08,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-12 10:57:08,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 154. [2022-07-12 10:57:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 113 states have (on average 1.0973451327433628) internal successors, (124), 116 states have internal predecessors, (124), 23 states have call successors, (23), 15 states have call predecessors, (23), 17 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2022-07-12 10:57:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 172 transitions. [2022-07-12 10:57:08,480 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 172 transitions. Word has length 115 [2022-07-12 10:57:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:08,480 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 172 transitions. [2022-07-12 10:57:08,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 5.185185185185185) internal successors, (140), 27 states have internal predecessors, (140), 14 states have call successors, (34), 7 states have call predecessors, (34), 8 states have return successors, (30), 11 states have call predecessors, (30), 14 states have call successors, (30) [2022-07-12 10:57:08,481 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 172 transitions. [2022-07-12 10:57:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 10:57:08,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:08,482 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:57:08,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-12 10:57:08,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 10:57:08,695 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:08,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:08,695 INFO L85 PathProgramCache]: Analyzing trace with hash -140184041, now seen corresponding path program 1 times [2022-07-12 10:57:08,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:08,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851448819] [2022-07-12 10:57:08,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:08,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:57:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:57:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:57:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:57:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 10:57:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 10:57:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-12 10:57:08,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:08,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851448819] [2022-07-12 10:57:08,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851448819] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:08,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:08,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 10:57:08,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891583016] [2022-07-12 10:57:08,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:08,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:57:08,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:08,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:57:08,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:57:08,861 INFO L87 Difference]: Start difference. First operand 154 states and 172 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 10:57:09,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:09,071 INFO L93 Difference]: Finished difference Result 244 states and 274 transitions. [2022-07-12 10:57:09,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:57:09,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2022-07-12 10:57:09,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:09,073 INFO L225 Difference]: With dead ends: 244 [2022-07-12 10:57:09,073 INFO L226 Difference]: Without dead ends: 156 [2022-07-12 10:57:09,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:57:09,074 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 99 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:09,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 158 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 10:57:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-12 10:57:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2022-07-12 10:57:09,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 114 states have (on average 1.0964912280701755) internal successors, (125), 117 states have internal predecessors, (125), 23 states have call successors, (23), 15 states have call predecessors, (23), 17 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2022-07-12 10:57:09,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2022-07-12 10:57:09,081 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 118 [2022-07-12 10:57:09,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:09,082 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2022-07-12 10:57:09,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 10:57:09,082 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2022-07-12 10:57:09,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 10:57:09,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:09,083 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:57:09,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 10:57:09,083 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:09,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:09,084 INFO L85 PathProgramCache]: Analyzing trace with hash 693312025, now seen corresponding path program 1 times [2022-07-12 10:57:09,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:09,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534447945] [2022-07-12 10:57:09,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:09,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:57:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:57:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:57:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:57:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 10:57:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 10:57:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-12 10:57:10,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:10,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534447945] [2022-07-12 10:57:10,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534447945] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:10,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432202685] [2022-07-12 10:57:10,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:10,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:10,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:10,482 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:57:10,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 10:57:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 2664 conjuncts, 89 conjunts are in the unsatisfiable core [2022-07-12 10:57:10,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:10,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 10:57:13,024 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base_BEFORE_CALL_46| Int)) (< (+ (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base_BEFORE_CALL_46|) 8) 1) |v_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base_BEFORE_CALL_46|)) is different from true [2022-07-12 10:57:15,086 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base_BEFORE_CALL_47| Int)) (< (+ (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base_BEFORE_CALL_47|) 8) 1) |v_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base_BEFORE_CALL_47|)) is different from true [2022-07-12 10:57:17,198 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_21| Int)) (< (+ (select (select |c_#memory_$Pointer$.base| |v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_21|) 8) 1) |v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_21|)) is different from true [2022-07-12 10:57:45,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:57:45,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2022-07-12 10:57:50,262 WARN L855 $PredicateComparison]: unable to prove that (exists ((memset_impl_~sp~0.base Int)) (and (<= memset_impl_~sp~0.base |c_memset_impl_#in~s.base|) (exists ((v_ArrVal_1059 (Array Int Int))) (= (store |c_old(#memory_int)| memset_impl_~sp~0.base v_ArrVal_1059) |c_#memory_int|)))) is different from true [2022-07-12 10:57:50,282 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1059 (Array Int Int)) (memset_impl_~sp~0.base Int)) (and (<= memset_impl_~sp~0.base |c_my_memset_#in~s.base|) (= (store |c_old(#memory_int)| memset_impl_~sp~0.base v_ArrVal_1059) |c_#memory_int|))) is different from true [2022-07-12 10:57:50,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:57:50,296 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:57:50,316 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 31 treesize of output 26 [2022-07-12 10:57:56,704 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 16 proven. 16 refuted. 6 times theorem prover too weak. 12 trivial. 38 not checked. [2022-07-12 10:57:56,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:57:57,036 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_memset_impl_~sp~0.base_8 Int) (v_ArrVal_1067 (Array Int Int))) (or (< |c_aws_byte_buf_secure_zero_aws_secure_zero_~pBuf#1.base| v_memset_impl_~sp~0.base_8) (not (= (mod (select (select (store |c_#memory_int| v_memset_impl_~sp~0.base_8 v_ArrVal_1067) |c_aws_byte_buf_secure_zero_~buf#1.base|) (+ 16 |c_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0)))) is different from false [2022-07-12 10:57:57,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432202685] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:57,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:57:57,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 29] total 50 [2022-07-12 10:57:57,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166587008] [2022-07-12 10:57:57,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:57:57,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-12 10:57:57,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:57,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-12 10:57:57,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2189, Unknown=25, NotChecked=594, Total=2970 [2022-07-12 10:57:57,041 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand has 50 states, 45 states have (on average 3.1555555555555554) internal successors, (142), 41 states have internal predecessors, (142), 18 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (23), 17 states have call predecessors, (23), 17 states have call successors, (23) [2022-07-12 10:59:14,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:59:14,425 INFO L93 Difference]: Finished difference Result 297 states and 335 transitions. [2022-07-12 10:59:14,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-12 10:59:14,426 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 45 states have (on average 3.1555555555555554) internal successors, (142), 41 states have internal predecessors, (142), 18 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (23), 17 states have call predecessors, (23), 17 states have call successors, (23) Word has length 120 [2022-07-12 10:59:14,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:59:14,427 INFO L225 Difference]: With dead ends: 297 [2022-07-12 10:59:14,427 INFO L226 Difference]: Without dead ends: 193 [2022-07-12 10:59:14,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 141 SyntacticMatches, 6 SemanticMatches, 80 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 122.1s TimeCoverageRelationStatistics Valid=372, Invalid=5288, Unknown=64, NotChecked=918, Total=6642 [2022-07-12 10:59:14,429 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 163 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 4628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1993 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:59:14,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1033 Invalid, 4628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2554 Invalid, 0 Unknown, 1993 Unchecked, 1.3s Time] [2022-07-12 10:59:14,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-12 10:59:14,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 177. [2022-07-12 10:59:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 132 states have (on average 1.0909090909090908) internal successors, (144), 136 states have internal predecessors, (144), 24 states have call successors, (24), 16 states have call predecessors, (24), 20 states have return successors, (30), 24 states have call predecessors, (30), 23 states have call successors, (30) [2022-07-12 10:59:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 198 transitions. [2022-07-12 10:59:14,436 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 198 transitions. Word has length 120 [2022-07-12 10:59:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:59:14,436 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 198 transitions. [2022-07-12 10:59:14,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 45 states have (on average 3.1555555555555554) internal successors, (142), 41 states have internal predecessors, (142), 18 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (23), 17 states have call predecessors, (23), 17 states have call successors, (23) [2022-07-12 10:59:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 198 transitions. [2022-07-12 10:59:14,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 10:59:14,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:59:14,438 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:59:14,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-12 10:59:14,651 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:59:14,651 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:59:14,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:59:14,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1861902303, now seen corresponding path program 1 times [2022-07-12 10:59:14,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:59:14,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242590176] [2022-07-12 10:59:14,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:59:14,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:59:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:14,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:59:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:14,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:59:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:14,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:59:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:14,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:59:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:14,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:59:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:14,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:59:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:14,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:59:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:14,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:59:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:14,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 10:59:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:14,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:59:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:14,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:59:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:14,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 10:59:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 10:59:14,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:59:14,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242590176] [2022-07-12 10:59:14,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242590176] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:59:14,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:59:14,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:59:14,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728357752] [2022-07-12 10:59:14,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:59:14,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:59:14,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:59:14,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:59:14,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:59:14,890 INFO L87 Difference]: Start difference. First operand 177 states and 198 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 10:59:15,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:59:15,260 INFO L93 Difference]: Finished difference Result 265 states and 297 transitions. [2022-07-12 10:59:15,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:59:15,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2022-07-12 10:59:15,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:59:15,261 INFO L225 Difference]: With dead ends: 265 [2022-07-12 10:59:15,261 INFO L226 Difference]: Without dead ends: 185 [2022-07-12 10:59:15,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-07-12 10:59:15,262 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 149 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:59:15,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 251 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:59:15,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-12 10:59:15,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2022-07-12 10:59:15,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 132 states have (on average 1.0909090909090908) internal successors, (144), 136 states have internal predecessors, (144), 24 states have call successors, (24), 16 states have call predecessors, (24), 20 states have return successors, (30), 24 states have call predecessors, (30), 23 states have call successors, (30) [2022-07-12 10:59:15,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 198 transitions. [2022-07-12 10:59:15,269 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 198 transitions. Word has length 120 [2022-07-12 10:59:15,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:59:15,272 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 198 transitions. [2022-07-12 10:59:15,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 10:59:15,272 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 198 transitions. [2022-07-12 10:59:15,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 10:59:15,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:59:15,275 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:59:15,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 10:59:15,275 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:59:15,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:59:15,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2120067741, now seen corresponding path program 1 times [2022-07-12 10:59:15,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:59:15,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295496057] [2022-07-12 10:59:15,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:59:15,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:59:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:59:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:59:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:59:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:59:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:59:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:59:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:59:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:59:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 10:59:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:59:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:59:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 10:59:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-12 10:59:15,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:59:15,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295496057] [2022-07-12 10:59:15,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295496057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:59:15,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:59:15,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:59:15,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441895471] [2022-07-12 10:59:15,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:59:15,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:59:15,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:59:15,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:59:15,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:59:15,469 INFO L87 Difference]: Start difference. First operand 177 states and 198 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-12 10:59:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:59:15,790 INFO L93 Difference]: Finished difference Result 260 states and 293 transitions. [2022-07-12 10:59:15,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:59:15,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2022-07-12 10:59:15,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:59:15,793 INFO L225 Difference]: With dead ends: 260 [2022-07-12 10:59:15,793 INFO L226 Difference]: Without dead ends: 180 [2022-07-12 10:59:15,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 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:59:15,794 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 141 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:59:15,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 184 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 10:59:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-12 10:59:15,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2022-07-12 10:59:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 130 states have (on average 1.0846153846153845) internal successors, (141), 134 states have internal predecessors, (141), 24 states have call successors, (24), 16 states have call predecessors, (24), 20 states have return successors, (30), 24 states have call predecessors, (30), 23 states have call successors, (30) [2022-07-12 10:59:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 195 transitions. [2022-07-12 10:59:15,801 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 195 transitions. Word has length 120 [2022-07-12 10:59:15,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:59:15,801 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 195 transitions. [2022-07-12 10:59:15,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-12 10:59:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 195 transitions. [2022-07-12 10:59:15,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 10:59:15,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:59:15,802 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:15,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 10:59:15,802 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:59:15,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:59:15,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1789241476, now seen corresponding path program 1 times [2022-07-12 10:59:15,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:59:15,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109643854] [2022-07-12 10:59:15,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:59:15,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:59:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:59:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:59:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:59:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:59:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:59:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:59:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:59:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:59:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 10:59:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:59:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:59:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:15,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 10:59:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-12 10:59:16,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:59:16,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109643854] [2022-07-12 10:59:16,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109643854] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:59:16,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:59:16,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 10:59:16,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245717780] [2022-07-12 10:59:16,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:59:16,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 10:59:16,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:59:16,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 10:59:16,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:59:16,035 INFO L87 Difference]: Start difference. First operand 175 states and 195 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-12 10:59:16,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:59:16,512 INFO L93 Difference]: Finished difference Result 195 states and 218 transitions. [2022-07-12 10:59:16,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 10:59:16,512 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2022-07-12 10:59:16,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:59:16,513 INFO L225 Difference]: With dead ends: 195 [2022-07-12 10:59:16,513 INFO L226 Difference]: Without dead ends: 193 [2022-07-12 10:59:16,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2022-07-12 10:59:16,514 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 137 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:59:16,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 374 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:59:16,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-12 10:59:16,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 181. [2022-07-12 10:59:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 135 states have (on average 1.0814814814814815) internal successors, (146), 140 states have internal predecessors, (146), 24 states have call successors, (24), 16 states have call predecessors, (24), 21 states have return successors, (33), 24 states have call predecessors, (33), 23 states have call successors, (33) [2022-07-12 10:59:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 203 transitions. [2022-07-12 10:59:16,524 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 203 transitions. Word has length 122 [2022-07-12 10:59:16,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:59:16,524 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 203 transitions. [2022-07-12 10:59:16,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-07-12 10:59:16,527 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 203 transitions. [2022-07-12 10:59:16,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 10:59:16,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:59:16,528 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:59:16,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 10:59:16,529 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:59:16,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:59:16,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1804661242, now seen corresponding path program 1 times [2022-07-12 10:59:16,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:59:16,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053704406] [2022-07-12 10:59:16,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:59:16,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:59:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:16,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:59:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:16,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:59:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:16,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:59:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:16,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:59:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:16,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:59:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:16,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:59:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:16,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:59:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:16,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:59:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:16,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 10:59:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:16,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:59:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:16,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:59:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:16,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 10:59:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 10:59:16,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:59:16,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053704406] [2022-07-12 10:59:16,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053704406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:59:16,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:59:16,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:59:16,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585898243] [2022-07-12 10:59:16,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:59:16,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:59:16,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:59:16,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:59:16,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:59:16,715 INFO L87 Difference]: Start difference. First operand 181 states and 203 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 10:59:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:59:17,073 INFO L93 Difference]: Finished difference Result 271 states and 302 transitions. [2022-07-12 10:59:17,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:59:17,074 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2022-07-12 10:59:17,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:59:17,074 INFO L225 Difference]: With dead ends: 271 [2022-07-12 10:59:17,074 INFO L226 Difference]: Without dead ends: 187 [2022-07-12 10:59:17,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:59:17,075 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 122 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:59:17,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 229 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:59:17,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-12 10:59:17,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 176. [2022-07-12 10:59:17,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 131 states have (on average 1.083969465648855) internal successors, (142), 135 states have internal predecessors, (142), 24 states have call successors, (24), 16 states have call predecessors, (24), 20 states have return successors, (30), 24 states have call predecessors, (30), 23 states have call successors, (30) [2022-07-12 10:59:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 196 transitions. [2022-07-12 10:59:17,082 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 196 transitions. Word has length 122 [2022-07-12 10:59:17,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:59:17,082 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 196 transitions. [2022-07-12 10:59:17,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 10:59:17,083 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 196 transitions. [2022-07-12 10:59:17,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 10:59:17,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:59:17,084 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-12 10:59:17,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 10:59:17,084 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:59:17,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:59:17,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1475852901, now seen corresponding path program 2 times [2022-07-12 10:59:17,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:59:17,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112236372] [2022-07-12 10:59:17,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:59:17,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:59:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:17,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:59:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:17,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:59:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:17,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:59:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:17,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:59:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:17,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:59:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:17,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:59:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:17,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 10:59:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:17,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 10:59:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:17,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 10:59:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:18,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:59:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:18,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:59:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:18,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 10:59:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:59:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-12 10:59:18,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:59:18,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112236372] [2022-07-12 10:59:18,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112236372] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:59:18,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773763686] [2022-07-12 10:59:18,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:59:18,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:59:18,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:59:18,572 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:59:18,573 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:59:19,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:59:19,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:59:19,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 2683 conjuncts, 101 conjunts are in the unsatisfiable core [2022-07-12 10:59:19,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:59:19,606 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:59:19,844 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:59:19,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 10:59:19,854 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:59:21,906 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base_BEFORE_CALL_52| Int)) (not (= |v_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base_BEFORE_CALL_52| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base_BEFORE_CALL_52|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR)))) is different from true [2022-07-12 10:59:23,941 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base_BEFORE_CALL_53| Int)) (not (= |v_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base_BEFORE_CALL_53| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_secure_zero_harness_~#buf~3#1.base_BEFORE_CALL_53|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR)))) is different from true [2022-07-12 10:59:25,976 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_26| Int)) (not (= |v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_26| (select (select |c_#memory_$Pointer$.base| |v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_26|) 8)))) is different from true [2022-07-12 10:59:34,290 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_27| Int)) (and (not (= |v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_27| (select (select |c_#memory_$Pointer$.base| |v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_27|) 8))) (not (= (mod (select (select |c_#memory_int| |v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_27|) 16) 18446744073709551616) 0)))) is different from true [2022-07-12 10:59:34,371 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 20 treesize of output 8 [2022-07-12 10:59:34,601 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1410 (Array Int Int))) (= (store |c_old(#memory_int)| |c_memset_impl_#in~s.base| v_ArrVal_1410) |c_#memory_int|)) is different from true [2022-07-12 10:59:34,610 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1410 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_my_memset_#in~s.base| v_ArrVal_1410))) is different from true [2022-07-12 10:59:34,618 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:59:34,640 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 31 treesize of output 26 [2022-07-12 10:59:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 8 proven. 21 refuted. 10 times theorem prover too weak. 4 trivial. 48 not checked. [2022-07-12 10:59:49,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:59:49,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1419 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_aws_byte_buf_secure_zero_aws_secure_zero_~pBuf#1.base| v_ArrVal_1419) |c_aws_byte_buf_secure_zero_~buf#1.base|) (+ 16 |c_aws_byte_buf_secure_zero_~buf#1.offset|)) 18446744073709551616) 0))) is different from false [2022-07-12 10:59:49,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773763686] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:59:49,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:59:49,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 53 [2022-07-12 10:59:49,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365306166] [2022-07-12 10:59:49,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:59:49,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-12 10:59:49,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:59:49,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-12 10:59:49,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2389, Unknown=15, NotChecked=728, Total=3306 [2022-07-12 10:59:49,321 INFO L87 Difference]: Start difference. First operand 176 states and 196 transitions. Second operand has 53 states, 49 states have (on average 3.020408163265306) internal successors, (148), 45 states have internal predecessors, (148), 15 states have call successors, (25), 13 states have call predecessors, (25), 14 states have return successors, (23), 15 states have call predecessors, (23), 14 states have call successors, (23)