./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_reset_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_reset_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 26dd1e590401fc7cb1a23c07b0d1f52f89cca75ab7679d1aa0110320620b8ebd --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:56:38,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:56:38,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:56:38,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:56:38,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:56:38,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:56:38,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:56:38,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:56:38,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:56:38,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:56:38,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:56:38,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:56:38,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:56:38,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:56:38,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:56:38,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:56:38,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:56:38,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:56:38,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:56:38,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:56:38,073 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:56:38,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:56:38,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:56:38,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:56:38,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:56:38,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:56:38,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:56:38,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:56:38,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:56:38,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:56:38,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:56:38,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:56:38,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:56:38,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:56:38,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:56:38,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:56:38,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:56:38,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:56:38,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:56:38,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:56:38,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:56:38,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:56:38,093 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:38,115 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:56:38,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:56:38,116 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:56:38,116 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:56:38,116 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:56:38,117 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:56:38,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:56:38,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:56:38,117 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:56:38,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:56:38,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:56:38,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:56:38,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:56:38,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:56:38,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:56:38,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:56:38,119 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:56:38,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:56:38,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:56:38,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:56:38,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:56:38,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:56:38,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:56:38,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:56:38,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:56:38,121 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:56:38,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:56:38,122 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:56:38,122 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:56:38,122 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:56:38,122 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 -> 26dd1e590401fc7cb1a23c07b0d1f52f89cca75ab7679d1aa0110320620b8ebd [2022-07-12 10:56:38,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:56:38,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:56:38,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:56:38,357 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:56:38,357 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:56:38,358 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_reset_harness.i [2022-07-12 10:56:38,402 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ecdddacc/eaf8ba50ef044771977a9a5849864404/FLAG4d6e573a9 [2022-07-12 10:56:39,045 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:56:39,046 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reset_harness.i [2022-07-12 10:56:39,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ecdddacc/eaf8ba50ef044771977a9a5849864404/FLAG4d6e573a9 [2022-07-12 10:56:39,430 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ecdddacc/eaf8ba50ef044771977a9a5849864404 [2022-07-12 10:56:39,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:56:39,434 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:56:39,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:56:39,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:56:39,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:56:39,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:56:39" (1/1) ... [2022-07-12 10:56:39,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11e1233b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:39, skipping insertion in model container [2022-07-12 10:56:39,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:56:39" (1/1) ... [2022-07-12 10:56:39,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:56:39,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:56:39,699 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_reset_harness.i[4492,4505] [2022-07-12 10:56:39,705 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_reset_harness.i[4552,4565] [2022-07-12 10:56:40,166 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,169 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,171 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,172 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,174 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,183 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,184 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,185 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,186 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,390 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 10:56:40,391 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 10:56:40,392 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 10:56:40,401 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 10:56:40,404 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 10:56:40,406 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 10:56:40,408 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 10:56:40,408 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 10:56:40,410 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 10:56:40,412 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 10:56:40,532 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 10:56:40,619 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,646 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:56:40,761 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:56:40,777 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_reset_harness.i[4492,4505] [2022-07-12 10:56:40,778 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_reset_harness.i[4552,4565] [2022-07-12 10:56:40,808 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,809 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,810 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,810 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,810 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,817 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,818 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,819 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,819 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,851 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 10:56:40,851 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 10:56:40,852 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 10:56:40,852 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 10:56:40,853 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 10:56:40,853 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 10:56:40,853 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 10:56:40,854 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 10:56:40,854 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 10:56:40,857 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 10:56:40,873 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 10:56:40,925 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,926 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 10:56:40,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:56:41,074 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:56:41,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:41 WrapperNode [2022-07-12 10:56:41,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:56:41,076 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:56:41,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:56:41,076 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:56:41,080 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:41" (1/1) ... [2022-07-12 10:56:41,165 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:41" (1/1) ... [2022-07-12 10:56:41,229 INFO L137 Inliner]: procedures = 691, calls = 2631, calls flagged for inlining = 59, calls inlined = 7, statements flattened = 816 [2022-07-12 10:56:41,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:56:41,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:56:41,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:56:41,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:56:41,237 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:41" (1/1) ... [2022-07-12 10:56:41,237 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:41" (1/1) ... [2022-07-12 10:56:41,246 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:41" (1/1) ... [2022-07-12 10:56:41,247 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:41" (1/1) ... [2022-07-12 10:56:41,287 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:41" (1/1) ... [2022-07-12 10:56:41,290 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:41" (1/1) ... [2022-07-12 10:56:41,294 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:41" (1/1) ... [2022-07-12 10:56:41,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:56:41,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:56:41,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:56:41,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:56:41,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:41" (1/1) ... [2022-07-12 10:56:41,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:56:41,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:41,335 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:41,357 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:41,368 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-12 10:56:41,368 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-12 10:56:41,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:56:41,369 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 10:56:41,369 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 10:56:41,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:56:41,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 10:56:41,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 10:56:41,370 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_secure_zero [2022-07-12 10:56:41,370 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_secure_zero [2022-07-12 10:56:41,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 10:56:41,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:56:41,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 10:56:41,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:56:41,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:56:41,371 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 10:56:41,371 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 10:56:41,371 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 10:56:41,372 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 10:56:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:56:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 10:56:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 10:56:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-12 10:56:41,372 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-12 10:56:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure assert_all_bytes_are [2022-07-12 10:56:41,373 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_all_bytes_are [2022-07-12 10:56:41,373 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 10:56:41,373 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 10:56:41,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:56:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure memset_impl [2022-07-12 10:56:41,374 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_impl [2022-07-12 10:56:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2022-07-12 10:56:41,374 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2022-07-12 10:56:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:56:41,587 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:56:41,588 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:56:42,218 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:56:42,225 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:56:42,225 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 10:56:42,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:56:42 BoogieIcfgContainer [2022-07-12 10:56:42,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:56:42,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:56:42,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:56:42,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:56:42,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:56:39" (1/3) ... [2022-07-12 10:56:42,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146fe21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:56:42, skipping insertion in model container [2022-07-12 10:56:42,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:56:41" (2/3) ... [2022-07-12 10:56:42,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146fe21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:56:42, skipping insertion in model container [2022-07-12 10:56:42,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:56:42" (3/3) ... [2022-07-12 10:56:42,234 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_reset_harness.i [2022-07-12 10:56:42,244 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:56:42,244 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:56:42,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:56:42,291 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@4b0d9258, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ea88069 [2022-07-12 10:56:42,291 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 10:56:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 80 states have internal predecessors, (96), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-12 10:56:42,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 10:56:42,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:42,301 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 10:56:42,302 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:42,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:42,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1110276302, now seen corresponding path program 1 times [2022-07-12 10:56:42,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:42,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193330941] [2022-07-12 10:56:42,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:42,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:56:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:42,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 10:56:42,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:42,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193330941] [2022-07-12 10:56:42,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193330941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:42,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:42,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:56:42,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582466549] [2022-07-12 10:56:42,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:42,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:56:42,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:42,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:56:42,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:56:42,793 INFO L87 Difference]: Start difference. First operand has 114 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 80 states have internal predecessors, (96), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 10:56:42,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:42,947 INFO L93 Difference]: Finished difference Result 224 states and 296 transitions. [2022-07-12 10:56:42,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:56:42,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2022-07-12 10:56:42,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:42,954 INFO L225 Difference]: With dead ends: 224 [2022-07-12 10:56:42,955 INFO L226 Difference]: Without dead ends: 105 [2022-07-12 10:56:42,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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:42,959 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 65 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:42,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 151 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 10:56:42,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-12 10:56:43,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-12 10:56:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-12 10:56:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2022-07-12 10:56:43,005 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 46 [2022-07-12 10:56:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:43,005 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2022-07-12 10:56:43,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 10:56:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2022-07-12 10:56:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 10:56:43,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:43,007 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 10:56:43,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:56:43,008 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:43,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:43,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1937663032, now seen corresponding path program 1 times [2022-07-12 10:56:43,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:43,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860518907] [2022-07-12 10:56:43,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:43,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:43,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:43,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:43,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:43,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:43,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:43,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:56:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:43,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 10:56:43,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:43,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860518907] [2022-07-12 10:56:43,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860518907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:43,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:43,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:56:43,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590922566] [2022-07-12 10:56:43,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:43,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:56:43,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:43,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:56:43,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:56:43,246 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 10:56:43,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:43,571 INFO L93 Difference]: Finished difference Result 188 states and 232 transitions. [2022-07-12 10:56:43,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 10:56:43,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-07-12 10:56:43,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:43,576 INFO L225 Difference]: With dead ends: 188 [2022-07-12 10:56:43,576 INFO L226 Difference]: Without dead ends: 108 [2022-07-12 10:56:43,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:56:43,581 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 97 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:43,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 192 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:56:43,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-12 10:56:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-07-12 10:56:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.178082191780822) internal successors, (86), 76 states have internal predecessors, (86), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (23), 21 states have call predecessors, (23), 21 states have call successors, (23) [2022-07-12 10:56:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2022-07-12 10:56:43,593 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 46 [2022-07-12 10:56:43,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:43,593 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2022-07-12 10:56:43,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 10:56:43,594 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2022-07-12 10:56:43,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 10:56:43,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:43,596 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 10:56:43,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:56:43,597 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:43,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:43,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1805915411, now seen corresponding path program 1 times [2022-07-12 10:56:43,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:43,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967104777] [2022-07-12 10:56:43,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:43,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:43,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:43,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:43,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:43,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:43,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:43,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:56:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 10:56:43,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:43,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967104777] [2022-07-12 10:56:43,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967104777] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:43,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:43,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:56:43,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760108808] [2022-07-12 10:56:43,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:43,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:56:43,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:43,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:56:43,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:56:43,867 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 10:56:44,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:44,244 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2022-07-12 10:56:44,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:56:44,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2022-07-12 10:56:44,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:44,246 INFO L225 Difference]: With dead ends: 114 [2022-07-12 10:56:44,246 INFO L226 Difference]: Without dead ends: 112 [2022-07-12 10:56:44,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:56:44,247 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 82 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:44,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 238 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:56:44,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-12 10:56:44,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-12 10:56:44,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 79 states have internal predecessors, (89), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (23), 21 states have call predecessors, (23), 21 states have call successors, (23) [2022-07-12 10:56:44,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2022-07-12 10:56:44,261 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 52 [2022-07-12 10:56:44,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:44,261 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2022-07-12 10:56:44,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 10:56:44,262 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2022-07-12 10:56:44,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 10:56:44,267 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:44,267 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 10:56:44,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:56:44,267 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:44,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:44,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1287993371, now seen corresponding path program 1 times [2022-07-12 10:56:44,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:44,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247472499] [2022-07-12 10:56:44,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:44,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:56:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 10:56:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:44,582 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 10:56:44,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:44,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247472499] [2022-07-12 10:56:44,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247472499] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:44,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:44,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:56:44,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240620867] [2022-07-12 10:56:44,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:44,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:56:44,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:44,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:56:44,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:56:44,584 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-12 10:56:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:45,128 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2022-07-12 10:56:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:56:45,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2022-07-12 10:56:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:45,129 INFO L225 Difference]: With dead ends: 130 [2022-07-12 10:56:45,130 INFO L226 Difference]: Without dead ends: 128 [2022-07-12 10:56:45,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:56:45,130 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 91 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:45,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 237 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 10:56:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-12 10:56:45,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2022-07-12 10:56:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 85 states have internal predecessors, (95), 25 states have call successors, (25), 13 states have call predecessors, (25), 13 states have return successors, (25), 22 states have call predecessors, (25), 23 states have call successors, (25) [2022-07-12 10:56:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 145 transitions. [2022-07-12 10:56:45,139 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 145 transitions. Word has length 58 [2022-07-12 10:56:45,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:45,139 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 145 transitions. [2022-07-12 10:56:45,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-12 10:56:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2022-07-12 10:56:45,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 10:56:45,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:45,140 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-07-12 10:56:45,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:56:45,140 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:45,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:45,141 INFO L85 PathProgramCache]: Analyzing trace with hash 388379591, now seen corresponding path program 1 times [2022-07-12 10:56:45,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:45,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873748573] [2022-07-12 10:56:45,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:45,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:56:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 10:56:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:56:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 10:56:45,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:45,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873748573] [2022-07-12 10:56:45,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873748573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:45,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:45,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:56:45,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758392966] [2022-07-12 10:56:45,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:45,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:56:45,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:45,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:56:45,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:56:45,491 INFO L87 Difference]: Start difference. First operand 121 states and 145 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 10:56:45,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:45,978 INFO L93 Difference]: Finished difference Result 134 states and 159 transitions. [2022-07-12 10:56:45,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:56:45,979 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 64 [2022-07-12 10:56:45,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:45,980 INFO L225 Difference]: With dead ends: 134 [2022-07-12 10:56:45,980 INFO L226 Difference]: Without dead ends: 132 [2022-07-12 10:56:45,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:56:45,981 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 91 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:45,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 237 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 10:56:45,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-12 10:56:45,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2022-07-12 10:56:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 89 states have internal predecessors, (99), 26 states have call successors, (26), 14 states have call predecessors, (26), 14 states have return successors, (26), 23 states have call predecessors, (26), 24 states have call successors, (26) [2022-07-12 10:56:45,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 151 transitions. [2022-07-12 10:56:45,989 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 151 transitions. Word has length 64 [2022-07-12 10:56:45,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:45,989 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 151 transitions. [2022-07-12 10:56:45,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 10:56:45,990 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 151 transitions. [2022-07-12 10:56:45,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-12 10:56:45,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:45,990 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-07-12 10:56:45,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:56:45,990 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:45,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:45,991 INFO L85 PathProgramCache]: Analyzing trace with hash -472545423, now seen corresponding path program 1 times [2022-07-12 10:56:45,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:45,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123579412] [2022-07-12 10:56:45,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:45,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:56:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 10:56:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:56:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 10:56:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:46,384 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 10:56:46,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:46,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123579412] [2022-07-12 10:56:46,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123579412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:46,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:46,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:56:46,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564597242] [2022-07-12 10:56:46,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:46,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:56:46,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:46,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:56:46,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:56:46,386 INFO L87 Difference]: Start difference. First operand 127 states and 151 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 10:56:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:46,936 INFO L93 Difference]: Finished difference Result 138 states and 162 transitions. [2022-07-12 10:56:46,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:56:46,936 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 70 [2022-07-12 10:56:46,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:46,937 INFO L225 Difference]: With dead ends: 138 [2022-07-12 10:56:46,937 INFO L226 Difference]: Without dead ends: 136 [2022-07-12 10:56:46,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-07-12 10:56:46,939 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 92 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:46,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 229 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 10:56:46,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-12 10:56:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2022-07-12 10:56:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 90 states have (on average 1.1444444444444444) internal successors, (103), 93 states have internal predecessors, (103), 27 states have call successors, (27), 15 states have call predecessors, (27), 15 states have return successors, (27), 24 states have call predecessors, (27), 25 states have call successors, (27) [2022-07-12 10:56:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 157 transitions. [2022-07-12 10:56:46,947 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 157 transitions. Word has length 70 [2022-07-12 10:56:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:46,947 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 157 transitions. [2022-07-12 10:56:46,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 10:56:46,947 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 157 transitions. [2022-07-12 10:56:46,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-12 10:56:46,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:46,948 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, 1] [2022-07-12 10:56:46,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:56:46,948 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:46,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:46,949 INFO L85 PathProgramCache]: Analyzing trace with hash -918234075, now seen corresponding path program 1 times [2022-07-12 10:56:46,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:46,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963042197] [2022-07-12 10:56:46,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:46,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:47,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:47,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:47,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:47,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:47,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:47,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:56:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:47,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 10:56:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:47,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:56:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:47,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 10:56:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-12 10:56:47,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:47,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963042197] [2022-07-12 10:56:47,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963042197] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:47,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601436310] [2022-07-12 10:56:47,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:47,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:47,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:47,168 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:47,199 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,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:47,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 2522 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 10:56:47,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:47,724 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,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:47,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601436310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:47,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:47,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2022-07-12 10:56:47,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893998945] [2022-07-12 10:56:47,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:47,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:56:47,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:47,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:56:47,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-07-12 10:56:47,725 INFO L87 Difference]: Start difference. First operand 133 states and 157 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 5 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:47,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:47,857 INFO L93 Difference]: Finished difference Result 214 states and 253 transitions. [2022-07-12 10:56:47,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:56:47,857 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 5 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 72 [2022-07-12 10:56:47,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:47,858 INFO L225 Difference]: With dead ends: 214 [2022-07-12 10:56:47,858 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 10:56:47,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-07-12 10:56:47,859 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 169 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:47,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 604 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 10:56:47,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 10:56:47,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-12 10:56:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 90 states have internal predecessors, (100), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-12 10:56:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2022-07-12 10:56:47,867 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 72 [2022-07-12 10:56:47,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:47,867 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2022-07-12 10:56:47,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 5 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:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2022-07-12 10:56:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 10:56:47,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:47,868 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, 1] [2022-07-12 10:56:47,895 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:48,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:48,090 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:48,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:48,091 INFO L85 PathProgramCache]: Analyzing trace with hash -54561733, now seen corresponding path program 1 times [2022-07-12 10:56:48,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:48,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713573299] [2022-07-12 10:56:48,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:48,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:56:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 10:56:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 10:56:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 10:56:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,355 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:48,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:48,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713573299] [2022-07-12 10:56:48,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713573299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:48,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:48,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:56:48,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221921121] [2022-07-12 10:56:48,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:48,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:56:48,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:48,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:56:48,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:56:48,357 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 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:48,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:48,708 INFO L93 Difference]: Finished difference Result 142 states and 166 transitions. [2022-07-12 10:56:48,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:56:48,709 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 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 84 [2022-07-12 10:56:48,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:48,710 INFO L225 Difference]: With dead ends: 142 [2022-07-12 10:56:48,710 INFO L226 Difference]: Without dead ends: 140 [2022-07-12 10:56:48,710 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:48,710 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 85 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:48,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 346 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:56:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-12 10:56:48,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2022-07-12 10:56:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 94 states have (on average 1.127659574468085) internal successors, (106), 97 states have internal predecessors, (106), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (29), 25 states have call predecessors, (29), 26 states have call successors, (29) [2022-07-12 10:56:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 163 transitions. [2022-07-12 10:56:48,719 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 163 transitions. Word has length 84 [2022-07-12 10:56:48,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:48,719 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 163 transitions. [2022-07-12 10:56:48,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 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:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 163 transitions. [2022-07-12 10:56:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 10:56:48,720 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:48,720 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, 1] [2022-07-12 10:56:48,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:56:48,721 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:48,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:48,721 INFO L85 PathProgramCache]: Analyzing trace with hash 300350147, now seen corresponding path program 1 times [2022-07-12 10:56:48,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:48,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012776412] [2022-07-12 10:56:48,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:48,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:56:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 10:56:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 10:56:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 10:56:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:48,949 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:48,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:48,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012776412] [2022-07-12 10:56:48,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012776412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:48,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:48,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:56:48,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678124389] [2022-07-12 10:56:48,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:48,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:56:48,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:48,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:56:48,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:56:48,952 INFO L87 Difference]: Start difference. First operand 139 states and 163 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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:49,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:49,291 INFO L93 Difference]: Finished difference Result 278 states and 336 transitions. [2022-07-12 10:56:49,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:56:49,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 88 [2022-07-12 10:56:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:49,294 INFO L225 Difference]: With dead ends: 278 [2022-07-12 10:56:49,294 INFO L226 Difference]: Without dead ends: 164 [2022-07-12 10:56:49,294 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:49,295 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 130 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:49,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 245 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:56:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-12 10:56:49,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 144. [2022-07-12 10:56:49,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 102 states have internal predecessors, (113), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (29), 25 states have call predecessors, (29), 26 states have call successors, (29) [2022-07-12 10:56:49,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 170 transitions. [2022-07-12 10:56:49,304 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 170 transitions. Word has length 88 [2022-07-12 10:56:49,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:49,304 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 170 transitions. [2022-07-12 10:56:49,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 170 transitions. [2022-07-12 10:56:49,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 10:56:49,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:49,305 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, 1] [2022-07-12 10:56:49,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 10:56:49,305 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:49,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:49,305 INFO L85 PathProgramCache]: Analyzing trace with hash 558515585, now seen corresponding path program 1 times [2022-07-12 10:56:49,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:49,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533577161] [2022-07-12 10:56:49,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:49,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:56:49,598 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 48 [2022-07-12 10:56:49,604 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 60 [2022-07-12 10:56:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 10:56:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,619 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:49,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:49,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533577161] [2022-07-12 10:56:49,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533577161] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:49,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998295557] [2022-07-12 10:56:49,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:49,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:49,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:49,641 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:49,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 10:56:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:49,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 2563 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 10:56:49,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:50,037 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:50,216 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:50,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:50,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998295557] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:50,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:50,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 17 [2022-07-12 10:56:50,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491717721] [2022-07-12 10:56:50,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:50,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 10:56:50,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:50,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 10:56:50,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-07-12 10:56:50,217 INFO L87 Difference]: Start difference. First operand 144 states and 170 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 10 states have internal predecessors, (53), 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:50,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:50,263 INFO L93 Difference]: Finished difference Result 286 states and 339 transitions. [2022-07-12 10:56:50,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 10:56:50,264 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 10 states have internal predecessors, (53), 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 88 [2022-07-12 10:56:50,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:50,264 INFO L225 Difference]: With dead ends: 286 [2022-07-12 10:56:50,265 INFO L226 Difference]: Without dead ends: 163 [2022-07-12 10:56:50,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:56:50,265 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 32 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:50,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 665 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 79 Unchecked, 0.0s Time] [2022-07-12 10:56:50,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-12 10:56:50,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-07-12 10:56:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 117 states have (on average 1.1623931623931625) internal successors, (136), 120 states have internal predecessors, (136), 28 states have call successors, (28), 17 states have call predecessors, (28), 17 states have return successors, (29), 25 states have call predecessors, (29), 26 states have call successors, (29) [2022-07-12 10:56:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 193 transitions. [2022-07-12 10:56:50,273 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 193 transitions. Word has length 88 [2022-07-12 10:56:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:50,273 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 193 transitions. [2022-07-12 10:56:50,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 10 states have internal predecessors, (53), 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:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions. [2022-07-12 10:56:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 10:56:50,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:50,274 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, 1] [2022-07-12 10:56:50,297 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:50,491 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,SelfDestructingSolverStorable9 [2022-07-12 10:56:50,491 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:50,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:50,492 INFO L85 PathProgramCache]: Analyzing trace with hash 599190335, now seen corresponding path program 1 times [2022-07-12 10:56:50,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:50,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920603933] [2022-07-12 10:56:50,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:50,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 10:56:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 10:56:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 10:56:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 10:56:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,647 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:50,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:50,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920603933] [2022-07-12 10:56:50,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920603933] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:50,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066781503] [2022-07-12 10:56:50,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:50,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:50,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:50,650 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,651 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,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:50,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 2558 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 10:56:51,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:51,006 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,007 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:51,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066781503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:51,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:51,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-12 10:56:51,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380755843] [2022-07-12 10:56:51,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:51,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:56:51,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:51,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:56:51,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:56:51,008 INFO L87 Difference]: Start difference. First operand 163 states and 193 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:51,026 INFO L93 Difference]: Finished difference Result 295 states and 354 transitions. [2022-07-12 10:56:51,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:56:51,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 88 [2022-07-12 10:56:51,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:51,027 INFO L225 Difference]: With dead ends: 295 [2022-07-12 10:56:51,028 INFO L226 Difference]: Without dead ends: 172 [2022-07-12 10:56:51,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 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,029 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 20 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 373 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,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 373 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,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-12 10:56:51,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2022-07-12 10:56:51,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 110 states have (on average 1.1545454545454545) internal successors, (127), 112 states have internal predecessors, (127), 28 states have call successors, (28), 17 states have call predecessors, (28), 16 states have return successors, (28), 25 states have call predecessors, (28), 26 states have call successors, (28) [2022-07-12 10:56:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 183 transitions. [2022-07-12 10:56:51,036 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 183 transitions. Word has length 88 [2022-07-12 10:56:51,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:51,036 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 183 transitions. [2022-07-12 10:56:51,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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,036 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 183 transitions. [2022-07-12 10:56:51,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-12 10:56:51,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:51,037 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, 1] [2022-07-12 10:56:51,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 10:56:51,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:51,254 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:51,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:51,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1357155461, now seen corresponding path program 2 times [2022-07-12 10:56:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:51,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872450189] [2022-07-12 10:56:51,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:51,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:56:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 10:56:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 10:56:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 10:56:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:51,517 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:51,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:51,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872450189] [2022-07-12 10:56:51,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872450189] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:51,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527618534] [2022-07-12 10:56:51,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:56:51,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:51,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:51,532 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,533 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,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 10:56:51,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:56:51,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 2334 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 10:56:51,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:51,973 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-12 10:56:51,973 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:51,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:56:51,978 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:52,288 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:52,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:52,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527618534] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:52,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:52,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2022-07-12 10:56:52,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539874419] [2022-07-12 10:56:52,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:52,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:56:52,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:52,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:56:52,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-12 10:56:52,290 INFO L87 Difference]: Start difference. First operand 155 states and 183 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 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:52,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:52,427 INFO L93 Difference]: Finished difference Result 223 states and 264 transitions. [2022-07-12 10:56:52,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:56:52,427 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 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 92 [2022-07-12 10:56:52,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:52,429 INFO L225 Difference]: With dead ends: 223 [2022-07-12 10:56:52,429 INFO L226 Difference]: Without dead ends: 177 [2022-07-12 10:56:52,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:56:52,429 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 25 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:52,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 531 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2022-07-12 10:56:52,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-12 10:56:52,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2022-07-12 10:56:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 127 states have (on average 1.1811023622047243) internal successors, (150), 129 states have internal predecessors, (150), 29 states have call successors, (29), 18 states have call predecessors, (29), 16 states have return successors, (30), 25 states have call predecessors, (30), 27 states have call successors, (30) [2022-07-12 10:56:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 209 transitions. [2022-07-12 10:56:52,436 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 209 transitions. Word has length 92 [2022-07-12 10:56:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:52,437 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 209 transitions. [2022-07-12 10:56:52,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 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:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 209 transitions. [2022-07-12 10:56:52,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-12 10:56:52,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:52,438 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, 1] [2022-07-12 10:56:52,459 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,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:52,638 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:52,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:52,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1657948157, now seen corresponding path program 2 times [2022-07-12 10:56:52,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:52,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897089721] [2022-07-12 10:56:52,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:52,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:56:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 10:56:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 10:56:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 10:56:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:52,845 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:52,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:52,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897089721] [2022-07-12 10:56:52,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897089721] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:52,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:52,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:56:52,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541199810] [2022-07-12 10:56:52,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:52,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:56:52,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:52,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:56:52,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:56:52,846 INFO L87 Difference]: Start difference. First operand 173 states and 209 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:53,199 INFO L93 Difference]: Finished difference Result 237 states and 283 transitions. [2022-07-12 10:56:53,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:56:53,199 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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 92 [2022-07-12 10:56:53,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:53,200 INFO L225 Difference]: With dead ends: 237 [2022-07-12 10:56:53,200 INFO L226 Difference]: Without dead ends: 197 [2022-07-12 10:56:53,201 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,201 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 134 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:53,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 249 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:56:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-12 10:56:53,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 185. [2022-07-12 10:56:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 138 states have (on average 1.181159420289855) internal successors, (163), 141 states have internal predecessors, (163), 29 states have call successors, (29), 18 states have call predecessors, (29), 17 states have return successors, (32), 25 states have call predecessors, (32), 27 states have call successors, (32) [2022-07-12 10:56:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 224 transitions. [2022-07-12 10:56:53,210 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 224 transitions. Word has length 92 [2022-07-12 10:56:53,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:53,210 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 224 transitions. [2022-07-12 10:56:53,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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,211 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 224 transitions. [2022-07-12 10:56:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-12 10:56:53,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:53,212 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, 1] [2022-07-12 10:56:53,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 10:56:53,212 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:53,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:53,212 INFO L85 PathProgramCache]: Analyzing trace with hash -188565183, now seen corresponding path program 1 times [2022-07-12 10:56:53,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:53,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124474026] [2022-07-12 10:56:53,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:53,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 10:56:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 10:56:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 10:56:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 10:56:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,405 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:53,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:53,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124474026] [2022-07-12 10:56:53,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124474026] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:53,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782154307] [2022-07-12 10:56:53,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:53,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:53,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:53,407 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:53,437 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:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:53,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 2567 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 10:56:53,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:53,979 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-12 10:56:53,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 10:56:54,170 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,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:56:54,433 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:54,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782154307] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:56:54,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:56:54,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 23 [2022-07-12 10:56:54,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77361736] [2022-07-12 10:56:54,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:56:54,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 10:56:54,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:54,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 10:56:54,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-07-12 10:56:54,435 INFO L87 Difference]: Start difference. First operand 185 states and 224 transitions. Second operand has 23 states, 22 states have (on average 4.636363636363637) internal successors, (102), 21 states have internal predecessors, (102), 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:55,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:55,703 INFO L93 Difference]: Finished difference Result 380 states and 471 transitions. [2022-07-12 10:56:55,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 10:56:55,703 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.636363636363637) internal successors, (102), 21 states have internal predecessors, (102), 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 92 [2022-07-12 10:56:55,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:55,704 INFO L225 Difference]: With dead ends: 380 [2022-07-12 10:56:55,705 INFO L226 Difference]: Without dead ends: 229 [2022-07-12 10:56:55,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 189 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=307, Invalid=1585, Unknown=0, NotChecked=0, Total=1892 [2022-07-12 10:56:55,706 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 294 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:55,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 520 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1438 Invalid, 0 Unknown, 210 Unchecked, 0.8s Time] [2022-07-12 10:56:55,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-12 10:56:55,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 228. [2022-07-12 10:56:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 173 states have (on average 1.1618497109826589) internal successors, (201), 180 states have internal predecessors, (201), 31 states have call successors, (31), 20 states have call predecessors, (31), 23 states have return successors, (48), 27 states have call predecessors, (48), 29 states have call successors, (48) [2022-07-12 10:56:55,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 280 transitions. [2022-07-12 10:56:55,716 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 280 transitions. Word has length 92 [2022-07-12 10:56:55,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:55,717 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 280 transitions. [2022-07-12 10:56:55,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.636363636363637) internal successors, (102), 21 states have internal predecessors, (102), 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:55,717 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 280 transitions. [2022-07-12 10:56:55,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 10:56:55,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:55,718 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, 1] [2022-07-12 10:56:55,741 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:55,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 10:56:55,941 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:55,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:55,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1157731838, now seen corresponding path program 1 times [2022-07-12 10:56:55,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:55,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696553783] [2022-07-12 10:56:55,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:55,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:56:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 10:56:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 10:56:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,064 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,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:56,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696553783] [2022-07-12 10:56:56,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696553783] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:56,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175521953] [2022-07-12 10:56:56,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:56,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:56,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:56,066 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:56,067 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:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 2569 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 10:56:56,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:56,419 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:56,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:56,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175521953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:56,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:56,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-12 10:56:56,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397097297] [2022-07-12 10:56:56,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:56,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:56:56,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:56,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:56:56,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:56:56,421 INFO L87 Difference]: Start difference. First operand 228 states and 280 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:56,441 INFO L93 Difference]: Finished difference Result 414 states and 515 transitions. [2022-07-12 10:56:56,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:56:56,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 94 [2022-07-12 10:56:56,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:56,443 INFO L225 Difference]: With dead ends: 414 [2022-07-12 10:56:56,443 INFO L226 Difference]: Without dead ends: 211 [2022-07-12 10:56:56,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 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:56,444 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 9 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 366 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:56,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 366 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:56,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-12 10:56:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2022-07-12 10:56:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 155 states have (on average 1.1290322580645162) internal successors, (175), 160 states have internal predecessors, (175), 31 states have call successors, (31), 20 states have call predecessors, (31), 21 states have return successors, (41), 27 states have call predecessors, (41), 29 states have call successors, (41) [2022-07-12 10:56:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 247 transitions. [2022-07-12 10:56:56,452 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 247 transitions. Word has length 94 [2022-07-12 10:56:56,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:56,453 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 247 transitions. [2022-07-12 10:56:56,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 247 transitions. [2022-07-12 10:56:56,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 10:56:56,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:56,454 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, 1] [2022-07-12 10:56:56,476 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,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 10:56:56,663 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:56,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:56,664 INFO L85 PathProgramCache]: Analyzing trace with hash 542639162, now seen corresponding path program 1 times [2022-07-12 10:56:56,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:56,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662224198] [2022-07-12 10:56:56,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:56,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:56:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 10:56:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 10:56:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:56,814 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:56,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:56,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662224198] [2022-07-12 10:56:56,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662224198] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:56,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030020164] [2022-07-12 10:56:56,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:56,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:56,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:56,816 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:56,817 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,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 2571 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 10:56:57,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:57,191 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:57,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:57,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030020164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:57,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:57,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-12 10:56:57,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351366302] [2022-07-12 10:56:57,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:57,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:56:57,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:57,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:56:57,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:56:57,193 INFO L87 Difference]: Start difference. First operand 208 states and 247 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:57,213 INFO L93 Difference]: Finished difference Result 374 states and 453 transitions. [2022-07-12 10:56:57,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:56:57,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 94 [2022-07-12 10:56:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:57,214 INFO L225 Difference]: With dead ends: 374 [2022-07-12 10:56:57,214 INFO L226 Difference]: Without dead ends: 196 [2022-07-12 10:56:57,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 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,215 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 34 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 364 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:57,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 364 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:57,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-12 10:56:57,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 192. [2022-07-12 10:56:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 140 states have (on average 1.1071428571428572) internal successors, (155), 144 states have internal predecessors, (155), 31 states have call successors, (31), 20 states have call predecessors, (31), 20 states have return successors, (38), 27 states have call predecessors, (38), 29 states have call successors, (38) [2022-07-12 10:56:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 224 transitions. [2022-07-12 10:56:57,224 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 224 transitions. Word has length 94 [2022-07-12 10:56:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:57,224 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 224 transitions. [2022-07-12 10:56:57,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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,224 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 224 transitions. [2022-07-12 10:56:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-12 10:56:57,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:57,225 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,249 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,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:57,446 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:57,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:57,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1730782770, now seen corresponding path program 1 times [2022-07-12 10:56:57,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:57,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781654857] [2022-07-12 10:56:57,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:57,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:56:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 10:56:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 10:56:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 10:56:57,669 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 82 [2022-07-12 10:56:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 10:56:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-12 10:56:57,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:57,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781654857] [2022-07-12 10:56:57,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781654857] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:57,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:57,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 10:56:57,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774934307] [2022-07-12 10:56:57,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:57,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:56:57,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:57,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:56:57,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:56:57,682 INFO L87 Difference]: Start difference. First operand 192 states and 224 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 10:56:57,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:57,884 INFO L93 Difference]: Finished difference Result 215 states and 246 transitions. [2022-07-12 10:56:57,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:56:57,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2022-07-12 10:56:57,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:57,885 INFO L225 Difference]: With dead ends: 215 [2022-07-12 10:56:57,885 INFO L226 Difference]: Without dead ends: 171 [2022-07-12 10:56:57,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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,886 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 76 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:57,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 189 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 10:56:57,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-12 10:56:57,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-12 10:56:57,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 126 states have (on average 1.1111111111111112) internal successors, (140), 129 states have internal predecessors, (140), 27 states have call successors, (27), 17 states have call predecessors, (27), 17 states have return successors, (34), 24 states have call predecessors, (34), 25 states have call successors, (34) [2022-07-12 10:56:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 201 transitions. [2022-07-12 10:56:57,894 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 201 transitions. Word has length 97 [2022-07-12 10:56:57,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:57,894 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 201 transitions. [2022-07-12 10:56:57,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 10:56:57,894 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 201 transitions. [2022-07-12 10:56:57,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-12 10:56:57,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:57,895 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, 1] [2022-07-12 10:56:57,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 10:56:57,896 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:57,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:57,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1045365502, now seen corresponding path program 1 times [2022-07-12 10:56:57,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:57,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818599917] [2022-07-12 10:56:57,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:57,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:56:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 10:56:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 10:56:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,089 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,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:58,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818599917] [2022-07-12 10:56:58,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818599917] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:58,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443942163] [2022-07-12 10:56:58,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:58,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:58,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:58,090 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:58,091 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,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:58,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 2573 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-12 10:56:58,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:56:58,518 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:58,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:56:58,806 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:56:58,806 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:58,827 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:58,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:56:58,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443942163] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:58,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:56:58,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 20 [2022-07-12 10:56:58,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931225283] [2022-07-12 10:56:58,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:58,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 10:56:58,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:58,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 10:56:58,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-07-12 10:56:58,829 INFO L87 Difference]: Start difference. First operand 171 states and 201 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 10 states have internal predecessors, (59), 7 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:58,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:58,941 INFO L93 Difference]: Finished difference Result 333 states and 388 transitions. [2022-07-12 10:56:58,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 10:56:58,941 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 10 states have internal predecessors, (59), 7 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 98 [2022-07-12 10:56:58,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:58,943 INFO L225 Difference]: With dead ends: 333 [2022-07-12 10:56:58,943 INFO L226 Difference]: Without dead ends: 239 [2022-07-12 10:56:58,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 99 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2022-07-12 10:56:58,944 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 29 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:58,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 650 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 31 Unchecked, 0.1s Time] [2022-07-12 10:56:58,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-12 10:56:58,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 225. [2022-07-12 10:56:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 170 states have (on average 1.111764705882353) internal successors, (189), 174 states have internal predecessors, (189), 32 states have call successors, (32), 21 states have call predecessors, (32), 22 states have return successors, (45), 29 states have call predecessors, (45), 30 states have call successors, (45) [2022-07-12 10:56:58,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2022-07-12 10:56:58,959 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 98 [2022-07-12 10:56:58,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:58,959 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2022-07-12 10:56:58,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 10 states have internal predecessors, (59), 7 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:58,960 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2022-07-12 10:56:58,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 10:56:58,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:58,961 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-07-12 10:56:58,981 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:59,171 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,SelfDestructingSolverStorable17 [2022-07-12 10:56:59,171 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:59,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:59,172 INFO L85 PathProgramCache]: Analyzing trace with hash 590802921, now seen corresponding path program 1 times [2022-07-12 10:56:59,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:59,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848423003] [2022-07-12 10:56:59,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:59,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:56:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 10:56:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 10:56:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 10:56:59,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:59,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848423003] [2022-07-12 10:56:59,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848423003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:56:59,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:56:59,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:56:59,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000793687] [2022-07-12 10:56:59,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:56:59,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:56:59,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:56:59,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:56:59,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:56:59,367 INFO L87 Difference]: Start difference. First operand 225 states and 266 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:56:59,711 INFO L93 Difference]: Finished difference Result 275 states and 322 transitions. [2022-07-12 10:56:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:56:59,712 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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 100 [2022-07-12 10:56:59,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:56:59,713 INFO L225 Difference]: With dead ends: 275 [2022-07-12 10:56:59,713 INFO L226 Difference]: Without dead ends: 235 [2022-07-12 10:56:59,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:56:59,714 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 110 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:56:59,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 258 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:56:59,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-07-12 10:56:59,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 230. [2022-07-12 10:56:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 174 states have (on average 1.1091954022988506) internal successors, (193), 179 states have internal predecessors, (193), 32 states have call successors, (32), 21 states have call predecessors, (32), 23 states have return successors, (46), 29 states have call predecessors, (46), 30 states have call successors, (46) [2022-07-12 10:56:59,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 271 transitions. [2022-07-12 10:56:59,723 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 271 transitions. Word has length 100 [2022-07-12 10:56:59,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:56:59,723 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 271 transitions. [2022-07-12 10:56:59,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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:59,724 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 271 transitions. [2022-07-12 10:56:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-12 10:56:59,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:56:59,724 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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] [2022-07-12 10:56:59,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 10:56:59,725 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:56:59,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:56:59,725 INFO L85 PathProgramCache]: Analyzing trace with hash -585376130, now seen corresponding path program 1 times [2022-07-12 10:56:59,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:56:59,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215110382] [2022-07-12 10:56:59,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:59,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:56:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:56:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:56:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:56:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:56:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:56:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:56:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:56:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 10:56:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 10:56:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:56:59,927 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,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:56:59,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215110382] [2022-07-12 10:56:59,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215110382] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:56:59,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939217500] [2022-07-12 10:56:59,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:56:59,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:56:59,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:56:59,929 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:59,930 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:57:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 2573 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 10:57:00,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:00,403 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 10:57:00,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:57:00,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939217500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:00,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:57:00,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-07-12 10:57:00,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317958327] [2022-07-12 10:57:00,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:00,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:57:00,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:00,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:57:00,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:57:00,405 INFO L87 Difference]: Start difference. First operand 230 states and 271 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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), 1 states have call successors, (9) [2022-07-12 10:57:00,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:00,515 INFO L93 Difference]: Finished difference Result 365 states and 425 transitions. [2022-07-12 10:57:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 10:57:00,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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), 1 states have call successors, (9) Word has length 98 [2022-07-12 10:57:00,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:00,517 INFO L225 Difference]: With dead ends: 365 [2022-07-12 10:57:00,517 INFO L226 Difference]: Without dead ends: 221 [2022-07-12 10:57:00,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-07-12 10:57:00,518 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 24 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:00,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 423 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2022-07-12 10:57:00,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-12 10:57:00,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-07-12 10:57:00,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 166 states have (on average 1.1024096385542168) internal successors, (183), 170 states have internal predecessors, (183), 32 states have call successors, (32), 21 states have call predecessors, (32), 22 states have return successors, (43), 29 states have call predecessors, (43), 30 states have call successors, (43) [2022-07-12 10:57:00,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 258 transitions. [2022-07-12 10:57:00,527 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 258 transitions. Word has length 98 [2022-07-12 10:57:00,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:00,527 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 258 transitions. [2022-07-12 10:57:00,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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), 1 states have call successors, (9) [2022-07-12 10:57:00,528 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 258 transitions. [2022-07-12 10:57:00,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 10:57:00,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:00,528 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-07-12 10:57:00,550 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:57:00,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:00,729 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:00,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2026001115, now seen corresponding path program 2 times [2022-07-12 10:57:00,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:00,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141171980] [2022-07-12 10:57:00,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:00,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:57:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:57:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 10:57:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 10:57:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:00,905 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 10:57:00,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:00,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141171980] [2022-07-12 10:57:00,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141171980] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:00,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:00,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:57:00,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680831233] [2022-07-12 10:57:00,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:00,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:57:00,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:00,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:57:00,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:57:00,906 INFO L87 Difference]: Start difference. First operand 221 states and 258 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 8 states have internal predecessors, (48), 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:57:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:01,343 INFO L93 Difference]: Finished difference Result 235 states and 274 transitions. [2022-07-12 10:57:01,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 10:57:01,343 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 8 states have internal predecessors, (48), 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 100 [2022-07-12 10:57:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:01,344 INFO L225 Difference]: With dead ends: 235 [2022-07-12 10:57:01,344 INFO L226 Difference]: Without dead ends: 233 [2022-07-12 10:57:01,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-07-12 10:57:01,345 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 91 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:01,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 407 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:57:01,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-12 10:57:01,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2022-07-12 10:57:01,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 171 states have (on average 1.0994152046783625) internal successors, (188), 176 states have internal predecessors, (188), 32 states have call successors, (32), 21 states have call predecessors, (32), 23 states have return successors, (46), 29 states have call predecessors, (46), 30 states have call successors, (46) [2022-07-12 10:57:01,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 266 transitions. [2022-07-12 10:57:01,354 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 266 transitions. Word has length 100 [2022-07-12 10:57:01,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:01,354 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 266 transitions. [2022-07-12 10:57:01,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 8 states have internal predecessors, (48), 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:57:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 266 transitions. [2022-07-12 10:57:01,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-12 10:57:01,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:01,355 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-12 10:57:01,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 10:57:01,356 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:01,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:01,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1604384624, now seen corresponding path program 1 times [2022-07-12 10:57:01,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:01,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210239823] [2022-07-12 10:57:01,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:01,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:57:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:57:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 10:57:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 10:57:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 10:57:01,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:01,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210239823] [2022-07-12 10:57:01,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210239823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:01,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:01,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:57:01,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929266958] [2022-07-12 10:57:01,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:01,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:57:01,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:01,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:57:01,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:57:01,573 INFO L87 Difference]: Start difference. First operand 227 states and 266 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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:57:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:01,904 INFO L93 Difference]: Finished difference Result 267 states and 310 transitions. [2022-07-12 10:57:01,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:57:01,906 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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 102 [2022-07-12 10:57:01,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:01,907 INFO L225 Difference]: With dead ends: 267 [2022-07-12 10:57:01,907 INFO L226 Difference]: Without dead ends: 227 [2022-07-12 10:57:01,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:57:01,907 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 100 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:01,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 232 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 10:57:01,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-12 10:57:01,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2022-07-12 10:57:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 171 states have (on average 1.0994152046783625) internal successors, (188), 176 states have internal predecessors, (188), 32 states have call successors, (32), 21 states have call predecessors, (32), 23 states have return successors, (44), 29 states have call predecessors, (44), 30 states have call successors, (44) [2022-07-12 10:57:01,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 264 transitions. [2022-07-12 10:57:01,917 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 264 transitions. Word has length 102 [2022-07-12 10:57:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:01,917 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 264 transitions. [2022-07-12 10:57:01,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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:57:01,917 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-07-12 10:57:01,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 10:57:01,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:01,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:57:01,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 10:57:01,919 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:01,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:01,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1126798311, now seen corresponding path program 1 times [2022-07-12 10:57:01,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:01,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82150143] [2022-07-12 10:57:01,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:01,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:57:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:57:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 10:57:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 10:57:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:57:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:57:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 10:57:02,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:02,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82150143] [2022-07-12 10:57:02,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82150143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:02,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:02,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 10:57:02,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170728665] [2022-07-12 10:57:02,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:02,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 10:57:02,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:02,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 10:57:02,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:57:02,465 INFO L87 Difference]: Start difference. First operand 227 states and 264 transitions. Second operand has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 8 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2022-07-12 10:57:03,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:03,224 INFO L93 Difference]: Finished difference Result 261 states and 308 transitions. [2022-07-12 10:57:03,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 10:57:03,225 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 8 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) Word has length 106 [2022-07-12 10:57:03,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:03,226 INFO L225 Difference]: With dead ends: 261 [2022-07-12 10:57:03,226 INFO L226 Difference]: Without dead ends: 259 [2022-07-12 10:57:03,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-07-12 10:57:03,227 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 166 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:03,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 215 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 10:57:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-07-12 10:57:03,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 252. [2022-07-12 10:57:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 187 states have (on average 1.0962566844919786) internal successors, (205), 193 states have internal predecessors, (205), 37 states have call successors, (37), 22 states have call predecessors, (37), 27 states have return successors, (55), 36 states have call predecessors, (55), 35 states have call successors, (55) [2022-07-12 10:57:03,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 297 transitions. [2022-07-12 10:57:03,237 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 297 transitions. Word has length 106 [2022-07-12 10:57:03,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:03,237 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 297 transitions. [2022-07-12 10:57:03,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 8 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2022-07-12 10:57:03,237 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 297 transitions. [2022-07-12 10:57:03,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 10:57:03,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:03,238 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, 1] [2022-07-12 10:57:03,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 10:57:03,239 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:03,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:03,239 INFO L85 PathProgramCache]: Analyzing trace with hash -589292466, now seen corresponding path program 1 times [2022-07-12 10:57:03,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:03,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585417714] [2022-07-12 10:57:03,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:03,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:57:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:57:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 10:57:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:57:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 10:57:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 10:57:03,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:03,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585417714] [2022-07-12 10:57:03,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585417714] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:03,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509965731] [2022-07-12 10:57:03,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:03,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:03,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:03,600 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:57:03,632 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:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:03,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 2670 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-12 10:57:03,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:04,564 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-12 10:57:04,564 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 52 treesize of output 1 [2022-07-12 10:57:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 61 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 10:57:04,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:57:04,807 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 29 treesize of output 17 [2022-07-12 10:57:04,871 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 10:57:04,871 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 31 treesize of output 26 [2022-07-12 10:57:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 10:57:04,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509965731] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:57:04,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:57:04,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 29 [2022-07-12 10:57:04,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800310049] [2022-07-12 10:57:04,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:57:04,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 10:57:04,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:04,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 10:57:04,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2022-07-12 10:57:04,906 INFO L87 Difference]: Start difference. First operand 252 states and 297 transitions. Second operand has 29 states, 27 states have (on average 4.851851851851852) internal successors, (131), 23 states have internal predecessors, (131), 9 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (23), 5 states have call predecessors, (23), 7 states have call successors, (23) [2022-07-12 10:57:06,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:06,784 INFO L93 Difference]: Finished difference Result 458 states and 534 transitions. [2022-07-12 10:57:06,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 10:57:06,785 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 4.851851851851852) internal successors, (131), 23 states have internal predecessors, (131), 9 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (23), 5 states have call predecessors, (23), 7 states have call successors, (23) Word has length 112 [2022-07-12 10:57:06,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:06,786 INFO L225 Difference]: With dead ends: 458 [2022-07-12 10:57:06,786 INFO L226 Difference]: Without dead ends: 278 [2022-07-12 10:57:06,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 235 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=359, Invalid=2091, Unknown=0, NotChecked=0, Total=2450 [2022-07-12 10:57:06,789 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 252 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 409 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:06,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 389 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1618 Invalid, 0 Unknown, 409 Unchecked, 1.1s Time] [2022-07-12 10:57:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-12 10:57:06,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 261. [2022-07-12 10:57:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 195 states have (on average 1.0974358974358975) internal successors, (214), 200 states have internal predecessors, (214), 37 states have call successors, (37), 24 states have call predecessors, (37), 28 states have return successors, (52), 36 states have call predecessors, (52), 35 states have call successors, (52) [2022-07-12 10:57:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 303 transitions. [2022-07-12 10:57:06,804 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 303 transitions. Word has length 112 [2022-07-12 10:57:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:06,805 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 303 transitions. [2022-07-12 10:57:06,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 4.851851851851852) internal successors, (131), 23 states have internal predecessors, (131), 9 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (23), 5 states have call predecessors, (23), 7 states have call successors, (23) [2022-07-12 10:57:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 303 transitions. [2022-07-12 10:57:06,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 10:57:06,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:06,813 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, 1] [2022-07-12 10:57:06,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-12 10:57:07,031 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,SelfDestructingSolverStorable23 [2022-07-12 10:57:07,031 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:07,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:07,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1476515312, now seen corresponding path program 1 times [2022-07-12 10:57:07,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:07,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388485289] [2022-07-12 10:57:07,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:07,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:07,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:07,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:07,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:57:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:07,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:07,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:57:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:07,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:07,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:07,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 10:57:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:07,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 10:57:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:07,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:07,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:07,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 10:57:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:07,390 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:07,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:07,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388485289] [2022-07-12 10:57:07,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388485289] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:07,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954696186] [2022-07-12 10:57:07,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:07,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:07,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:07,392 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:07,394 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:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:07,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 2665 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 10:57:07,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:07,821 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:07,823 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:08,030 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:08,039 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:08,058 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:08,058 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:57:08,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954696186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:08,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:57:08,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16] total 24 [2022-07-12 10:57:08,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140798986] [2022-07-12 10:57:08,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:08,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:57:08,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:08,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:57:08,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2022-07-12 10:57:08,059 INFO L87 Difference]: Start difference. First operand 261 states and 303 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 9 states have internal predecessors, (80), 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:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:08,293 INFO L93 Difference]: Finished difference Result 410 states and 468 transitions. [2022-07-12 10:57:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:57:08,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 9 states have internal predecessors, (80), 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 112 [2022-07-12 10:57:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:08,295 INFO L225 Difference]: With dead ends: 410 [2022-07-12 10:57:08,295 INFO L226 Difference]: Without dead ends: 268 [2022-07-12 10:57:08,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2022-07-12 10:57:08,296 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 52 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:08,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 812 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-07-12 10:57:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-12 10:57:08,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-07-12 10:57:08,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 200 states have (on average 1.095) internal successors, (219), 204 states have internal predecessors, (219), 38 states have call successors, (38), 25 states have call predecessors, (38), 29 states have return successors, (53), 38 states have call predecessors, (53), 36 states have call successors, (53) [2022-07-12 10:57:08,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 310 transitions. [2022-07-12 10:57:08,311 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 310 transitions. Word has length 112 [2022-07-12 10:57:08,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:08,312 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 310 transitions. [2022-07-12 10:57:08,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 9 states have internal predecessors, (80), 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:08,312 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 310 transitions. [2022-07-12 10:57:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 10:57:08,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:08,313 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1] [2022-07-12 10:57:08,333 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:08,533 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,SelfDestructingSolverStorable24 [2022-07-12 10:57:08,533 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:08,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:08,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1680736505, now seen corresponding path program 1 times [2022-07-12 10:57:08,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:08,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163215659] [2022-07-12 10:57:08,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:08,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:57:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:57:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 10:57:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:08,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 10:57:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:57:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:57:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 10:57:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 10:57:09,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:09,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163215659] [2022-07-12 10:57:09,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163215659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:09,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:09,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 10:57:09,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56833139] [2022-07-12 10:57:09,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:09,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 10:57:09,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:09,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 10:57:09,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-12 10:57:09,075 INFO L87 Difference]: Start difference. First operand 268 states and 310 transitions. Second operand has 15 states, 13 states have (on average 4.461538461538462) internal successors, (58), 11 states have internal predecessors, (58), 8 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-12 10:57:09,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:09,846 INFO L93 Difference]: Finished difference Result 281 states and 324 transitions. [2022-07-12 10:57:09,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:57:09,846 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.461538461538462) internal successors, (58), 11 states have internal predecessors, (58), 8 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) Word has length 112 [2022-07-12 10:57:09,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:09,848 INFO L225 Difference]: With dead ends: 281 [2022-07-12 10:57:09,848 INFO L226 Difference]: Without dead ends: 279 [2022-07-12 10:57:09,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-07-12 10:57:09,848 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 181 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:09,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 223 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 10:57:09,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-12 10:57:09,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 274. [2022-07-12 10:57:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 204 states have (on average 1.0931372549019607) internal successors, (223), 208 states have internal predecessors, (223), 39 states have call successors, (39), 26 states have call predecessors, (39), 30 states have return successors, (54), 39 states have call predecessors, (54), 37 states have call successors, (54) [2022-07-12 10:57:09,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 316 transitions. [2022-07-12 10:57:09,859 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 316 transitions. Word has length 112 [2022-07-12 10:57:09,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:09,859 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 316 transitions. [2022-07-12 10:57:09,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.461538461538462) internal successors, (58), 11 states have internal predecessors, (58), 8 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-12 10:57:09,859 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 316 transitions. [2022-07-12 10:57:09,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-12 10:57:09,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:09,860 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, 1] [2022-07-12 10:57:09,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 10:57:09,860 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:09,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:09,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1114984106, now seen corresponding path program 1 times [2022-07-12 10:57:09,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:09,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673997897] [2022-07-12 10:57:09,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:09,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:57:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:57:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:09,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 10:57:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 10:57:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:57:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,050 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:10,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:10,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673997897] [2022-07-12 10:57:10,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673997897] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:10,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436595262] [2022-07-12 10:57:10,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:10,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:10,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:10,052 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:10,053 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:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:10,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 2672 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-12 10:57:10,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:10,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:57:10,852 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:57:10,853 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:10,989 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:10,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:57:11,347 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:11,418 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-12 10:57:11,419 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:11,433 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:11,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436595262] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:57:11,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:57:11,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 14] total 34 [2022-07-12 10:57:11,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803401607] [2022-07-12 10:57:11,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:57:11,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-12 10:57:11,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:11,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-12 10:57:11,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 10:57:11,436 INFO L87 Difference]: Start difference. First operand 274 states and 316 transitions. Second operand has 34 states, 29 states have (on average 4.931034482758621) internal successors, (143), 27 states have internal predecessors, (143), 16 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:13,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:13,879 INFO L93 Difference]: Finished difference Result 490 states and 556 transitions. [2022-07-12 10:57:13,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-12 10:57:13,880 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 4.931034482758621) internal successors, (143), 27 states have internal predecessors, (143), 16 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 116 [2022-07-12 10:57:13,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:13,882 INFO L225 Difference]: With dead ends: 490 [2022-07-12 10:57:13,882 INFO L226 Difference]: Without dead ends: 254 [2022-07-12 10:57:13,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 228 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=502, Invalid=5346, Unknown=4, NotChecked=0, Total=5852 [2022-07-12 10:57:13,884 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 278 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 2431 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 2802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 256 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:13,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 802 Invalid, 2802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2431 Invalid, 0 Unknown, 256 Unchecked, 1.1s Time] [2022-07-12 10:57:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-07-12 10:57:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2022-07-12 10:57:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 176 states have (on average 1.0625) internal successors, (187), 178 states have internal predecessors, (187), 37 states have call successors, (37), 25 states have call predecessors, (37), 26 states have return successors, (47), 36 states have call predecessors, (47), 35 states have call successors, (47) [2022-07-12 10:57:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 271 transitions. [2022-07-12 10:57:13,896 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 271 transitions. Word has length 116 [2022-07-12 10:57:13,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:13,897 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 271 transitions. [2022-07-12 10:57:13,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 4.931034482758621) internal successors, (143), 27 states have internal predecessors, (143), 16 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:13,897 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 271 transitions. [2022-07-12 10:57:13,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 10:57:13,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:13,899 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2022-07-12 10:57:13,921 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:14,111 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,SelfDestructingSolverStorable26 [2022-07-12 10:57:14,111 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:14,112 INFO L85 PathProgramCache]: Analyzing trace with hash -959716687, now seen corresponding path program 1 times [2022-07-12 10:57:14,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:14,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877509588] [2022-07-12 10:57:14,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:14,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:14,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:14,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:14,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:57:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:14,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:14,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:57:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:14,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:14,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 10:57:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:14,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:14,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 10:57:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:14,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 10:57:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:14,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 10:57:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:14,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 10:57:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:14,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 10:57:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:14,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 10:57:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-12 10:57:14,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:14,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877509588] [2022-07-12 10:57:14,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877509588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:14,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:14,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 10:57:14,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154100715] [2022-07-12 10:57:14,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:14,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 10:57:14,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:14,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 10:57:14,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:57:14,546 INFO L87 Difference]: Start difference. First operand 240 states and 271 transitions. Second operand has 14 states, 12 states have (on average 4.5) internal successors, (54), 10 states have internal predecessors, (54), 8 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-07-12 10:57:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:15,216 INFO L93 Difference]: Finished difference Result 251 states and 282 transitions. [2022-07-12 10:57:15,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 10:57:15,216 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.5) internal successors, (54), 10 states have internal predecessors, (54), 8 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 118 [2022-07-12 10:57:15,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:15,217 INFO L225 Difference]: With dead ends: 251 [2022-07-12 10:57:15,218 INFO L226 Difference]: Without dead ends: 249 [2022-07-12 10:57:15,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-07-12 10:57:15,218 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 221 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:15,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 200 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 10:57:15,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-12 10:57:15,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2022-07-12 10:57:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 180 states have (on average 1.0611111111111111) internal successors, (191), 182 states have internal predecessors, (191), 38 states have call successors, (38), 26 states have call predecessors, (38), 27 states have return successors, (48), 37 states have call predecessors, (48), 36 states have call successors, (48) [2022-07-12 10:57:15,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 277 transitions. [2022-07-12 10:57:15,234 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 277 transitions. Word has length 118 [2022-07-12 10:57:15,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:15,234 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 277 transitions. [2022-07-12 10:57:15,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.5) internal successors, (54), 10 states have internal predecessors, (54), 8 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-07-12 10:57:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 277 transitions. [2022-07-12 10:57:15,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-12 10:57:15,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:15,237 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] [2022-07-12 10:57:15,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 10:57:15,237 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:15,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:15,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1201655876, now seen corresponding path program 1 times [2022-07-12 10:57:15,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:15,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898262948] [2022-07-12 10:57:15,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:15,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:57:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:57:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 10:57:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 10:57:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 10:57:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:15,393 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:15,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:15,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898262948] [2022-07-12 10:57:15,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898262948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:57:15,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:57:15,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 10:57:15,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008043766] [2022-07-12 10:57:15,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:57:15,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:57:15,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:15,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:57:15,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:57:15,396 INFO L87 Difference]: Start difference. First operand 246 states and 277 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 3 states have internal predecessors, (55), 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:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:57:15,606 INFO L93 Difference]: Finished difference Result 342 states and 372 transitions. [2022-07-12 10:57:15,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:57:15,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 3 states have internal predecessors, (55), 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 119 [2022-07-12 10:57:15,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:57:15,607 INFO L225 Difference]: With dead ends: 342 [2022-07-12 10:57:15,607 INFO L226 Difference]: Without dead ends: 236 [2022-07-12 10:57:15,607 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:15,608 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 109 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 10:57:15,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 156 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 10:57:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-12 10:57:15,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2022-07-12 10:57:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 173 states have (on average 1.0578034682080926) internal successors, (183), 174 states have internal predecessors, (183), 36 states have call successors, (36), 26 states have call predecessors, (36), 25 states have return successors, (42), 34 states have call predecessors, (42), 34 states have call successors, (42) [2022-07-12 10:57:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 261 transitions. [2022-07-12 10:57:15,618 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 261 transitions. Word has length 119 [2022-07-12 10:57:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:57:15,619 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 261 transitions. [2022-07-12 10:57:15,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 3 states have internal predecessors, (55), 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:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 261 transitions. [2022-07-12 10:57:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-12 10:57:15,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:57:15,620 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, 1] [2022-07-12 10:57:15,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-12 10:57:15,620 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:57:15,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:57:15,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1430669570, now seen corresponding path program 1 times [2022-07-12 10:57:15,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:57:15,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410569028] [2022-07-12 10:57:15,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:15,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:57:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:57:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:57:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:57:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:57:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:57:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:57:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 10:57:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 10:57:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:57:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 10:57:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 10:57:16,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:57:16,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410569028] [2022-07-12 10:57:16,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410569028] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:16,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4487556] [2022-07-12 10:57:16,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:57:16,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:57:16,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:57:16,713 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:16,715 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:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:57:17,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 2700 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-12 10:57:17,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:57:17,115 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:57:17,244 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:57:17,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 10:57:17,252 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:57:19,260 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_24| Int)) (not (= |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_24| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_24|) 8)))) is different from true [2022-07-12 10:57:21,304 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_25| Int)) (not (= |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_25| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_25|) 8)))) is different from true [2022-07-12 10:57:23,334 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_17| Int)) (not (= |v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_17| (select (select |c_#memory_$Pointer$.base| |v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_17|) 8)))) is different from true [2022-07-12 10:57:29,680 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:57:29,798 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1446 (Array Int Int))) (= (store |c_old(#memory_int)| |c_memset_impl_#in~s.base| v_ArrVal_1446) |c_#memory_int|)) is different from true [2022-07-12 10:57:29,807 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1446 (Array Int Int))) (= (store |c_old(#memory_int)| |c_my_memset_#in~s.base| v_ArrVal_1446) |c_#memory_int|)) is different from true [2022-07-12 10:57:29,834 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 26 treesize of output 26 [2022-07-12 10:57:29,846 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:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 8 proven. 28 refuted. 6 times theorem prover too weak. 4 trivial. 42 not checked. [2022-07-12 10:57:34,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:57:34,450 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1454 (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_1454) |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:34,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4487556] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:57:34,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:57:34,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 32] total 46 [2022-07-12 10:57:34,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455219595] [2022-07-12 10:57:34,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:57:34,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-12 10:57:34,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:57:34,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-12 10:57:34,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1830, Unknown=8, NotChecked=546, Total=2550 [2022-07-12 10:57:34,453 INFO L87 Difference]: Start difference. First operand 235 states and 261 transitions. Second operand has 46 states, 41 states have (on average 3.682926829268293) internal successors, (151), 39 states have internal predecessors, (151), 14 states have call successors, (24), 13 states have call predecessors, (24), 14 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2022-07-12 10:58:45,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 10:58:45,877 INFO L93 Difference]: Finished difference Result 335 states and 369 transitions. [2022-07-12 10:58:45,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-12 10:58:45,878 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 3.682926829268293) internal successors, (151), 39 states have internal predecessors, (151), 14 states have call successors, (24), 13 states have call predecessors, (24), 14 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) Word has length 121 [2022-07-12 10:58:45,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 10:58:45,879 INFO L225 Difference]: With dead ends: 335 [2022-07-12 10:58:45,879 INFO L226 Difference]: Without dead ends: 268 [2022-07-12 10:58:45,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 140 SyntacticMatches, 11 SemanticMatches, 79 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1349 ImplicationChecksByTransitivity, 87.8s TimeCoverageRelationStatistics Valid=461, Invalid=5036, Unknown=77, NotChecked=906, Total=6480 [2022-07-12 10:58:45,881 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 291 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 3941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1989 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 10:58:45,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 718 Invalid, 3941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1741 Invalid, 0 Unknown, 1989 Unchecked, 0.9s Time] [2022-07-12 10:58:45,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-12 10:58:45,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 263. [2022-07-12 10:58:45,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 196 states have (on average 1.0561224489795917) internal successors, (207), 198 states have internal predecessors, (207), 38 states have call successors, (38), 28 states have call predecessors, (38), 28 states have return successors, (47), 36 states have call predecessors, (47), 36 states have call successors, (47) [2022-07-12 10:58:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2022-07-12 10:58:45,892 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 121 [2022-07-12 10:58:45,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 10:58:45,893 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2022-07-12 10:58:45,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 3.682926829268293) internal successors, (151), 39 states have internal predecessors, (151), 14 states have call successors, (24), 13 states have call predecessors, (24), 14 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2022-07-12 10:58:45,893 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2022-07-12 10:58:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-12 10:58:45,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 10:58:45,894 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, 1] [2022-07-12 10:58:45,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 10:58:46,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:58:46,095 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 10:58:46,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:58:46,095 INFO L85 PathProgramCache]: Analyzing trace with hash -65138626, now seen corresponding path program 1 times [2022-07-12 10:58:46,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:58:46,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631946135] [2022-07-12 10:58:46,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:46,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:58:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:46,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 10:58:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:46,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 10:58:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:46,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 10:58:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:46,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:58:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:46,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 10:58:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:46,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 10:58:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:46,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 10:58:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:46,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 10:58:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:46,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 10:58:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:46,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:58:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:46,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 10:58:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:46,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 10:58:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 30 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 10:58:47,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:58:47,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631946135] [2022-07-12 10:58:47,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631946135] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:58:47,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246742713] [2022-07-12 10:58:47,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:58:47,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:58:47,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:58:47,126 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:58:47,127 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:58:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:58:47,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 2710 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-12 10:58:47,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:58:47,509 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:58:47,628 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:58:47,628 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:58:47,651 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:58:47,655 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:58:49,661 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_29| Int)) (not (= |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_29| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_29|) 8)))) is different from true [2022-07-12 10:58:51,741 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_30| Int)) (not (= |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_30| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_30|) 8)))) is different from true [2022-07-12 10:58:53,777 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_22| Int)) (not (= |v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$.base| |v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_22|) 8)))) is different from true [2022-07-12 10:59:02,156 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:02,264 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1553 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_memset_impl_#in~s.base| v_ArrVal_1553))) is different from true [2022-07-12 10:59:02,272 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1553 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_my_memset_#in~s.base| v_ArrVal_1553))) is different from true [2022-07-12 10:59:02,280 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 26 treesize of output 26 [2022-07-12 10:59:02,294 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:04,643 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 8 proven. 29 refuted. 5 times theorem prover too weak. 4 trivial. 42 not checked. [2022-07-12 10:59:04,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:59:04,888 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1561 (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_1561) |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:04,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246742713] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:59:04,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:59:04,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 33] total 46 [2022-07-12 10:59:04,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406262652] [2022-07-12 10:59:04,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 10:59:04,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-12 10:59:04,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:59:04,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-12 10:59:04,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1824, Unknown=7, NotChecked=546, Total=2550 [2022-07-12 10:59:04,891 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand has 46 states, 41 states have (on average 3.658536585365854) internal successors, (150), 39 states have internal predecessors, (150), 14 states have call successors, (24), 13 states have call predecessors, (24), 14 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2022-07-12 11:00:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:00:35,005 INFO L93 Difference]: Finished difference Result 475 states and 544 transitions. [2022-07-12 11:00:35,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-12 11:00:35,005 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 3.658536585365854) internal successors, (150), 39 states have internal predecessors, (150), 14 states have call successors, (24), 13 states have call predecessors, (24), 14 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) Word has length 121 [2022-07-12 11:00:35,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:00:35,008 INFO L225 Difference]: With dead ends: 475 [2022-07-12 11:00:35,008 INFO L226 Difference]: Without dead ends: 385 [2022-07-12 11:00:35,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 141 SyntacticMatches, 12 SemanticMatches, 81 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 106.0s TimeCoverageRelationStatistics Valid=509, Invalid=5279, Unknown=88, NotChecked=930, Total=6806 [2022-07-12 11:00:35,012 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 293 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 2059 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 4667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 2059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2355 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:00:35,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 897 Invalid, 4667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 2059 Invalid, 0 Unknown, 2355 Unchecked, 1.3s Time] [2022-07-12 11:00:35,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-07-12 11:00:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 357. [2022-07-12 11:00:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 264 states have (on average 1.053030303030303) internal successors, (278), 265 states have internal predecessors, (278), 56 states have call successors, (56), 37 states have call predecessors, (56), 36 states have return successors, (74), 54 states have call predecessors, (74), 54 states have call successors, (74) [2022-07-12 11:00:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 408 transitions. [2022-07-12 11:00:35,032 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 408 transitions. Word has length 121 [2022-07-12 11:00:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:00:35,033 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 408 transitions. [2022-07-12 11:00:35,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 3.658536585365854) internal successors, (150), 39 states have internal predecessors, (150), 14 states have call successors, (24), 13 states have call predecessors, (24), 14 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2022-07-12 11:00:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 408 transitions. [2022-07-12 11:00:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-12 11:00:35,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:35,034 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 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 11:00:35,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 11:00:35,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:35,255 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:35,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:35,256 INFO L85 PathProgramCache]: Analyzing trace with hash -555145363, now seen corresponding path program 1 times [2022-07-12 11:00:35,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:35,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745963513] [2022-07-12 11:00:35,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:35,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:35,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:00:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:35,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:00:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:35,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:00:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:35,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:00:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:35,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:00:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:35,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 11:00:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:35,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:00:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:35,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:00:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:35,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:00:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:35,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:00:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:35,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:00:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:35,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:00:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:35,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 11:00:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 11:00:35,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:35,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745963513] [2022-07-12 11:00:35,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745963513] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:00:35,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179038908] [2022-07-12 11:00:35,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:35,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:35,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:00:35,663 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 11:00:35,665 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 11:00:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:36,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 2718 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-12 11:00:36,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:00:36,533 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-12 11:00:36,533 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 49 treesize of output 1 [2022-07-12 11:00:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 73 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 11:00:36,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:00:36,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-12 11:00:36,793 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 11:00:36,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-12 11:00:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 11:00:36,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179038908] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:00:36,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:00:36,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 25 [2022-07-12 11:00:36,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901886571] [2022-07-12 11:00:36,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:00:36,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 11:00:36,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:00:36,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 11:00:36,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2022-07-12 11:00:36,827 INFO L87 Difference]: Start difference. First operand 357 states and 408 transitions. Second operand has 25 states, 23 states have (on average 6.521739130434782) internal successors, (150), 19 states have internal predecessors, (150), 9 states have call successors, (31), 7 states have call predecessors, (31), 6 states have return successors, (25), 5 states have call predecessors, (25), 7 states have call successors, (25) [2022-07-12 11:00:38,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:00:38,284 INFO L93 Difference]: Finished difference Result 576 states and 655 transitions. [2022-07-12 11:00:38,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 11:00:38,285 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 6.521739130434782) internal successors, (150), 19 states have internal predecessors, (150), 9 states have call successors, (31), 7 states have call predecessors, (31), 6 states have return successors, (25), 5 states have call predecessors, (25), 7 states have call successors, (25) Word has length 126 [2022-07-12 11:00:38,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:00:38,286 INFO L225 Difference]: With dead ends: 576 [2022-07-12 11:00:38,286 INFO L226 Difference]: Without dead ends: 391 [2022-07-12 11:00:38,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 270 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=279, Invalid=1701, Unknown=0, NotChecked=0, Total=1980 [2022-07-12 11:00:38,288 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 220 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 524 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:00:38,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 264 Invalid, 1897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1228 Invalid, 0 Unknown, 524 Unchecked, 0.8s Time] [2022-07-12 11:00:38,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-07-12 11:00:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 366. [2022-07-12 11:00:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 271 states have (on average 1.047970479704797) internal successors, (284), 273 states have internal predecessors, (284), 57 states have call successors, (57), 36 states have call predecessors, (57), 37 states have return successors, (72), 56 states have call predecessors, (72), 55 states have call successors, (72) [2022-07-12 11:00:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 413 transitions. [2022-07-12 11:00:38,307 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 413 transitions. Word has length 126 [2022-07-12 11:00:38,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:00:38,307 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 413 transitions. [2022-07-12 11:00:38,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 6.521739130434782) internal successors, (150), 19 states have internal predecessors, (150), 9 states have call successors, (31), 7 states have call predecessors, (31), 6 states have return successors, (25), 5 states have call predecessors, (25), 7 states have call successors, (25) [2022-07-12 11:00:38,308 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 413 transitions. [2022-07-12 11:00:38,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-12 11:00:38,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:00:38,309 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, 1, 1, 1, 1, 1, 1] [2022-07-12 11:00:38,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 11:00:38,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:38,523 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:00:38,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:00:38,524 INFO L85 PathProgramCache]: Analyzing trace with hash 769710831, now seen corresponding path program 1 times [2022-07-12 11:00:38,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:00:38,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972727895] [2022-07-12 11:00:38,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:38,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:00:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:39,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:00:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:39,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:00:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:39,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:00:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:39,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:00:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:39,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:00:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:39,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 11:00:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:39,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:00:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:39,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:00:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:39,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:00:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:39,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:00:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:39,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:00:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:39,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:00:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:39,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 11:00:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:39,577 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 11:00:39,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:00:39,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972727895] [2022-07-12 11:00:39,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972727895] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:00:39,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171490038] [2022-07-12 11:00:39,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:00:39,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:00:39,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:00:39,579 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:00:39,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 11:00:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:00:39,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 2723 conjuncts, 106 conjunts are in the unsatisfiable core [2022-07-12 11:00:39,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:00:39,966 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 11:00:40,123 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 11:00:40,124 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 11:00:40,132 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 11:00:42,210 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_38| Int)) (not (= |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_38| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_38|) 8)))) is different from true [2022-07-12 11:00:44,243 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_39| Int)) (not (= |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_39| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_reset_harness_~#buf~3#1.base_BEFORE_CALL_39|) 8)))) is different from true [2022-07-12 11:00:46,274 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_29| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_29|) 8) |v_aws_byte_buf_secure_zero_~buf#1.base_BEFORE_CALL_29|))) is different from true