./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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_hash_table_put_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 7e3410638a547f2efce35a13c7d23c64ee660b1c493ec273ce9d4043edc218c3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:49:55,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:49:55,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:49:55,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:49:55,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:49:55,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:49:55,251 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:49:55,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:49:55,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:49:55,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:49:55,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:49:55,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:49:55,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:49:55,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:49:55,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:49:55,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:49:55,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:49:55,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:49:55,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:49:55,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:49:55,278 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:49:55,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:49:55,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:49:55,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:49:55,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:49:55,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:49:55,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:49:55,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:49:55,285 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:49:55,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:49:55,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:49:55,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:49:55,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:49:55,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:49:55,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:49:55,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:49:55,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:49:55,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:49:55,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:49:55,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:49:55,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:49:55,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:49:55,296 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 22:49:55,323 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:49:55,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:49:55,324 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:49:55,324 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:49:55,325 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:49:55,325 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:49:55,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:49:55,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:49:55,326 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:49:55,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:49:55,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:49:55,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:49:55,327 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:49:55,327 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:49:55,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:49:55,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:49:55,328 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:49:55,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:49:55,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:49:55,328 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:49:55,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:49:55,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:49:55,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:49:55,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:49:55,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:49:55,329 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:49:55,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:49:55,330 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:49:55,330 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:49:55,330 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:49:55,330 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 -> 7e3410638a547f2efce35a13c7d23c64ee660b1c493ec273ce9d4043edc218c3 [2022-07-13 22:49:55,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:49:55,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:49:55,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:49:55,565 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:49:55,566 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:49:55,567 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i [2022-07-13 22:49:55,636 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ab379f22/4e243890d86a45e1942a6c483dbbc0bb/FLAG90e9f8f93 [2022-07-13 22:49:56,324 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:49:56,324 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i [2022-07-13 22:49:56,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ab379f22/4e243890d86a45e1942a6c483dbbc0bb/FLAG90e9f8f93 [2022-07-13 22:49:56,610 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ab379f22/4e243890d86a45e1942a6c483dbbc0bb [2022-07-13 22:49:56,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:49:56,614 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:49:56,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:49:56,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:49:56,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:49:56,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:49:56" (1/1) ... [2022-07-13 22:49:56,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b80eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:49:56, skipping insertion in model container [2022-07-13 22:49:56,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:49:56" (1/1) ... [2022-07-13 22:49:56,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:49:56,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:49:56,946 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_hash_table_put_harness.i[4492,4505] [2022-07-13 22:49:56,951 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_hash_table_put_harness.i[4552,4565] [2022-07-13 22:49:57,587 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:57,588 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:57,588 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:57,589 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:57,590 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:57,600 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:57,601 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:57,602 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:57,603 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:57,604 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:57,605 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:57,606 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:57,606 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:57,898 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:49:57,900 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:49:57,901 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:49:57,902 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:49:57,903 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:49:57,904 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:49:57,904 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:49:57,905 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:49:57,911 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:49:57,913 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:49:58,076 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:49:58,280 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,281 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,295 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,296 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,300 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,300 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,310 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,311 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,311 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,311 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,312 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,312 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,312 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:49:58,374 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:49:58,395 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_hash_table_put_harness.i[4492,4505] [2022-07-13 22:49:58,396 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_hash_table_put_harness.i[4552,4565] [2022-07-13 22:49:58,462 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,463 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,463 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,464 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,464 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,468 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,468 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,469 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,469 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,470 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,470 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,470 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,471 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,498 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:49:58,499 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:49:58,500 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:49:58,500 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:49:58,501 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:49:58,502 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:49:58,502 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:49:58,502 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:49:58,503 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:49:58,503 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:49:58,526 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:49:58,625 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,625 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,634 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,634 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,657 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,658 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,669 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,669 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,670 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,670 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,670 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,671 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,671 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:49:58,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:49:58,913 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:49:58,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:49:58 WrapperNode [2022-07-13 22:49:58,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:49:58,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:49:58,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:49:58,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:49:58,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:49:58" (1/1) ... [2022-07-13 22:49:59,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:49:58" (1/1) ... [2022-07-13 22:49:59,112 INFO L137 Inliner]: procedures = 775, calls = 2489, calls flagged for inlining = 70, calls inlined = 25, statements flattened = 1393 [2022-07-13 22:49:59,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:49:59,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:49:59,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:49:59,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:49:59,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:49:58" (1/1) ... [2022-07-13 22:49:59,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:49:58" (1/1) ... [2022-07-13 22:49:59,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:49:58" (1/1) ... [2022-07-13 22:49:59,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:49:58" (1/1) ... [2022-07-13 22:49:59,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:49:58" (1/1) ... [2022-07-13 22:49:59,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:49:58" (1/1) ... [2022-07-13 22:49:59,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:49:58" (1/1) ... [2022-07-13 22:49:59,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:49:59,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:49:59,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:49:59,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:49:59,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:49:58" (1/1) ... [2022-07-13 22:49:59,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:49:59,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:49:59,288 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-13 22:49:59,309 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-13 22:49:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-13 22:49:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-13 22:49:59,330 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-13 22:49:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:49:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-13 22:49:59,330 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-13 22:49:59,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:49:59,331 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:49:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-07-13 22:49:59,332 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-07-13 22:49:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:49:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:49:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:49:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure s_emplace_item [2022-07-13 22:49:59,333 INFO L138 BoogieDeclarations]: Found implementation of procedure s_emplace_item [2022-07-13 22:49:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:49:59,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:49:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-13 22:49:59,333 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-13 22:49:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-07-13 22:49:59,333 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-07-13 22:49:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2022-07-13 22:49:59,334 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2022-07-13 22:49:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:49:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-13 22:49:59,334 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-13 22:49:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:49:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-13 22:49:59,335 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-13 22:49:59,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:49:59,335 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2022-07-13 22:49:59,335 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2022-07-13 22:49:59,335 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-07-13 22:49:59,335 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-07-13 22:49:59,336 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2022-07-13 22:49:59,336 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2022-07-13 22:49:59,336 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2022-07-13 22:49:59,336 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2022-07-13 22:49:59,336 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2022-07-13 22:49:59,336 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2022-07-13 22:49:59,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:49:59,337 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-07-13 22:49:59,338 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-07-13 22:49:59,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-13 22:49:59,340 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2022-07-13 22:49:59,340 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2022-07-13 22:49:59,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-13 22:49:59,341 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-07-13 22:49:59,341 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-07-13 22:49:59,341 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-13 22:49:59,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-13 22:49:59,341 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2022-07-13 22:49:59,345 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2022-07-13 22:49:59,346 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2022-07-13 22:49:59,346 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2022-07-13 22:49:59,346 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2022-07-13 22:49:59,346 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2022-07-13 22:49:59,346 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:49:59,346 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:49:59,347 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-07-13 22:49:59,347 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-07-13 22:49:59,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:49:59,347 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-13 22:49:59,347 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-13 22:49:59,347 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-07-13 22:49:59,347 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-07-13 22:49:59,348 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-13 22:49:59,348 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-13 22:49:59,348 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2022-07-13 22:49:59,348 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2022-07-13 22:49:59,348 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-13 22:49:59,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-13 22:49:59,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:49:59,733 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:49:59,735 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:50:00,016 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume !true; [2022-07-13 22:50:00,072 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !true; [2022-07-13 22:50:00,495 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume !true; [2022-07-13 22:50:00,495 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !true; [2022-07-13 22:50:01,090 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:50:01,101 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:50:01,102 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-13 22:50:01,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:50:01 BoogieIcfgContainer [2022-07-13 22:50:01,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:50:01,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:50:01,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:50:01,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:50:01,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:49:56" (1/3) ... [2022-07-13 22:50:01,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5931bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:50:01, skipping insertion in model container [2022-07-13 22:50:01,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:49:58" (2/3) ... [2022-07-13 22:50:01,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5931bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:50:01, skipping insertion in model container [2022-07-13 22:50:01,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:50:01" (3/3) ... [2022-07-13 22:50:01,111 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_put_harness.i [2022-07-13 22:50:01,123 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:50:01,123 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:50:01,184 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:50:01,189 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@274d29c7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@30a743b4 [2022-07-13 22:50:01,189 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:50:01,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 361 states, 248 states have (on average 1.282258064516129) internal successors, (318), 245 states have internal predecessors, (318), 86 states have call successors, (86), 29 states have call predecessors, (86), 29 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2022-07-13 22:50:01,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 22:50:01,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:01,205 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:01,206 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:01,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash 200610363, now seen corresponding path program 1 times [2022-07-13 22:50:01,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:01,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363649698] [2022-07-13 22:50:01,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:01,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:01,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:01,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:01,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:01,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:01,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:01,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:01,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363649698] [2022-07-13 22:50:01,822 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-13 22:50:01,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448094830] [2022-07-13 22:50:01,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:01,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:01,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:01,827 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-13 22:50:01,865 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-13 22:50:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:02,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 2859 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 22:50:02,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-13 22:50:02,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:50:02,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448094830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:02,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:02,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 22:50:02,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670852674] [2022-07-13 22:50:02,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:02,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 22:50:02,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:02,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 22:50:02,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:50:02,558 INFO L87 Difference]: Start difference. First operand has 361 states, 248 states have (on average 1.282258064516129) internal successors, (318), 245 states have internal predecessors, (318), 86 states have call successors, (86), 29 states have call predecessors, (86), 29 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-13 22:50:02,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:02,614 INFO L93 Difference]: Finished difference Result 716 states and 1017 transitions. [2022-07-13 22:50:02,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 22:50:02,616 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 136 [2022-07-13 22:50:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:02,627 INFO L225 Difference]: With dead ends: 716 [2022-07-13 22:50:02,627 INFO L226 Difference]: Without dead ends: 355 [2022-07-13 22:50:02,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 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-13 22:50:02,635 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:02,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:50:02,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-07-13 22:50:02,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2022-07-13 22:50:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 239 states have (on average 1.2677824267782427) internal successors, (303), 240 states have internal predecessors, (303), 86 states have call successors, (86), 29 states have call predecessors, (86), 29 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-13 22:50:02,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 474 transitions. [2022-07-13 22:50:02,720 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 474 transitions. Word has length 136 [2022-07-13 22:50:02,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:02,721 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 474 transitions. [2022-07-13 22:50:02,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-13 22:50:02,722 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 474 transitions. [2022-07-13 22:50:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 22:50:02,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:02,725 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:02,758 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-13 22:50:02,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-07-13 22:50:02,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:02,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:02,953 INFO L85 PathProgramCache]: Analyzing trace with hash 810580097, now seen corresponding path program 1 times [2022-07-13 22:50:02,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:02,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892299314] [2022-07-13 22:50:02,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:02,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:03,052 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 22:50:03,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [953088756] [2022-07-13 22:50:03,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:03,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:03,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:03,056 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-13 22:50:03,057 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-13 22:50:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:03,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 2859 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 22:50:03,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-07-13 22:50:04,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:50:04,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:04,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892299314] [2022-07-13 22:50:04,088 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 22:50:04,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953088756] [2022-07-13 22:50:04,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953088756] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:04,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:04,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:50:04,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028869550] [2022-07-13 22:50:04,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:04,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:50:04,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:04,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:50:04,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:50:04,095 INFO L87 Difference]: Start difference. First operand 355 states and 474 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-13 22:50:04,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:04,601 INFO L93 Difference]: Finished difference Result 727 states and 982 transitions. [2022-07-13 22:50:04,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:50:04,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 136 [2022-07-13 22:50:04,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:04,607 INFO L225 Difference]: With dead ends: 727 [2022-07-13 22:50:04,607 INFO L226 Difference]: Without dead ends: 419 [2022-07-13 22:50:04,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:50:04,610 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 632 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:04,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1757 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:50:04,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-07-13 22:50:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 357. [2022-07-13 22:50:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 241 states have (on average 1.2655601659751037) internal successors, (305), 242 states have internal predecessors, (305), 86 states have call successors, (86), 29 states have call predecessors, (86), 29 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-13 22:50:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 476 transitions. [2022-07-13 22:50:04,638 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 476 transitions. Word has length 136 [2022-07-13 22:50:04,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:04,639 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 476 transitions. [2022-07-13 22:50:04,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-13 22:50:04,639 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 476 transitions. [2022-07-13 22:50:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 22:50:04,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:04,641 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:04,671 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-13 22:50:04,867 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,SelfDestructingSolverStorable1 [2022-07-13 22:50:04,868 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:04,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:04,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1233281923, now seen corresponding path program 1 times [2022-07-13 22:50:04,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:04,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451556916] [2022-07-13 22:50:04,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:04,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:04,962 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 22:50:04,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [41122707] [2022-07-13 22:50:04,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:04,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:04,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:04,964 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-13 22:50:04,973 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-13 22:50:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:05,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 2852 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 22:50:05,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-13 22:50:05,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:50:05,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:05,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451556916] [2022-07-13 22:50:05,705 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 22:50:05,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41122707] [2022-07-13 22:50:05,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41122707] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:05,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:05,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:50:05,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726523589] [2022-07-13 22:50:05,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:05,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:50:05,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:05,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:50:05,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:50:05,707 INFO L87 Difference]: Start difference. First operand 357 states and 476 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-13 22:50:05,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:05,759 INFO L93 Difference]: Finished difference Result 710 states and 950 transitions. [2022-07-13 22:50:05,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:50:05,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 136 [2022-07-13 22:50:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:05,764 INFO L225 Difference]: With dead ends: 710 [2022-07-13 22:50:05,764 INFO L226 Difference]: Without dead ends: 362 [2022-07-13 22:50:05,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 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-13 22:50:05,766 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 2 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:05,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1876 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:50:05,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-13 22:50:05,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2022-07-13 22:50:05,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 245 states have (on average 1.2612244897959184) internal successors, (309), 246 states have internal predecessors, (309), 86 states have call successors, (86), 29 states have call predecessors, (86), 30 states have return successors, (89), 86 states have call predecessors, (89), 85 states have call successors, (89) [2022-07-13 22:50:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 484 transitions. [2022-07-13 22:50:05,807 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 484 transitions. Word has length 136 [2022-07-13 22:50:05,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:05,807 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 484 transitions. [2022-07-13 22:50:05,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-13 22:50:05,808 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 484 transitions. [2022-07-13 22:50:05,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-13 22:50:05,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:05,817 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:05,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 22:50:06,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:06,044 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:06,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:06,045 INFO L85 PathProgramCache]: Analyzing trace with hash 292227623, now seen corresponding path program 1 times [2022-07-13 22:50:06,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:06,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687381507] [2022-07-13 22:50:06,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:06,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:50:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:50:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:50:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:50:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 22:50:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 22:50:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 22:50:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:06,779 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-13 22:50:06,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:06,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687381507] [2022-07-13 22:50:06,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687381507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:06,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:06,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 22:50:06,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826360408] [2022-07-13 22:50:06,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:06,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 22:50:06,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:06,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 22:50:06,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:50:06,785 INFO L87 Difference]: Start difference. First operand 362 states and 484 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 9 states have internal predecessors, (68), 4 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-13 22:50:10,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:10,662 INFO L93 Difference]: Finished difference Result 761 states and 1022 transitions. [2022-07-13 22:50:10,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 22:50:10,663 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 9 states have internal predecessors, (68), 4 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 142 [2022-07-13 22:50:10,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:10,666 INFO L225 Difference]: With dead ends: 761 [2022-07-13 22:50:10,666 INFO L226 Difference]: Without dead ends: 420 [2022-07-13 22:50:10,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:50:10,668 INFO L413 NwaCegarLoop]: 420 mSDtfsCounter, 319 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 2596 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:10,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 2116 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2596 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-13 22:50:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-07-13 22:50:10,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 367. [2022-07-13 22:50:10,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 249 states have (on average 1.2610441767068272) internal successors, (314), 251 states have internal predecessors, (314), 86 states have call successors, (86), 29 states have call predecessors, (86), 31 states have return successors, (90), 86 states have call predecessors, (90), 85 states have call successors, (90) [2022-07-13 22:50:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 490 transitions. [2022-07-13 22:50:10,691 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 490 transitions. Word has length 142 [2022-07-13 22:50:10,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:10,691 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 490 transitions. [2022-07-13 22:50:10,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 9 states have internal predecessors, (68), 4 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-13 22:50:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 490 transitions. [2022-07-13 22:50:10,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-13 22:50:10,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:10,694 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:10,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 22:50:10,694 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:10,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:10,695 INFO L85 PathProgramCache]: Analyzing trace with hash 319293225, now seen corresponding path program 1 times [2022-07-13 22:50:10,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:10,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48919460] [2022-07-13 22:50:10,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:10,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:10,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:10,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:10,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:10,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:10,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:10,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:10,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:10,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:10,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:10,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:11,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:11,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:11,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:50:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:11,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:50:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:11,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:50:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:11,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:50:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:11,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:11,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:11,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:11,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 22:50:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:11,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 22:50:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:11,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 22:50:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-13 22:50:11,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:11,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48919460] [2022-07-13 22:50:11,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48919460] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:11,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:11,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:50:11,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778138006] [2022-07-13 22:50:11,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:11,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:50:11,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:11,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:50:11,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:50:11,167 INFO L87 Difference]: Start difference. First operand 367 states and 490 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-13 22:50:12,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:12,697 INFO L93 Difference]: Finished difference Result 768 states and 1030 transitions. [2022-07-13 22:50:12,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:50:12,698 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 142 [2022-07-13 22:50:12,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:12,701 INFO L225 Difference]: With dead ends: 768 [2022-07-13 22:50:12,701 INFO L226 Difference]: Without dead ends: 415 [2022-07-13 22:50:12,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:50:12,703 INFO L413 NwaCegarLoop]: 431 mSDtfsCounter, 523 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:12,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1275 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-13 22:50:12,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-07-13 22:50:12,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 365. [2022-07-13 22:50:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 247 states have (on average 1.2550607287449393) internal successors, (310), 249 states have internal predecessors, (310), 86 states have call successors, (86), 29 states have call predecessors, (86), 31 states have return successors, (90), 86 states have call predecessors, (90), 85 states have call successors, (90) [2022-07-13 22:50:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 486 transitions. [2022-07-13 22:50:12,726 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 486 transitions. Word has length 142 [2022-07-13 22:50:12,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:12,726 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 486 transitions. [2022-07-13 22:50:12,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-13 22:50:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 486 transitions. [2022-07-13 22:50:12,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-13 22:50:12,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:12,728 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:12,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 22:50:12,729 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:12,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:12,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1626460037, now seen corresponding path program 1 times [2022-07-13 22:50:12,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:12,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130512509] [2022-07-13 22:50:12,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:12,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:12,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:12,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:12,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:12,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:12,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:12,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:12,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:12,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:12,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:12,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:12,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:12,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:13,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:13,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:50:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:13,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:50:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:13,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:50:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:13,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 22:50:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:13,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:13,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 22:50:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:13,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:13,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 22:50:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:13,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 22:50:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:13,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 22:50:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-13 22:50:13,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:13,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130512509] [2022-07-13 22:50:13,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130512509] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:50:13,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720232814] [2022-07-13 22:50:13,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:13,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:13,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:13,160 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-13 22:50:13,170 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-13 22:50:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:13,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 2880 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 22:50:13,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:14,879 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset)))) (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= (select (select |c_#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) 0)))) is different from true [2022-07-13 22:50:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-13 22:50:21,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:50:21,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720232814] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:21,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:50:21,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-07-13 22:50:21,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104075883] [2022-07-13 22:50:21,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:21,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:50:21,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:21,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:50:21,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=175, Unknown=3, NotChecked=26, Total=240 [2022-07-13 22:50:21,150 INFO L87 Difference]: Start difference. First operand 365 states and 486 transitions. Second operand has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-13 22:50:21,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:21,931 INFO L93 Difference]: Finished difference Result 713 states and 950 transitions. [2022-07-13 22:50:21,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:50:21,937 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 148 [2022-07-13 22:50:21,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:21,939 INFO L225 Difference]: With dead ends: 713 [2022-07-13 22:50:21,940 INFO L226 Difference]: Without dead ends: 367 [2022-07-13 22:50:21,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=51, Invalid=222, Unknown=3, NotChecked=30, Total=306 [2022-07-13 22:50:21,942 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 5 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2504 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 676 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:21,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2504 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 676 Unchecked, 0.7s Time] [2022-07-13 22:50:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-07-13 22:50:21,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2022-07-13 22:50:21,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 249 states have (on average 1.2530120481927711) internal successors, (312), 250 states have internal predecessors, (312), 86 states have call successors, (86), 30 states have call predecessors, (86), 31 states have return successors, (90), 86 states have call predecessors, (90), 85 states have call successors, (90) [2022-07-13 22:50:21,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 488 transitions. [2022-07-13 22:50:21,974 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 488 transitions. Word has length 148 [2022-07-13 22:50:21,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:21,975 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 488 transitions. [2022-07-13 22:50:21,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-13 22:50:21,976 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 488 transitions. [2022-07-13 22:50:21,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-13 22:50:21,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:21,977 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:50:22,005 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-13 22:50:22,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:22,191 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:22,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:22,192 INFO L85 PathProgramCache]: Analyzing trace with hash -510156165, now seen corresponding path program 1 times [2022-07-13 22:50:22,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:22,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293246731] [2022-07-13 22:50:22,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:22,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:50:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:50:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:50:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:50:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 22:50:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 22:50:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:22,696 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-13 22:50:22,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:22,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293246731] [2022-07-13 22:50:22,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293246731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:22,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:22,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:50:22,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842427623] [2022-07-13 22:50:22,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:22,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:50:22,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:22,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:50:22,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:50:22,699 INFO L87 Difference]: Start difference. First operand 367 states and 488 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-13 22:50:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:24,348 INFO L93 Difference]: Finished difference Result 733 states and 982 transitions. [2022-07-13 22:50:24,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:50:24,349 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2022-07-13 22:50:24,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:24,352 INFO L225 Difference]: With dead ends: 733 [2022-07-13 22:50:24,352 INFO L226 Difference]: Without dead ends: 419 [2022-07-13 22:50:24,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:50:24,354 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 433 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:24,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1622 Invalid, 1767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-13 22:50:24,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-07-13 22:50:24,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 369. [2022-07-13 22:50:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 250 states have (on average 1.252) internal successors, (313), 252 states have internal predecessors, (313), 86 states have call successors, (86), 30 states have call predecessors, (86), 32 states have return successors, (95), 86 states have call predecessors, (95), 85 states have call successors, (95) [2022-07-13 22:50:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 494 transitions. [2022-07-13 22:50:24,374 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 494 transitions. Word has length 153 [2022-07-13 22:50:24,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:24,374 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 494 transitions. [2022-07-13 22:50:24,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-13 22:50:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 494 transitions. [2022-07-13 22:50:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-13 22:50:24,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:24,377 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:50:24,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 22:50:24,377 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:24,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:24,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1781778211, now seen corresponding path program 1 times [2022-07-13 22:50:24,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:24,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430450233] [2022-07-13 22:50:24,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:24,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:50:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:50:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:50:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:50:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 22:50:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-13 22:50:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-13 22:50:25,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:25,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430450233] [2022-07-13 22:50:25,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430450233] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:25,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:25,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:50:25,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932743935] [2022-07-13 22:50:25,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:25,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:50:25,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:25,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:50:25,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:50:25,804 INFO L87 Difference]: Start difference. First operand 369 states and 494 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-13 22:50:27,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:27,703 INFO L93 Difference]: Finished difference Result 427 states and 573 transitions. [2022-07-13 22:50:27,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:50:27,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2022-07-13 22:50:27,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:27,707 INFO L225 Difference]: With dead ends: 427 [2022-07-13 22:50:27,707 INFO L226 Difference]: Without dead ends: 425 [2022-07-13 22:50:27,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:50:27,708 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 217 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:27,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1505 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-13 22:50:27,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-07-13 22:50:27,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 373. [2022-07-13 22:50:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 253 states have (on average 1.2490118577075098) internal successors, (316), 255 states have internal predecessors, (316), 86 states have call successors, (86), 31 states have call predecessors, (86), 33 states have return successors, (95), 86 states have call predecessors, (95), 85 states have call successors, (95) [2022-07-13 22:50:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 497 transitions. [2022-07-13 22:50:27,737 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 497 transitions. Word has length 158 [2022-07-13 22:50:27,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:27,737 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 497 transitions. [2022-07-13 22:50:27,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-13 22:50:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 497 transitions. [2022-07-13 22:50:27,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-13 22:50:27,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:27,741 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:50:27,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 22:50:27,741 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:27,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:27,742 INFO L85 PathProgramCache]: Analyzing trace with hash 655304915, now seen corresponding path program 1 times [2022-07-13 22:50:27,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:27,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11434940] [2022-07-13 22:50:27,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:27,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:50:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:50:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:50:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:50:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 22:50:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-13 22:50:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 22:50:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-13 22:50:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:28,399 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-13 22:50:28,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:28,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11434940] [2022-07-13 22:50:28,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11434940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:28,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:28,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:50:28,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536574129] [2022-07-13 22:50:28,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:28,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:50:28,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:28,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:50:28,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:50:28,402 INFO L87 Difference]: Start difference. First operand 373 states and 497 transitions. Second operand has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-13 22:50:30,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:30,367 INFO L93 Difference]: Finished difference Result 433 states and 579 transitions. [2022-07-13 22:50:30,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:50:30,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2022-07-13 22:50:30,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:30,370 INFO L225 Difference]: With dead ends: 433 [2022-07-13 22:50:30,370 INFO L226 Difference]: Without dead ends: 431 [2022-07-13 22:50:30,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:50:30,371 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 325 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:30,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1446 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-13 22:50:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-07-13 22:50:30,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 378. [2022-07-13 22:50:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 256 states have (on average 1.24609375) internal successors, (319), 259 states have internal predecessors, (319), 87 states have call successors, (87), 32 states have call predecessors, (87), 34 states have return successors, (96), 86 states have call predecessors, (96), 86 states have call successors, (96) [2022-07-13 22:50:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 502 transitions. [2022-07-13 22:50:30,391 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 502 transitions. Word has length 171 [2022-07-13 22:50:30,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:30,392 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 502 transitions. [2022-07-13 22:50:30,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-13 22:50:30,392 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 502 transitions. [2022-07-13 22:50:30,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-13 22:50:30,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:30,394 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:50:30,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 22:50:30,394 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:30,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:30,394 INFO L85 PathProgramCache]: Analyzing trace with hash 657151957, now seen corresponding path program 1 times [2022-07-13 22:50:30,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:30,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518364792] [2022-07-13 22:50:30,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:30,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:30,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:30,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:30,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:30,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:50:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:50:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:50:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:50:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 22:50:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-13 22:50:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 22:50:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-13 22:50:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-13 22:50:31,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:31,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518364792] [2022-07-13 22:50:31,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518364792] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:31,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:31,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:50:31,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279753812] [2022-07-13 22:50:31,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:31,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:50:31,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:31,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:50:31,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:50:31,189 INFO L87 Difference]: Start difference. First operand 378 states and 502 transitions. Second operand has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-13 22:50:32,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:32,754 INFO L93 Difference]: Finished difference Result 436 states and 581 transitions. [2022-07-13 22:50:32,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:50:32,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2022-07-13 22:50:32,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:32,757 INFO L225 Difference]: With dead ends: 436 [2022-07-13 22:50:32,757 INFO L226 Difference]: Without dead ends: 434 [2022-07-13 22:50:32,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:50:32,758 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 438 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:32,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1419 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-13 22:50:32,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-07-13 22:50:32,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 377. [2022-07-13 22:50:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 256 states have (on average 1.24609375) internal successors, (319), 258 states have internal predecessors, (319), 86 states have call successors, (86), 32 states have call predecessors, (86), 34 states have return successors, (95), 86 states have call predecessors, (95), 85 states have call successors, (95) [2022-07-13 22:50:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 500 transitions. [2022-07-13 22:50:32,795 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 500 transitions. Word has length 171 [2022-07-13 22:50:32,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:32,796 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 500 transitions. [2022-07-13 22:50:32,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-13 22:50:32,796 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 500 transitions. [2022-07-13 22:50:32,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-13 22:50:32,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:32,799 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:50:32,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 22:50:32,799 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:32,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:32,799 INFO L85 PathProgramCache]: Analyzing trace with hash 220397050, now seen corresponding path program 1 times [2022-07-13 22:50:32,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:32,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331848027] [2022-07-13 22:50:32,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:32,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:50:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:50:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:50:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:50:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 22:50:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:50:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 22:50:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-13 22:50:33,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:33,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331848027] [2022-07-13 22:50:33,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331848027] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:33,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:33,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 22:50:33,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017388991] [2022-07-13 22:50:33,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:33,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:50:33,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:33,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:50:33,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:50:33,278 INFO L87 Difference]: Start difference. First operand 377 states and 500 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-13 22:50:36,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:36,963 INFO L93 Difference]: Finished difference Result 815 states and 1116 transitions. [2022-07-13 22:50:36,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 22:50:36,964 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 177 [2022-07-13 22:50:36,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:36,967 INFO L225 Difference]: With dead ends: 815 [2022-07-13 22:50:36,967 INFO L226 Difference]: Without dead ends: 515 [2022-07-13 22:50:36,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:50:36,969 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 999 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 701 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 2057 SdHoareTripleChecker+Invalid, 2743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 701 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:36,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 2057 Invalid, 2743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [701 Valid, 2042 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-13 22:50:36,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-07-13 22:50:36,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 381. [2022-07-13 22:50:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 259 states have (on average 1.2432432432432432) internal successors, (322), 261 states have internal predecessors, (322), 87 states have call successors, (87), 32 states have call predecessors, (87), 34 states have return successors, (96), 87 states have call predecessors, (96), 86 states have call successors, (96) [2022-07-13 22:50:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 505 transitions. [2022-07-13 22:50:36,992 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 505 transitions. Word has length 177 [2022-07-13 22:50:36,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:36,992 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 505 transitions. [2022-07-13 22:50:36,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-13 22:50:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 505 transitions. [2022-07-13 22:50:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-13 22:50:36,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:36,995 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:50:36,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 22:50:36,995 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:36,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:36,996 INFO L85 PathProgramCache]: Analyzing trace with hash -597251400, now seen corresponding path program 1 times [2022-07-13 22:50:36,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:36,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217996995] [2022-07-13 22:50:36,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:36,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:50:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:50:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:50:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:50:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 22:50:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:50:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 22:50:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:37,573 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-13 22:50:37,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:37,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217996995] [2022-07-13 22:50:37,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217996995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:37,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:37,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:50:37,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346659272] [2022-07-13 22:50:37,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:37,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:50:37,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:37,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:50:37,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:50:37,577 INFO L87 Difference]: Start difference. First operand 381 states and 505 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-13 22:50:40,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:40,820 INFO L93 Difference]: Finished difference Result 570 states and 782 transitions. [2022-07-13 22:50:40,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:50:40,821 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2022-07-13 22:50:40,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:40,824 INFO L225 Difference]: With dead ends: 570 [2022-07-13 22:50:40,824 INFO L226 Difference]: Without dead ends: 513 [2022-07-13 22:50:40,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:50:40,825 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 415 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:40,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1968 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-13 22:50:40,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-07-13 22:50:40,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 385. [2022-07-13 22:50:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 262 states have (on average 1.2404580152671756) internal successors, (325), 264 states have internal predecessors, (325), 87 states have call successors, (87), 32 states have call predecessors, (87), 35 states have return successors, (97), 88 states have call predecessors, (97), 86 states have call successors, (97) [2022-07-13 22:50:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 509 transitions. [2022-07-13 22:50:40,846 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 509 transitions. Word has length 177 [2022-07-13 22:50:40,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:40,847 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 509 transitions. [2022-07-13 22:50:40,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-13 22:50:40,847 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 509 transitions. [2022-07-13 22:50:40,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-13 22:50:40,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:40,849 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:50:40,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 22:50:40,850 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:40,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:40,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1081589820, now seen corresponding path program 1 times [2022-07-13 22:50:40,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:40,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58667793] [2022-07-13 22:50:40,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:40,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:50:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:50:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:50:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:50:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 22:50:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:50:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 22:50:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-13 22:50:41,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:41,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58667793] [2022-07-13 22:50:41,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58667793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:41,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:41,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:50:41,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145005823] [2022-07-13 22:50:41,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:41,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:50:41,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:41,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:50:41,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:50:41,348 INFO L87 Difference]: Start difference. First operand 385 states and 509 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-13 22:50:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:43,595 INFO L93 Difference]: Finished difference Result 691 states and 922 transitions. [2022-07-13 22:50:43,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:50:43,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) Word has length 179 [2022-07-13 22:50:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:43,598 INFO L225 Difference]: With dead ends: 691 [2022-07-13 22:50:43,598 INFO L226 Difference]: Without dead ends: 462 [2022-07-13 22:50:43,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:50:43,600 INFO L413 NwaCegarLoop]: 455 mSDtfsCounter, 472 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:43,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1128 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 22:50:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-07-13 22:50:43,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 386. [2022-07-13 22:50:43,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 263 states have (on average 1.2395437262357414) internal successors, (326), 265 states have internal predecessors, (326), 87 states have call successors, (87), 32 states have call predecessors, (87), 35 states have return successors, (97), 88 states have call predecessors, (97), 86 states have call successors, (97) [2022-07-13 22:50:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 510 transitions. [2022-07-13 22:50:43,622 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 510 transitions. Word has length 179 [2022-07-13 22:50:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:43,622 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 510 transitions. [2022-07-13 22:50:43,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-13 22:50:43,623 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 510 transitions. [2022-07-13 22:50:43,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-13 22:50:43,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:43,624 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:50:43,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 22:50:43,625 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:43,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:43,625 INFO L85 PathProgramCache]: Analyzing trace with hash -517004810, now seen corresponding path program 1 times [2022-07-13 22:50:43,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:43,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811294772] [2022-07-13 22:50:43,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:43,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:43,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:50:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:50:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:50:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:50:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 22:50:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:50:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-13 22:50:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-13 22:50:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:44,231 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-07-13 22:50:44,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:44,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811294772] [2022-07-13 22:50:44,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811294772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:44,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:44,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 22:50:44,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501350025] [2022-07-13 22:50:44,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:44,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 22:50:44,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:44,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 22:50:44,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:50:44,234 INFO L87 Difference]: Start difference. First operand 386 states and 510 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 8 states have internal predecessors, (84), 6 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-13 22:50:46,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:46,839 INFO L93 Difference]: Finished difference Result 839 states and 1140 transitions. [2022-07-13 22:50:46,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 22:50:46,840 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 8 states have internal predecessors, (84), 6 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) Word has length 186 [2022-07-13 22:50:46,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:46,843 INFO L225 Difference]: With dead ends: 839 [2022-07-13 22:50:46,843 INFO L226 Difference]: Without dead ends: 546 [2022-07-13 22:50:46,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2022-07-13 22:50:46,845 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 531 mSDsluCounter, 2800 mSDsCounter, 0 mSdLazyCounter, 2974 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 3282 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 2974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:46,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 3282 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 2974 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-13 22:50:46,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-07-13 22:50:46,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 435. [2022-07-13 22:50:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 299 states have (on average 1.2508361204013378) internal successors, (374), 302 states have internal predecessors, (374), 95 states have call successors, (95), 35 states have call predecessors, (95), 40 states have return successors, (110), 97 states have call predecessors, (110), 94 states have call successors, (110) [2022-07-13 22:50:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 579 transitions. [2022-07-13 22:50:46,871 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 579 transitions. Word has length 186 [2022-07-13 22:50:46,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:46,871 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 579 transitions. [2022-07-13 22:50:46,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 8 states have internal predecessors, (84), 6 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-13 22:50:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 579 transitions. [2022-07-13 22:50:46,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-13 22:50:46,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:46,873 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:50:46,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 22:50:46,873 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:46,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:46,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1223849872, now seen corresponding path program 1 times [2022-07-13 22:50:46,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:46,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600173740] [2022-07-13 22:50:46,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:46,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:50:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:50:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:50:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:50:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 22:50:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:50:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 22:50:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-13 22:50:47,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:47,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600173740] [2022-07-13 22:50:47,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600173740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:47,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:47,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 22:50:47,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196688481] [2022-07-13 22:50:47,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:47,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:50:47,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:47,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:50:47,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:50:47,399 INFO L87 Difference]: Start difference. First operand 435 states and 579 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-13 22:50:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:52,167 INFO L93 Difference]: Finished difference Result 636 states and 870 transitions. [2022-07-13 22:50:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 22:50:52,168 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) Word has length 183 [2022-07-13 22:50:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:52,171 INFO L225 Difference]: With dead ends: 636 [2022-07-13 22:50:52,171 INFO L226 Difference]: Without dead ends: 579 [2022-07-13 22:50:52,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:50:52,172 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 314 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 2346 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 2498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 2346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:52,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 2738 Invalid, 2498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 2346 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-13 22:50:52,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-07-13 22:50:52,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 443. [2022-07-13 22:50:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 307 states have (on average 1.250814332247557) internal successors, (384), 310 states have internal predecessors, (384), 95 states have call successors, (95), 35 states have call predecessors, (95), 40 states have return successors, (110), 97 states have call predecessors, (110), 94 states have call successors, (110) [2022-07-13 22:50:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 589 transitions. [2022-07-13 22:50:52,196 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 589 transitions. Word has length 183 [2022-07-13 22:50:52,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:52,196 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 589 transitions. [2022-07-13 22:50:52,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-13 22:50:52,197 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 589 transitions. [2022-07-13 22:50:52,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-13 22:50:52,198 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:52,198 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:50:52,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 22:50:52,199 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:52,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:52,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1686982824, now seen corresponding path program 1 times [2022-07-13 22:50:52,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:52,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268191211] [2022-07-13 22:50:52,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:52,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:50:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:50:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:50:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:50:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 22:50:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:50:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 22:50:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-13 22:50:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:52,633 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-13 22:50:52,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:52,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268191211] [2022-07-13 22:50:52,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268191211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:50:52,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:50:52,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:50:52,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284816829] [2022-07-13 22:50:52,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:50:52,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:50:52,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:52,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:50:52,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:50:52,636 INFO L87 Difference]: Start difference. First operand 443 states and 589 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2022-07-13 22:50:56,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:50:56,382 INFO L93 Difference]: Finished difference Result 578 states and 774 transitions. [2022-07-13 22:50:56,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:50:56,382 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2022-07-13 22:50:56,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:50:56,384 INFO L225 Difference]: With dead ends: 578 [2022-07-13 22:50:56,385 INFO L226 Difference]: Without dead ends: 523 [2022-07-13 22:50:56,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:50:56,385 INFO L413 NwaCegarLoop]: 453 mSDtfsCounter, 589 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:50:56,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1624 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 1384 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-13 22:50:56,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-07-13 22:50:56,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 448. [2022-07-13 22:50:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 311 states have (on average 1.247588424437299) internal successors, (388), 314 states have internal predecessors, (388), 95 states have call successors, (95), 35 states have call predecessors, (95), 41 states have return successors, (112), 98 states have call predecessors, (112), 94 states have call successors, (112) [2022-07-13 22:50:56,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 595 transitions. [2022-07-13 22:50:56,410 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 595 transitions. Word has length 187 [2022-07-13 22:50:56,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:50:56,410 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 595 transitions. [2022-07-13 22:50:56,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2022-07-13 22:50:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 595 transitions. [2022-07-13 22:50:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-13 22:50:56,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:50:56,412 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:50:56,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 22:50:56,413 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:50:56,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:50:56,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1674366495, now seen corresponding path program 1 times [2022-07-13 22:50:56,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:50:56,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217215439] [2022-07-13 22:50:56,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:56,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:50:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:50:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:50:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:50:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:50:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:50:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:50:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:50:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:50:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:50:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:50:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:50:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:50:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:50:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:50:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:50:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:50:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:50:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 22:50:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:56,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:50:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:57,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:50:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:57,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:50:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:57,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-13 22:50:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:57,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-13 22:50:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:57,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-13 22:50:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:57,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-13 22:50:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:57,197 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2022-07-13 22:50:57,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:50:57,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217215439] [2022-07-13 22:50:57,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217215439] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:50:57,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466298735] [2022-07-13 22:50:57,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:50:57,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:50:57,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:50:57,199 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-13 22:50:57,204 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-13 22:50:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:50:58,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 3138 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-13 22:50:58,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:50:58,052 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 7 treesize of output 3 [2022-07-13 22:50:58,055 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 7 treesize of output 3 [2022-07-13 22:50:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-07-13 22:50:58,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:50:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-07-13 22:50:58,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466298735] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:50:58,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:50:58,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 19 [2022-07-13 22:50:58,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125666055] [2022-07-13 22:50:58,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:50:58,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 22:50:58,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:50:58,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 22:50:58,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:50:58,613 INFO L87 Difference]: Start difference. First operand 448 states and 595 transitions. Second operand has 19 states, 16 states have (on average 6.875) internal successors, (110), 14 states have internal predecessors, (110), 10 states have call successors, (43), 7 states have call predecessors, (43), 5 states have return successors, (35), 6 states have call predecessors, (35), 8 states have call successors, (35) [2022-07-13 22:51:01,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:51:01,954 INFO L93 Difference]: Finished difference Result 891 states and 1202 transitions. [2022-07-13 22:51:01,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 22:51:01,955 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.875) internal successors, (110), 14 states have internal predecessors, (110), 10 states have call successors, (43), 7 states have call predecessors, (43), 5 states have return successors, (35), 6 states have call predecessors, (35), 8 states have call successors, (35) Word has length 190 [2022-07-13 22:51:01,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:51:01,958 INFO L225 Difference]: With dead ends: 891 [2022-07-13 22:51:01,958 INFO L226 Difference]: Without dead ends: 548 [2022-07-13 22:51:01,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 428 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2022-07-13 22:51:01,959 INFO L413 NwaCegarLoop]: 446 mSDtfsCounter, 599 mSDsluCounter, 3074 mSDsCounter, 0 mSdLazyCounter, 3918 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 3520 SdHoareTripleChecker+Invalid, 4380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 3918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:51:01,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 3520 Invalid, 4380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 3918 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-13 22:51:01,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-13 22:51:01,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 464. [2022-07-13 22:51:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 318 states have (on average 1.2421383647798743) internal successors, (395), 321 states have internal predecessors, (395), 103 states have call successors, (103), 36 states have call predecessors, (103), 42 states have return successors, (118), 106 states have call predecessors, (118), 102 states have call successors, (118) [2022-07-13 22:51:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 616 transitions. [2022-07-13 22:51:01,989 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 616 transitions. Word has length 190 [2022-07-13 22:51:01,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:51:01,990 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 616 transitions. [2022-07-13 22:51:01,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.875) internal successors, (110), 14 states have internal predecessors, (110), 10 states have call successors, (43), 7 states have call predecessors, (43), 5 states have return successors, (35), 6 states have call predecessors, (35), 8 states have call successors, (35) [2022-07-13 22:51:01,990 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 616 transitions. [2022-07-13 22:51:01,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-13 22:51:01,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:01,992 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:51:02,023 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-13 22:51:02,211 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,SelfDestructingSolverStorable16 [2022-07-13 22:51:02,211 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:02,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:02,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1404350850, now seen corresponding path program 1 times [2022-07-13 22:51:02,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:02,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955801735] [2022-07-13 22:51:02,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:02,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:51:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:51:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:51:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:51:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:51:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:51:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:51:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:51:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:51:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:51:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:51:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:51:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:51:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:51:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:51:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:51:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:51:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:51:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:51:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:51:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:51:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:51:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 22:51:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:51:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:51:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:51:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-13 22:51:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 22:51:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:02,643 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-07-13 22:51:02,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:02,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955801735] [2022-07-13 22:51:02,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955801735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:51:02,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:51:02,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:51:02,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289462765] [2022-07-13 22:51:02,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:51:02,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:51:02,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:02,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:51:02,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:51:02,646 INFO L87 Difference]: Start difference. First operand 464 states and 616 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (32), 5 states have call predecessors, (32), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-13 22:51:04,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:51:04,121 INFO L93 Difference]: Finished difference Result 953 states and 1292 transitions. [2022-07-13 22:51:04,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:51:04,121 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (32), 5 states have call predecessors, (32), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 190 [2022-07-13 22:51:04,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:51:04,125 INFO L225 Difference]: With dead ends: 953 [2022-07-13 22:51:04,125 INFO L226 Difference]: Without dead ends: 576 [2022-07-13 22:51:04,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:51:04,127 INFO L413 NwaCegarLoop]: 483 mSDtfsCounter, 525 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:51:04,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1474 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-13 22:51:04,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-07-13 22:51:04,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 458. [2022-07-13 22:51:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 313 states have (on average 1.2396166134185302) internal successors, (388), 317 states have internal predecessors, (388), 102 states have call successors, (102), 36 states have call predecessors, (102), 42 states have return successors, (116), 104 states have call predecessors, (116), 101 states have call successors, (116) [2022-07-13 22:51:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 606 transitions. [2022-07-13 22:51:04,159 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 606 transitions. Word has length 190 [2022-07-13 22:51:04,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:51:04,160 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 606 transitions. [2022-07-13 22:51:04,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (32), 5 states have call predecessors, (32), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-13 22:51:04,160 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 606 transitions. [2022-07-13 22:51:04,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-13 22:51:04,161 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:04,162 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:51:04,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 22:51:04,162 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:04,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:04,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1563869444, now seen corresponding path program 1 times [2022-07-13 22:51:04,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:04,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799338582] [2022-07-13 22:51:04,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:04,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:51:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:51:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:51:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:51:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:51:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:51:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:51:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:51:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:51:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:51:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:51:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:51:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:51:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:51:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:51:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:51:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:51:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:51:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:51:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:51:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:51:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:51:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 22:51:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:51:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:51:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:51:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-13 22:51:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 22:51:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-07-13 22:51:04,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:04,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799338582] [2022-07-13 22:51:04,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799338582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:51:04,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:51:04,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-13 22:51:04,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925136139] [2022-07-13 22:51:04,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:51:04,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 22:51:04,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:04,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 22:51:04,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:51:04,804 INFO L87 Difference]: Start difference. First operand 458 states and 606 transitions. Second operand has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 9 states have internal predecessors, (88), 6 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-13 22:51:07,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:51:07,760 INFO L93 Difference]: Finished difference Result 900 states and 1217 transitions. [2022-07-13 22:51:07,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 22:51:07,762 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 9 states have internal predecessors, (88), 6 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) Word has length 190 [2022-07-13 22:51:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:51:07,765 INFO L225 Difference]: With dead ends: 900 [2022-07-13 22:51:07,765 INFO L226 Difference]: Without dead ends: 593 [2022-07-13 22:51:07,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2022-07-13 22:51:07,767 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 689 mSDsluCounter, 2943 mSDsCounter, 0 mSdLazyCounter, 3255 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 3410 SdHoareTripleChecker+Invalid, 3716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 3255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:51:07,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 3410 Invalid, 3716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 3255 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-13 22:51:07,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-07-13 22:51:07,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 479. [2022-07-13 22:51:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 324 states have (on average 1.2345679012345678) internal successors, (400), 328 states have internal predecessors, (400), 110 states have call successors, (110), 38 states have call predecessors, (110), 44 states have return successors, (126), 112 states have call predecessors, (126), 109 states have call successors, (126) [2022-07-13 22:51:07,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 636 transitions. [2022-07-13 22:51:07,797 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 636 transitions. Word has length 190 [2022-07-13 22:51:07,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:51:07,797 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 636 transitions. [2022-07-13 22:51:07,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 9 states have internal predecessors, (88), 6 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-13 22:51:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 636 transitions. [2022-07-13 22:51:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-07-13 22:51:07,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:07,799 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:51:07,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 22:51:07,800 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:07,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:07,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1811820170, now seen corresponding path program 1 times [2022-07-13 22:51:07,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:07,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390107077] [2022-07-13 22:51:07,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:07,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:07,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:51:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:07,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:51:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:07,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:51:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:07,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:51:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:07,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:51:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:51:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:51:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:51:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:51:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:51:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:51:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:51:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:51:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:51:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:51:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:51:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:51:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:51:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:51:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:51:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:51:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:51:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 22:51:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:51:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:51:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:51:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 22:51:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-13 22:51:08,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:08,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390107077] [2022-07-13 22:51:08,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390107077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:51:08,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:51:08,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:51:08,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438873203] [2022-07-13 22:51:08,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:51:08,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:51:08,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:08,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:51:08,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:51:08,200 INFO L87 Difference]: Start difference. First operand 479 states and 636 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-13 22:51:10,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:51:10,431 INFO L93 Difference]: Finished difference Result 798 states and 1064 transitions. [2022-07-13 22:51:10,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:51:10,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) Word has length 185 [2022-07-13 22:51:10,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:51:10,434 INFO L225 Difference]: With dead ends: 798 [2022-07-13 22:51:10,434 INFO L226 Difference]: Without dead ends: 556 [2022-07-13 22:51:10,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:51:10,436 INFO L413 NwaCegarLoop]: 456 mSDtfsCounter, 359 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:51:10,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1120 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 22:51:10,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-07-13 22:51:10,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 481. [2022-07-13 22:51:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 326 states have (on average 1.2331288343558282) internal successors, (402), 330 states have internal predecessors, (402), 110 states have call successors, (110), 38 states have call predecessors, (110), 44 states have return successors, (126), 112 states have call predecessors, (126), 109 states have call successors, (126) [2022-07-13 22:51:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 638 transitions. [2022-07-13 22:51:10,466 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 638 transitions. Word has length 185 [2022-07-13 22:51:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:51:10,466 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 638 transitions. [2022-07-13 22:51:10,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-13 22:51:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 638 transitions. [2022-07-13 22:51:10,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-13 22:51:10,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:10,468 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:51:10,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 22:51:10,468 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:10,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:10,469 INFO L85 PathProgramCache]: Analyzing trace with hash -103866992, now seen corresponding path program 1 times [2022-07-13 22:51:10,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:10,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703379652] [2022-07-13 22:51:10,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:10,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:51:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:51:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:51:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:51:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:51:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:51:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:51:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:51:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:51:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:51:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:51:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:51:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:51:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:51:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:51:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:51:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:51:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:51:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:51:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 22:51:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:51:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:51:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 22:51:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:51:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:51:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:51:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 22:51:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:11,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-13 22:51:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:12,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:51:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:12,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:51:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-13 22:51:12,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:12,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703379652] [2022-07-13 22:51:12,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703379652] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:51:12,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311630461] [2022-07-13 22:51:12,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:12,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:51:12,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:51:12,014 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-13 22:51:12,015 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-13 22:51:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:12,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 3219 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-13 22:51:12,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:51:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-13 22:51:13,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:51:13,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311630461] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:51:13,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:51:13,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 13 [2022-07-13 22:51:13,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721563118] [2022-07-13 22:51:13,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:51:13,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:51:13,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:51:13,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:51:13,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:51:13,099 INFO L87 Difference]: Start difference. First operand 481 states and 638 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2022-07-13 22:51:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:51:13,375 INFO L93 Difference]: Finished difference Result 955 states and 1265 transitions. [2022-07-13 22:51:13,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:51:13,375 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) Word has length 193 [2022-07-13 22:51:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:51:13,378 INFO L225 Difference]: With dead ends: 955 [2022-07-13 22:51:13,378 INFO L226 Difference]: Without dead ends: 483 [2022-07-13 22:51:13,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:51:13,380 INFO L413 NwaCegarLoop]: 439 mSDtfsCounter, 91 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 2443 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:51:13,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 2443 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:51:13,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-07-13 22:51:13,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2022-07-13 22:51:13,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 327 states have (on average 1.2324159021406729) internal successors, (403), 332 states have internal predecessors, (403), 110 states have call successors, (110), 38 states have call predecessors, (110), 45 states have return successors, (127), 112 states have call predecessors, (127), 109 states have call successors, (127) [2022-07-13 22:51:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 640 transitions. [2022-07-13 22:51:13,408 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 640 transitions. Word has length 193 [2022-07-13 22:51:13,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:51:13,409 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 640 transitions. [2022-07-13 22:51:13,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2022-07-13 22:51:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 640 transitions. [2022-07-13 22:51:13,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-13 22:51:13,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:51:13,411 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:51:13,452 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-13 22:51:13,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:51:13,636 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:51:13,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:51:13,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2131388023, now seen corresponding path program 1 times [2022-07-13 22:51:13,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:51:13,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053517734] [2022-07-13 22:51:13,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:13,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:51:13,713 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 22:51:13,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1324837172] [2022-07-13 22:51:13,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:51:13,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:51:13,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:51:13,715 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-13 22:51:13,716 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-13 22:51:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:51:14,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 3324 conjuncts, 292 conjunts are in the unsatisfiable core [2022-07-13 22:51:14,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:51:14,968 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-13 22:51:15,203 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 22:51:15,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-13 22:51:15,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 22:51:15,607 INFO L356 Elim1Store]: treesize reduction 112, result has 28.7 percent of original size [2022-07-13 22:51:15,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 88 treesize of output 114 [2022-07-13 22:51:15,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 22:51:15,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:51:15,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-13 22:51:15,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 22:51:15,979 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-13 22:51:15,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:51:15,995 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-13 22:51:15,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2022-07-13 22:51:16,598 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 22:51:16,598 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-13 22:51:16,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:51:16,604 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 18 treesize of output 20 [2022-07-13 22:51:16,985 INFO L356 Elim1Store]: treesize reduction 102, result has 17.1 percent of original size [2022-07-13 22:51:16,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:51:16,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053517734] [2022-07-13 22:51:16,986 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 22:51:16,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324837172] [2022-07-13 22:51:16,986 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 22:51:17,024 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-13 22:51:17,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:51:17,188 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_184| input size 111 context size 111 output size 111 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 22:51:17,190 INFO L158 Benchmark]: Toolchain (without parser) took 80575.88ms. Allocated memory was 121.6MB in the beginning and 612.4MB in the end (delta: 490.7MB). Free memory was 94.3MB in the beginning and 400.5MB in the end (delta: -306.3MB). Peak memory consumption was 184.1MB. Max. memory is 16.1GB. [2022-07-13 22:51:17,190 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory is still 44.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 22:51:17,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2299.18ms. Allocated memory was 121.6MB in the beginning and 176.2MB in the end (delta: 54.5MB). Free memory was 93.9MB in the beginning and 75.2MB in the end (delta: 18.7MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. [2022-07-13 22:51:17,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 198.52ms. Allocated memory is still 176.2MB. Free memory was 75.2MB in the beginning and 110.1MB in the end (delta: -34.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 22:51:17,191 INFO L158 Benchmark]: Boogie Preprocessor took 106.81ms. Allocated memory is still 176.2MB. Free memory was 110.1MB in the beginning and 98.5MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 22:51:17,191 INFO L158 Benchmark]: RCFGBuilder took 1882.14ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 98.5MB in the beginning and 149.1MB in the end (delta: -50.5MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2022-07-13 22:51:17,191 INFO L158 Benchmark]: TraceAbstraction took 76083.76ms. Allocated memory was 226.5MB in the beginning and 612.4MB in the end (delta: 385.9MB). Free memory was 148.0MB in the beginning and 400.5MB in the end (delta: -252.5MB). Peak memory consumption was 132.3MB. Max. memory is 16.1GB. [2022-07-13 22:51:17,193 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory is still 44.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2299.18ms. Allocated memory was 121.6MB in the beginning and 176.2MB in the end (delta: 54.5MB). Free memory was 93.9MB in the beginning and 75.2MB in the end (delta: 18.7MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 198.52ms. Allocated memory is still 176.2MB. Free memory was 75.2MB in the beginning and 110.1MB in the end (delta: -34.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.81ms. Allocated memory is still 176.2MB. Free memory was 110.1MB in the beginning and 98.5MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1882.14ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 98.5MB in the beginning and 149.1MB in the end (delta: -50.5MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. * TraceAbstraction took 76083.76ms. Allocated memory was 226.5MB in the beginning and 612.4MB in the end (delta: 385.9MB). Free memory was 148.0MB in the beginning and 400.5MB in the end (delta: -252.5MB). Peak memory consumption was 132.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_184| input size 111 context size 111 output size 111 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_184| input size 111 context size 111 output size 111: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 22:51:17,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_hash_table_put_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 7e3410638a547f2efce35a13c7d23c64ee660b1c493ec273ce9d4043edc218c3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:51:19,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:51:19,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:51:19,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:51:19,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:51:19,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:51:19,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:51:19,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:51:19,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:51:19,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:51:19,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:51:19,126 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:51:19,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:51:19,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:51:19,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:51:19,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:51:19,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:51:19,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:51:19,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:51:19,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:51:19,149 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:51:19,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:51:19,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:51:19,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:51:19,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:51:19,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:51:19,160 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:51:19,160 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:51:19,161 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:51:19,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:51:19,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:51:19,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:51:19,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:51:19,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:51:19,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:51:19,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:51:19,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:51:19,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:51:19,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:51:19,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:51:19,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:51:19,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:51:19,174 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-13 22:51:19,211 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:51:19,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:51:19,212 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:51:19,212 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:51:19,213 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:51:19,213 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:51:19,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:51:19,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:51:19,214 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:51:19,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:51:19,215 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:51:19,215 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:51:19,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:51:19,215 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:51:19,216 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 22:51:19,216 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 22:51:19,216 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 22:51:19,216 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:51:19,216 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:51:19,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:51:19,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:51:19,217 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:51:19,217 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:51:19,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:51:19,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:51:19,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:51:19,218 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:51:19,218 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 22:51:19,218 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 22:51:19,219 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:51:19,219 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:51:19,219 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:51:19,219 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 22:51:19,220 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 7e3410638a547f2efce35a13c7d23c64ee660b1c493ec273ce9d4043edc218c3 [2022-07-13 22:51:19,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:51:19,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:51:19,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:51:19,553 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:51:19,553 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:51:19,555 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i [2022-07-13 22:51:19,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37d5ee6e/27dca194e92848f5b48fd5450025893b/FLAG3f5b67170 [2022-07-13 22:51:20,317 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:51:20,318 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i [2022-07-13 22:51:20,362 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37d5ee6e/27dca194e92848f5b48fd5450025893b/FLAG3f5b67170 [2022-07-13 22:51:20,586 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37d5ee6e/27dca194e92848f5b48fd5450025893b [2022-07-13 22:51:20,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:51:20,594 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:51:20,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:51:20,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:51:20,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:51:20,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:51:20" (1/1) ... [2022-07-13 22:51:20,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a24a209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:51:20, skipping insertion in model container [2022-07-13 22:51:20,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:51:20" (1/1) ... [2022-07-13 22:51:20,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:51:20,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:51:20,983 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_hash_table_put_harness.i[4492,4505] [2022-07-13 22:51:20,989 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_hash_table_put_harness.i[4552,4565] [2022-07-13 22:51:21,796 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:21,797 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:21,797 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:21,797 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:21,798 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:21,815 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:21,816 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:21,818 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:21,820 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:21,823 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:21,824 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:21,825 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:21,825 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:51:22,104 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:51:22,105 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:51:22,106 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:51:22,106 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:51:22,107 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:51:22,108 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:51:22,108 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:51:22,109 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:51:22,110 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:51:22,110 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:51:22,259 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:51:22,288 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.ArithmeticException: BigInteger out of int range at java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.checkIfNecessaryMemoryModelAdaption(CHandler.java:1009) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.result.ExpressionResultTransformer.transformDispatchDecaySwitchRexBoolToInt(ExpressionResultTransformer.java:177) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallGivenNameAndArguments(FunctionHandler.java:675) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallExpression(FunctionHandler.java:509) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1454) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1397) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 22:51:22,295 INFO L158 Benchmark]: Toolchain (without parser) took 1699.94ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 38.8MB in the beginning and 45.3MB in the end (delta: -6.5MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2022-07-13 22:51:22,296 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 48.2MB. Free memory was 30.5MB in the beginning and 30.4MB in the end (delta: 32.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 22:51:22,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1698.42ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 38.6MB in the beginning and 45.3MB in the end (delta: -6.7MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2022-07-13 22:51:22,299 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 48.2MB. Free memory was 30.5MB in the beginning and 30.4MB in the end (delta: 32.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1698.42ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 38.6MB in the beginning and 45.3MB in the end (delta: -6.7MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: ArithmeticException: BigInteger out of int range: java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range