./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_priority_queue_remove_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 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_priority_queue_remove_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 1ebada516f0ccae5e55b91f6e0fe5802f70171054dc79c047f46877ad506c65e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 21:41:06,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 21:41:06,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 21:41:06,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 21:41:06,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 21:41:06,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 21:41:06,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 21:41:06,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 21:41:06,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 21:41:06,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 21:41:06,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 21:41:06,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 21:41:06,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 21:41:06,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 21:41:06,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 21:41:06,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 21:41:06,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 21:41:06,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 21:41:06,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 21:41:06,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 21:41:06,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 21:41:06,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 21:41:06,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 21:41:06,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 21:41:06,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 21:41:06,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 21:41:06,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 21:41:06,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 21:41:06,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 21:41:06,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 21:41:06,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 21:41:06,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 21:41:06,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 21:41:06,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 21:41:06,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 21:41:06,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 21:41:06,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 21:41:06,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 21:41:06,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 21:41:06,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 21:41:06,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 21:41:06,445 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-16 21:41:06,466 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 21:41:06,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 21:41:06,467 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 21:41:06,467 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 21:41:06,467 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 21:41:06,468 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 21:41:06,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 21:41:06,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 21:41:06,468 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 21:41:06,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 21:41:06,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-16 21:41:06,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 21:41:06,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 21:41:06,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 21:41:06,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 21:41:06,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 21:41:06,470 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 21:41:06,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 21:41:06,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 21:41:06,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 21:41:06,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 21:41:06,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:41:06,471 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 21:41:06,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 21:41:06,471 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 21:41:06,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-16 21:41:06,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-16 21:41:06,472 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 21:41:06,473 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 21:41:06,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 21:41:06,473 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 21:41:06,473 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 -> 1ebada516f0ccae5e55b91f6e0fe5802f70171054dc79c047f46877ad506c65e [2021-11-16 21:41:06,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 21:41:06,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 21:41:06,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 21:41:06,661 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 21:41:06,662 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 21:41:06,662 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_priority_queue_remove_harness.i [2021-11-16 21:41:06,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b531a70/fea8004357104705a20cbae381df4c1a/FLAGfc7c6b87e [2021-11-16 21:41:07,387 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 21:41:07,388 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_remove_harness.i [2021-11-16 21:41:07,411 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b531a70/fea8004357104705a20cbae381df4c1a/FLAGfc7c6b87e [2021-11-16 21:41:07,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b531a70/fea8004357104705a20cbae381df4c1a [2021-11-16 21:41:07,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 21:41:07,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 21:41:07,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 21:41:07,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 21:41:07,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 21:41:07,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:41:07" (1/1) ... [2021-11-16 21:41:07,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4959ab29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:07, skipping insertion in model container [2021-11-16 21:41:07,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:41:07" (1/1) ... [2021-11-16 21:41:07,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 21:41:07,623 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 21:41:07,790 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_priority_queue_remove_harness.i[4499,4512] [2021-11-16 21:41:07,794 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_priority_queue_remove_harness.i[4559,4572] [2021-11-16 21:41:07,808 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:41:07,817 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:41:08,255 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,261 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,261 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,261 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,263 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,274 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,274 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,275 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,290 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,292 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,292 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,293 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,293 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,466 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:41:08,467 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:41:08,468 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:41:08,469 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:41:08,470 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:41:08,470 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:41:08,471 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:41:08,471 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:41:08,472 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:41:08,472 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:41:08,546 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:41:08,561 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,564 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,670 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,671 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,671 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,671 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,672 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,672 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,672 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,673 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,673 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,673 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,673 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,674 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,674 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,676 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,676 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,676 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,677 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,679 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,679 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,684 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,690 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,691 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,697 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,697 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,697 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,700 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:41:08,719 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 21:41:08,736 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_priority_queue_remove_harness.i[4499,4512] [2021-11-16 21:41:08,737 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_priority_queue_remove_harness.i[4559,4572] [2021-11-16 21:41:08,744 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:41:08,744 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:41:08,762 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,762 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,762 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,762 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,763 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,766 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,766 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,767 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,767 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,767 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,768 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,768 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,768 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,801 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:41:08,802 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:41:08,802 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:41:08,802 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:41:08,803 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:41:08,804 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:41:08,804 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:41:08,805 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:41:08,805 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:41:08,805 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:41:08,823 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:41:08,837 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,839 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,855 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,856 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,856 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,856 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,857 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,857 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,857 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,858 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,858 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,859 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,859 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,860 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,860 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,861 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,861 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,861 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,862 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,863 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,863 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,868 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,869 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,869 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,875 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,876 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,876 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:41:08,879 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:41:09,044 INFO L208 MainTranslator]: Completed translation [2021-11-16 21:41:09,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:09 WrapperNode [2021-11-16 21:41:09,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 21:41:09,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 21:41:09,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 21:41:09,046 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 21:41:09,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:09" (1/1) ... [2021-11-16 21:41:09,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:09" (1/1) ... [2021-11-16 21:41:09,188 INFO L137 Inliner]: procedures = 699, calls = 1923, calls flagged for inlining = 60, calls inlined = 15, statements flattened = 1057 [2021-11-16 21:41:09,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 21:41:09,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 21:41:09,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 21:41:09,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 21:41:09,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:09" (1/1) ... [2021-11-16 21:41:09,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:09" (1/1) ... [2021-11-16 21:41:09,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:09" (1/1) ... [2021-11-16 21:41:09,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:09" (1/1) ... [2021-11-16 21:41:09,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:09" (1/1) ... [2021-11-16 21:41:09,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:09" (1/1) ... [2021-11-16 21:41:09,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:09" (1/1) ... [2021-11-16 21:41:09,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 21:41:09,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 21:41:09,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 21:41:09,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 21:41:09,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:09" (1/1) ... [2021-11-16 21:41:09,290 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:41:09,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:09,308 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) [2021-11-16 21:41:09,326 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 [2021-11-16 21:41:09,342 INFO L130 BoogieDeclarations]: Found specification of procedure s_swap [2021-11-16 21:41:09,342 INFO L138 BoogieDeclarations]: Found implementation of procedure s_swap [2021-11-16 21:41:09,342 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2021-11-16 21:41:09,342 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2021-11-16 21:41:09,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 21:41:09,343 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2021-11-16 21:41:09,343 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2021-11-16 21:41:09,343 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2021-11-16 21:41:09,343 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2021-11-16 21:41:09,343 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-11-16 21:41:09,344 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-11-16 21:41:09,345 INFO L130 BoogieDeclarations]: Found specification of procedure s_sift_up [2021-11-16 21:41:09,345 INFO L138 BoogieDeclarations]: Found implementation of procedure s_sift_up [2021-11-16 21:41:09,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-16 21:41:09,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-16 21:41:09,346 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2021-11-16 21:41:09,346 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2021-11-16 21:41:09,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 21:41:09,346 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 21:41:09,346 INFO L130 BoogieDeclarations]: Found specification of procedure s_remove_node [2021-11-16 21:41:09,346 INFO L138 BoogieDeclarations]: Found implementation of procedure s_remove_node [2021-11-16 21:41:09,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 21:41:09,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 21:41:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 21:41:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure my_abort [2021-11-16 21:41:09,347 INFO L138 BoogieDeclarations]: Found implementation of procedure my_abort [2021-11-16 21:41:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2021-11-16 21:41:09,347 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2021-11-16 21:41:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 21:41:09,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 21:41:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 21:41:09,348 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 21:41:09,348 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2021-11-16 21:41:09,348 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2021-11-16 21:41:09,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-16 21:41:09,348 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2021-11-16 21:41:09,348 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2021-11-16 21:41:09,348 INFO L130 BoogieDeclarations]: Found specification of procedure aws_priority_queue_is_valid [2021-11-16 21:41:09,348 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_priority_queue_is_valid [2021-11-16 21:41:09,348 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_length [2021-11-16 21:41:09,349 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_length [2021-11-16 21:41:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-16 21:41:09,349 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-16 21:41:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 21:41:09,349 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 21:41:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2021-11-16 21:41:09,349 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2021-11-16 21:41:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_pop_back [2021-11-16 21:41:09,350 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_pop_back [2021-11-16 21:41:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 21:41:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-16 21:41:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 21:41:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 21:41:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_get_at_ptr [2021-11-16 21:41:09,350 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_get_at_ptr [2021-11-16 21:41:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-11-16 21:41:09,350 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-11-16 21:41:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2021-11-16 21:41:09,351 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2021-11-16 21:41:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-16 21:41:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2021-11-16 21:41:09,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2021-11-16 21:41:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure aws_priority_queue_backpointer_index_valid [2021-11-16 21:41:09,351 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_priority_queue_backpointer_index_valid [2021-11-16 21:41:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-16 21:41:09,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-16 21:41:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-16 21:41:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_get_at [2021-11-16 21:41:09,352 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_get_at [2021-11-16 21:41:09,618 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 21:41:09,619 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 21:41:13,263 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 21:41:13,273 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 21:41:13,276 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-11-16 21:41:13,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:41:13 BoogieIcfgContainer [2021-11-16 21:41:13,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 21:41:13,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 21:41:13,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 21:41:13,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 21:41:13,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:41:07" (1/3) ... [2021-11-16 21:41:13,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c39cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:41:13, skipping insertion in model container [2021-11-16 21:41:13,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:41:09" (2/3) ... [2021-11-16 21:41:13,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c39cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:41:13, skipping insertion in model container [2021-11-16 21:41:13,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:41:13" (3/3) ... [2021-11-16 21:41:13,286 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_remove_harness.i [2021-11-16 21:41:13,289 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 21:41:13,289 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-16 21:41:13,333 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 21:41:13,351 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-16 21:41:13,351 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-16 21:41:13,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 460 states, 270 states have (on average 1.2703703703703704) internal successors, (343), 275 states have internal predecessors, (343), 160 states have call successors, (160), 27 states have call predecessors, (160), 27 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2021-11-16 21:41:13,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-11-16 21:41:13,391 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:13,391 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:41:13,392 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:13,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:13,395 INFO L85 PathProgramCache]: Analyzing trace with hash 207530193, now seen corresponding path program 1 times [2021-11-16 21:41:13,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:13,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288668040] [2021-11-16 21:41:13,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:13,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:13,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:41:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:13,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:41:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:13,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 21:41:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:13,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 21:41:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:13,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:41:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:13,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:41:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:13,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-16 21:41:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:13,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:41:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:13,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:41:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:13,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-16 21:41:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:13,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-16 21:41:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:13,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 21:41:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:13,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:41:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:13,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 21:41:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:14,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:41:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:14,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-16 21:41:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:14,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-16 21:41:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:14,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-16 21:41:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:14,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 21:41:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:14,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-11-16 21:41:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:14,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-16 21:41:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:14,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-16 21:41:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2021-11-16 21:41:14,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:14,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288668040] [2021-11-16 21:41:14,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288668040] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:41:14,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:41:14,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 21:41:14,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692714815] [2021-11-16 21:41:14,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:41:14,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:41:14,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:41:14,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:41:14,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:41:14,109 INFO L87 Difference]: Start difference. First operand has 460 states, 270 states have (on average 1.2703703703703704) internal successors, (343), 275 states have internal predecessors, (343), 160 states have call successors, (160), 27 states have call predecessors, (160), 27 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-16 21:41:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:17,152 INFO L93 Difference]: Finished difference Result 1349 states and 2508 transitions. [2021-11-16 21:41:17,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:41:17,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 141 [2021-11-16 21:41:17,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:17,170 INFO L225 Difference]: With dead ends: 1349 [2021-11-16 21:41:17,170 INFO L226 Difference]: Without dead ends: 895 [2021-11-16 21:41:17,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:41:17,182 INFO L933 BasicCegarLoop]: 864 mSDtfsCounter, 535 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 700 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 700 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-16 21:41:17,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [651 Valid, 1562 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [700 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-11-16 21:41:17,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2021-11-16 21:41:17,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 453. [2021-11-16 21:41:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 265 states have (on average 1.2339622641509433) internal successors, (327), 268 states have internal predecessors, (327), 160 states have call successors, (160), 27 states have call predecessors, (160), 26 states have return successors, (158), 158 states have call predecessors, (158), 158 states have call successors, (158) [2021-11-16 21:41:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 645 transitions. [2021-11-16 21:41:17,288 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 645 transitions. Word has length 141 [2021-11-16 21:41:17,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:17,288 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 645 transitions. [2021-11-16 21:41:17,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-16 21:41:17,289 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 645 transitions. [2021-11-16 21:41:17,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-16 21:41:17,291 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:17,291 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:41:17,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-16 21:41:17,292 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:17,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:17,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1080700984, now seen corresponding path program 1 times [2021-11-16 21:41:17,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:17,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482735774] [2021-11-16 21:41:17,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:17,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:41:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:41:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 21:41:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 21:41:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:41:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:41:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-16 21:41:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:41:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:41:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-16 21:41:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-16 21:41:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 21:41:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:41:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 21:41:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:41:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-16 21:41:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-16 21:41:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-16 21:41:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 21:41:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-11-16 21:41:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-16 21:41:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-11-16 21:41:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-16 21:41:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-16 21:41:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-11-16 21:41:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,616 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2021-11-16 21:41:17,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:17,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482735774] [2021-11-16 21:41:17,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482735774] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:41:17,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680471981] [2021-11-16 21:41:17,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:17,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:17,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:17,618 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) [2021-11-16 21:41:17,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-16 21:41:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 2319 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-16 21:41:17,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:18,332 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-11-16 21:41:18,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:41:18,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680471981] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:41:18,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:41:18,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2021-11-16 21:41:18,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544453300] [2021-11-16 21:41:18,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:41:18,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:41:18,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:41:18,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:41:18,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-16 21:41:18,335 INFO L87 Difference]: Start difference. First operand 453 states and 645 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2021-11-16 21:41:19,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:19,488 INFO L93 Difference]: Finished difference Result 872 states and 1259 transitions. [2021-11-16 21:41:19,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:41:19,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 156 [2021-11-16 21:41:19,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:19,493 INFO L225 Difference]: With dead ends: 872 [2021-11-16 21:41:19,494 INFO L226 Difference]: Without dead ends: 455 [2021-11-16 21:41:19,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-11-16 21:41:19,497 INFO L933 BasicCegarLoop]: 581 mSDtfsCounter, 665 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:41:19,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [687 Valid, 2237 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-16 21:41:19,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2021-11-16 21:41:19,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2021-11-16 21:41:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 266 states have (on average 1.2330827067669172) internal successors, (328), 270 states have internal predecessors, (328), 160 states have call successors, (160), 27 states have call predecessors, (160), 27 states have return successors, (171), 158 states have call predecessors, (171), 158 states have call successors, (171) [2021-11-16 21:41:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 659 transitions. [2021-11-16 21:41:19,533 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 659 transitions. Word has length 156 [2021-11-16 21:41:19,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:19,535 INFO L470 AbstractCegarLoop]: Abstraction has 455 states and 659 transitions. [2021-11-16 21:41:19,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2021-11-16 21:41:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 659 transitions. [2021-11-16 21:41:19,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-11-16 21:41:19,537 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:19,538 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:41:19,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-16 21:41:19,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:19,761 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:19,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:19,762 INFO L85 PathProgramCache]: Analyzing trace with hash 651465952, now seen corresponding path program 1 times [2021-11-16 21:41:19,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:19,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262819443] [2021-11-16 21:41:19,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:19,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:19,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:41:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:19,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:41:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:19,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 21:41:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:19,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 21:41:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:19,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:41:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:19,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:41:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:19,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-16 21:41:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:19,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:41:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:19,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:41:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:19,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-16 21:41:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:19,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:41:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:20,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-16 21:41:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:20,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-16 21:41:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:20,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:41:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:20,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-16 21:41:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:20,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:41:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:20,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-16 21:41:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:20,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-16 21:41:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:20,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-16 21:41:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:20,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-16 21:41:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:20,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-16 21:41:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:20,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-16 21:41:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:20,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-16 21:41:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:20,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-11-16 21:41:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:20,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-11-16 21:41:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:20,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-16 21:41:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:20,128 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2021-11-16 21:41:20,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:20,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262819443] [2021-11-16 21:41:20,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262819443] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:41:20,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831199198] [2021-11-16 21:41:20,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:20,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:20,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:20,130 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) [2021-11-16 21:41:20,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-16 21:41:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:20,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 2369 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-16 21:41:20,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:20,859 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-11-16 21:41:20,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:41:20,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831199198] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:41:20,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:41:20,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2021-11-16 21:41:20,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437216755] [2021-11-16 21:41:20,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:41:20,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:41:20,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:41:20,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:41:20,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-11-16 21:41:20,862 INFO L87 Difference]: Start difference. First operand 455 states and 659 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2021-11-16 21:41:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:22,252 INFO L93 Difference]: Finished difference Result 895 states and 1330 transitions. [2021-11-16 21:41:22,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:41:22,253 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) Word has length 164 [2021-11-16 21:41:22,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:22,256 INFO L225 Difference]: With dead ends: 895 [2021-11-16 21:41:22,256 INFO L226 Difference]: Without dead ends: 476 [2021-11-16 21:41:22,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2021-11-16 21:41:22,259 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 691 mSDsluCounter, 2726 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 3303 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-16 21:41:22,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [741 Valid, 3303 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-16 21:41:22,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2021-11-16 21:41:22,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 474. [2021-11-16 21:41:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 282 states have (on average 1.2411347517730495) internal successors, (350), 286 states have internal predecessors, (350), 162 states have call successors, (162), 27 states have call predecessors, (162), 28 states have return successors, (190), 161 states have call predecessors, (190), 160 states have call successors, (190) [2021-11-16 21:41:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 702 transitions. [2021-11-16 21:41:22,278 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 702 transitions. Word has length 164 [2021-11-16 21:41:22,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:22,278 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 702 transitions. [2021-11-16 21:41:22,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2021-11-16 21:41:22,278 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 702 transitions. [2021-11-16 21:41:22,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-11-16 21:41:22,280 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:22,280 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:41:22,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-16 21:41:22,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-11-16 21:41:22,500 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:22,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:22,500 INFO L85 PathProgramCache]: Analyzing trace with hash 706817890, now seen corresponding path program 1 times [2021-11-16 21:41:22,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:22,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136178317] [2021-11-16 21:41:22,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:22,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:22,555 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:41:22,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1692925809] [2021-11-16 21:41:22,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:22,556 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:22,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:22,557 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) [2021-11-16 21:41:22,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-16 21:41:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:22,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 2490 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-16 21:41:22,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-11-16 21:41:23,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:41:23,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:23,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136178317] [2021-11-16 21:41:23,223 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:41:23,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692925809] [2021-11-16 21:41:23,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692925809] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:41:23,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:41:23,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-16 21:41:23,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678371536] [2021-11-16 21:41:23,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:41:23,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 21:41:23,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:41:23,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 21:41:23,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:41:23,225 INFO L87 Difference]: Start difference. First operand 474 states and 702 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2021-11-16 21:41:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:24,462 INFO L93 Difference]: Finished difference Result 920 states and 1403 transitions. [2021-11-16 21:41:24,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:41:24,472 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 179 [2021-11-16 21:41:24,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:24,478 INFO L225 Difference]: With dead ends: 920 [2021-11-16 21:41:24,478 INFO L226 Difference]: Without dead ends: 482 [2021-11-16 21:41:24,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-11-16 21:41:24,483 INFO L933 BasicCegarLoop]: 575 mSDtfsCounter, 689 mSDsluCounter, 2188 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 2763 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:41:24,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [711 Valid, 2763 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-16 21:41:24,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-11-16 21:41:24,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 474. [2021-11-16 21:41:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 282 states have (on average 1.2411347517730495) internal successors, (350), 286 states have internal predecessors, (350), 162 states have call successors, (162), 27 states have call predecessors, (162), 28 states have return successors, (190), 161 states have call predecessors, (190), 160 states have call successors, (190) [2021-11-16 21:41:24,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 702 transitions. [2021-11-16 21:41:24,509 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 702 transitions. Word has length 179 [2021-11-16 21:41:24,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:24,510 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 702 transitions. [2021-11-16 21:41:24,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2021-11-16 21:41:24,510 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 702 transitions. [2021-11-16 21:41:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-11-16 21:41:24,513 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:24,513 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:41:24,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-16 21:41:24,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:24,719 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:24,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:24,720 INFO L85 PathProgramCache]: Analyzing trace with hash -548515061, now seen corresponding path program 1 times [2021-11-16 21:41:24,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:24,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983047994] [2021-11-16 21:41:24,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:24,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:24,783 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:41:24,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [241193964] [2021-11-16 21:41:24,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:24,784 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:24,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:24,785 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) [2021-11-16 21:41:24,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-16 21:41:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:25,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 2562 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-16 21:41:25,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-11-16 21:41:25,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:41:25,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:25,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983047994] [2021-11-16 21:41:25,495 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:41:25,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241193964] [2021-11-16 21:41:25,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241193964] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:41:25,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:41:25,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 21:41:25,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851132746] [2021-11-16 21:41:25,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:41:25,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:41:25,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:41:25,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:41:25,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:41:25,497 INFO L87 Difference]: Start difference. First operand 474 states and 702 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2021-11-16 21:41:26,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:26,671 INFO L93 Difference]: Finished difference Result 930 states and 1407 transitions. [2021-11-16 21:41:26,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 21:41:26,672 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 195 [2021-11-16 21:41:26,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:26,675 INFO L225 Difference]: With dead ends: 930 [2021-11-16 21:41:26,675 INFO L226 Difference]: Without dead ends: 492 [2021-11-16 21:41:26,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-11-16 21:41:26,677 INFO L933 BasicCegarLoop]: 554 mSDtfsCounter, 754 mSDsluCounter, 3172 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 3726 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:41:26,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [804 Valid, 3726 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-16 21:41:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-11-16 21:41:26,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 474. [2021-11-16 21:41:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 282 states have (on average 1.2411347517730495) internal successors, (350), 286 states have internal predecessors, (350), 162 states have call successors, (162), 27 states have call predecessors, (162), 28 states have return successors, (190), 161 states have call predecessors, (190), 160 states have call successors, (190) [2021-11-16 21:41:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 702 transitions. [2021-11-16 21:41:26,717 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 702 transitions. Word has length 195 [2021-11-16 21:41:26,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:26,718 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 702 transitions. [2021-11-16 21:41:26,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2021-11-16 21:41:26,718 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 702 transitions. [2021-11-16 21:41:26,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-11-16 21:41:26,721 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:26,721 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:41:26,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-16 21:41:26,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:26,927 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:26,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:26,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2018600789, now seen corresponding path program 2 times [2021-11-16 21:41:26,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:26,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948144269] [2021-11-16 21:41:26,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:26,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:26,991 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:41:26,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1517797964] [2021-11-16 21:41:26,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 21:41:26,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:26,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:26,993 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) [2021-11-16 21:41:26,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-16 21:41:29,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 21:41:29,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 21:41:30,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 2683 conjuncts, 70 conjunts are in the unsatisfiable core [2021-11-16 21:41:30,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:30,766 INFO L354 Elim1Store]: treesize reduction 850, result has 18.5 percent of original size [2021-11-16 21:41:30,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 16 select indices, 16 select index equivalence classes, 91 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 46 case distinctions, treesize of input 138 treesize of output 291 [2021-11-16 21:41:30,813 INFO L388 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 243 treesize of output 237 [2021-11-16 21:41:30,837 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-16 21:41:30,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 226 [2021-11-16 21:41:30,859 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-16 21:41:30,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 220 treesize of output 212 [2021-11-16 21:41:31,402 INFO L354 Elim1Store]: treesize reduction 428, result has 13.9 percent of original size [2021-11-16 21:41:31,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 18 select indices, 18 select index equivalence classes, 91 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 62 case distinctions, treesize of input 211 treesize of output 243 [2021-11-16 21:41:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-11-16 21:41:34,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:41:34,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:34,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948144269] [2021-11-16 21:41:34,114 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:41:34,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517797964] [2021-11-16 21:41:34,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517797964] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:41:34,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:41:34,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 21:41:34,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116634538] [2021-11-16 21:41:34,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:41:34,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:41:34,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:41:34,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:41:34,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:41:34,116 INFO L87 Difference]: Start difference. First operand 474 states and 702 transitions. Second operand has 8 states, 6 states have (on average 14.333333333333334) internal successors, (86), 8 states have internal predecessors, (86), 5 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 5 states have call successors, (26) [2021-11-16 21:41:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:34,955 INFO L93 Difference]: Finished difference Result 878 states and 1321 transitions. [2021-11-16 21:41:34,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 21:41:34,964 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 14.333333333333334) internal successors, (86), 8 states have internal predecessors, (86), 5 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 5 states have call successors, (26) Word has length 210 [2021-11-16 21:41:34,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:34,970 INFO L225 Difference]: With dead ends: 878 [2021-11-16 21:41:34,971 INFO L226 Difference]: Without dead ends: 476 [2021-11-16 21:41:34,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-16 21:41:34,980 INFO L933 BasicCegarLoop]: 612 mSDtfsCounter, 128 mSDsluCounter, 2903 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 3515 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-16 21:41:34,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 3515 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 163 Invalid, 0 Unknown, 47 Unchecked, 0.8s Time] [2021-11-16 21:41:34,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2021-11-16 21:41:34,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2021-11-16 21:41:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 283 states have (on average 1.2402826855123674) internal successors, (351), 288 states have internal predecessors, (351), 162 states have call successors, (162), 27 states have call predecessors, (162), 29 states have return successors, (201), 161 states have call predecessors, (201), 160 states have call successors, (201) [2021-11-16 21:41:35,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 714 transitions. [2021-11-16 21:41:35,008 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 714 transitions. Word has length 210 [2021-11-16 21:41:35,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:35,009 INFO L470 AbstractCegarLoop]: Abstraction has 476 states and 714 transitions. [2021-11-16 21:41:35,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 14.333333333333334) internal successors, (86), 8 states have internal predecessors, (86), 5 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 5 states have call successors, (26) [2021-11-16 21:41:35,010 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 714 transitions. [2021-11-16 21:41:35,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-11-16 21:41:35,032 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:35,032 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:41:35,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-16 21:41:35,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:35,246 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:35,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:35,246 INFO L85 PathProgramCache]: Analyzing trace with hash 470878035, now seen corresponding path program 1 times [2021-11-16 21:41:35,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:35,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170820976] [2021-11-16 21:41:35,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:35,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:35,287 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:41:35,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1345499730] [2021-11-16 21:41:35,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:35,288 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:35,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:35,292 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) [2021-11-16 21:41:35,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-16 21:41:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:35,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 2733 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-16 21:41:35,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-11-16 21:41:36,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:41:36,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:36,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170820976] [2021-11-16 21:41:36,126 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:41:36,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345499730] [2021-11-16 21:41:36,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345499730] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:41:36,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:41:36,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 21:41:36,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748541721] [2021-11-16 21:41:36,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:41:36,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:41:36,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:41:36,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:41:36,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:41:36,128 INFO L87 Difference]: Start difference. First operand 476 states and 714 transitions. Second operand has 9 states, 8 states have (on average 11.5) internal successors, (92), 9 states have internal predecessors, (92), 5 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (27), 4 states have call predecessors, (27), 5 states have call successors, (27) [2021-11-16 21:41:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:38,594 INFO L93 Difference]: Finished difference Result 896 states and 1365 transitions. [2021-11-16 21:41:38,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:41:38,594 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.5) internal successors, (92), 9 states have internal predecessors, (92), 5 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (27), 4 states have call predecessors, (27), 5 states have call successors, (27) Word has length 218 [2021-11-16 21:41:38,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:38,599 INFO L225 Difference]: With dead ends: 896 [2021-11-16 21:41:38,599 INFO L226 Difference]: Without dead ends: 492 [2021-11-16 21:41:38,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-11-16 21:41:38,602 INFO L933 BasicCegarLoop]: 575 mSDtfsCounter, 708 mSDsluCounter, 3274 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 3849 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-16 21:41:38,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [758 Valid, 3849 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-16 21:41:38,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-11-16 21:41:38,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 490. [2021-11-16 21:41:38,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 296 states have (on average 1.2466216216216217) internal successors, (369), 300 states have internal predecessors, (369), 163 states have call successors, (163), 27 states have call predecessors, (163), 29 states have return successors, (202), 163 states have call predecessors, (202), 161 states have call successors, (202) [2021-11-16 21:41:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 734 transitions. [2021-11-16 21:41:38,620 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 734 transitions. Word has length 218 [2021-11-16 21:41:38,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:38,621 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 734 transitions. [2021-11-16 21:41:38,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.5) internal successors, (92), 9 states have internal predecessors, (92), 5 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (27), 4 states have call predecessors, (27), 5 states have call successors, (27) [2021-11-16 21:41:38,621 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 734 transitions. [2021-11-16 21:41:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-11-16 21:41:38,623 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:38,624 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:41:38,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-16 21:41:38,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:38,839 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:38,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:38,840 INFO L85 PathProgramCache]: Analyzing trace with hash -914550263, now seen corresponding path program 2 times [2021-11-16 21:41:38,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:38,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668714384] [2021-11-16 21:41:38,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:38,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:38,894 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:41:38,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [777756247] [2021-11-16 21:41:38,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 21:41:38,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:38,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:38,899 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) [2021-11-16 21:41:38,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-16 21:41:45,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 21:41:45,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 21:41:45,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 2854 conjuncts, 202 conjunts are in the unsatisfiable core [2021-11-16 21:41:45,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:50,464 WARN L227 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 1032 DAG size of output: 434 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-16 21:41:50,466 INFO L354 Elim1Store]: treesize reduction 3073, result has 18.6 percent of original size [2021-11-16 21:41:50,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 55 select indices, 55 select index equivalence classes, 1378 disjoint index pairs (out of 1485 index pairs), introduced 55 new quantified variables, introduced 163 case distinctions, treesize of input 503 treesize of output 1085 [2021-11-16 21:41:50,623 INFO L354 Elim1Store]: treesize reduction 540, result has 0.2 percent of original size [2021-11-16 21:41:50,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 920 treesize of output 860 [2021-11-16 21:41:50,682 INFO L354 Elim1Store]: treesize reduction 936, result has 0.1 percent of original size [2021-11-16 21:41:50,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 830 treesize of output 752 [2021-11-16 21:41:54,850 INFO L354 Elim1Store]: treesize reduction 1520, result has 12.9 percent of original size [2021-11-16 21:41:54,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 57 select indices, 57 select index equivalence classes, 1378 disjoint index pairs (out of 1596 index pairs), introduced 57 new quantified variables, introduced 218 case distinctions, treesize of input 718 treesize of output 828 [2021-11-16 21:42:00,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:42:00,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668714384] [2021-11-16 21:42:00,294 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:42:00,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777756247] [2021-11-16 21:42:00,294 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Requested array size exceeds VM limit [2021-11-16 21:42:00,294 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:42:00,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-16 21:42:00,294 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-16 21:42:00,294 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-16 21:42:00,299 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-11-16 21:42:00,300 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-11-16 21:42:00,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-16 21:42:00,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:42:00,503 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2021-11-16 21:42:00,505 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-16 21:42:00,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 09:42:00 BoogieIcfgContainer [2021-11-16 21:42:00,538 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-16 21:42:00,538 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-16 21:42:00,539 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-16 21:42:00,539 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-16 21:42:00,539 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:41:13" (3/4) ... [2021-11-16 21:42:00,541 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-16 21:42:00,541 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-16 21:42:00,541 INFO L158 Benchmark]: Toolchain (without parser) took 52996.35ms. Allocated memory was 102.8MB in the beginning and 539.0MB in the end (delta: 436.2MB). Free memory was 67.5MB in the beginning and 273.4MB in the end (delta: -205.8MB). Peak memory consumption was 230.0MB. Max. memory is 16.1GB. [2021-11-16 21:42:00,542 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory was 61.2MB in the beginning and 61.1MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 21:42:00,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1498.20ms. Allocated memory was 102.8MB in the beginning and 134.2MB in the end (delta: 31.5MB). Free memory was 67.3MB in the beginning and 64.8MB in the end (delta: 2.5MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. [2021-11-16 21:42:00,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 143.15ms. Allocated memory is still 134.2MB. Free memory was 64.8MB in the beginning and 53.7MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-16 21:42:00,542 INFO L158 Benchmark]: Boogie Preprocessor took 91.41ms. Allocated memory was 134.2MB in the beginning and 203.4MB in the end (delta: 69.2MB). Free memory was 53.7MB in the beginning and 148.0MB in the end (delta: -94.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2021-11-16 21:42:00,542 INFO L158 Benchmark]: RCFGBuilder took 3997.70ms. Allocated memory is still 203.4MB. Free memory was 148.0MB in the beginning and 106.0MB in the end (delta: 42.0MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. [2021-11-16 21:42:00,543 INFO L158 Benchmark]: TraceAbstraction took 47257.85ms. Allocated memory was 203.4MB in the beginning and 539.0MB in the end (delta: 335.5MB). Free memory was 106.0MB in the beginning and 273.4MB in the end (delta: -167.4MB). Peak memory consumption was 167.1MB. Max. memory is 16.1GB. [2021-11-16 21:42:00,543 INFO L158 Benchmark]: Witness Printer took 2.48ms. Allocated memory is still 539.0MB. Free memory is still 273.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 21:42:00,544 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.15ms. Allocated memory is still 102.8MB. Free memory was 61.2MB in the beginning and 61.1MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1498.20ms. Allocated memory was 102.8MB in the beginning and 134.2MB in the end (delta: 31.5MB). Free memory was 67.3MB in the beginning and 64.8MB in the end (delta: 2.5MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 143.15ms. Allocated memory is still 134.2MB. Free memory was 64.8MB in the beginning and 53.7MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.41ms. Allocated memory was 134.2MB in the beginning and 203.4MB in the end (delta: 69.2MB). Free memory was 53.7MB in the beginning and 148.0MB in the end (delta: -94.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * RCFGBuilder took 3997.70ms. Allocated memory is still 203.4MB. Free memory was 148.0MB in the beginning and 106.0MB in the end (delta: 42.0MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. * TraceAbstraction took 47257.85ms. Allocated memory was 203.4MB in the beginning and 539.0MB in the end (delta: 335.5MB). Free memory was 106.0MB in the beginning and 273.4MB in the end (delta: -167.4MB). Peak memory consumption was 167.1MB. Max. memory is 16.1GB. * Witness Printer took 2.48ms. Allocated memory is still 539.0MB. Free memory is still 273.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint, overapproximation of large string literal at line 7788. Possible FailurePath: [L6915-L6920] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7360] static __thread int tl_last_error = 0; [L7787-L7935] static struct aws_error_info errors[] = { [(AWS_ERROR_SUCCESS)-0x0000] = { .literal_name = "AWS_ERROR_SUCCESS", .error_code = (AWS_ERROR_SUCCESS), .error_str = ("Success."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SUCCESS" ", " "Success.", } , [(AWS_ERROR_OOM)-0x0000] = { .literal_name = "AWS_ERROR_OOM", .error_code = (AWS_ERROR_OOM), .error_str = ("Out of memory."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OOM" ", " "Out of memory.", } , [(AWS_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_UNKNOWN", .error_code = (AWS_ERROR_UNKNOWN), .error_str = ("Unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNKNOWN" ", " "Unknown error.", } , [(AWS_ERROR_SHORT_BUFFER)-0x0000] = { .literal_name = "AWS_ERROR_SHORT_BUFFER", .error_code = (AWS_ERROR_SHORT_BUFFER), .error_str = ("Buffer is not large enough to hold result."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SHORT_BUFFER" ", " "Buffer is not large enough to hold result.", } , [(AWS_ERROR_OVERFLOW_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_OVERFLOW_DETECTED", .error_code = (AWS_ERROR_OVERFLOW_DETECTED), .error_str = ("Fixed size value overflow was detected."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OVERFLOW_DETECTED" ", " "Fixed size value overflow was detected.", } , [(AWS_ERROR_UNSUPPORTED_OPERATION)-0x0000] = { .literal_name = "AWS_ERROR_UNSUPPORTED_OPERATION", .error_code = (AWS_ERROR_UNSUPPORTED_OPERATION), .error_str = ("Unsupported operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNSUPPORTED_OPERATION" ", " "Unsupported operation.", } , [(AWS_ERROR_INVALID_BUFFER_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BUFFER_SIZE", .error_code = (AWS_ERROR_INVALID_BUFFER_SIZE), .error_str = ("Invalid buffer size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BUFFER_SIZE" ", " "Invalid buffer size.", } , [(AWS_ERROR_INVALID_HEX_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_HEX_STR", .error_code = (AWS_ERROR_INVALID_HEX_STR), .error_str = ("Invalid hex string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_HEX_STR" ", " "Invalid hex string.", } , [(AWS_ERROR_INVALID_BASE64_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BASE64_STR", .error_code = (AWS_ERROR_INVALID_BASE64_STR), .error_str = ("Invalid base64 string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BASE64_STR" ", " "Invalid base64 string.", } , [(AWS_ERROR_INVALID_INDEX)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_INDEX", .error_code = (AWS_ERROR_INVALID_INDEX), .error_str = ("Invalid index for list access."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_INDEX" ", " "Invalid index for list access.", } , [(AWS_ERROR_THREAD_INVALID_SETTINGS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INVALID_SETTINGS", .error_code = (AWS_ERROR_THREAD_INVALID_SETTINGS), .error_str = ("Invalid thread settings."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INVALID_SETTINGS" ", " "Invalid thread settings.", } , [(AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE", .error_code = (AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE), .error_str = ("Insufficent resources for thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE" ", " "Insufficent resources for thread.", } , [(AWS_ERROR_THREAD_NO_PERMISSIONS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_PERMISSIONS", .error_code = (AWS_ERROR_THREAD_NO_PERMISSIONS), .error_str = ("Insufficient permissions for thread operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_PERMISSIONS" ", " "Insufficient permissions for thread operation.", } , [(AWS_ERROR_THREAD_NOT_JOINABLE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NOT_JOINABLE", .error_code = (AWS_ERROR_THREAD_NOT_JOINABLE), .error_str = ("Thread not joinable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NOT_JOINABLE" ", " "Thread not joinable.", } , [(AWS_ERROR_THREAD_NO_SUCH_THREAD_ID)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID", .error_code = (AWS_ERROR_THREAD_NO_SUCH_THREAD_ID), .error_str = ("No such thread ID."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID" ", " "No such thread ID.", } , [(AWS_ERROR_THREAD_DEADLOCK_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_DEADLOCK_DETECTED", .error_code = (AWS_ERROR_THREAD_DEADLOCK_DETECTED), .error_str = ("Deadlock detected in thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_DEADLOCK_DETECTED" ", " "Deadlock detected in thread.", } , [(AWS_ERROR_MUTEX_NOT_INIT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_NOT_INIT", .error_code = (AWS_ERROR_MUTEX_NOT_INIT), .error_str = ("Mutex not initialized."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_NOT_INIT" ", " "Mutex not initialized.", } , [(AWS_ERROR_MUTEX_TIMEOUT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_TIMEOUT", .error_code = (AWS_ERROR_MUTEX_TIMEOUT), .error_str = ("Mutex operation timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_TIMEOUT" ", " "Mutex operation timed out.", } , [(AWS_ERROR_MUTEX_CALLER_NOT_OWNER)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_CALLER_NOT_OWNER", .error_code = (AWS_ERROR_MUTEX_CALLER_NOT_OWNER), .error_str = ("The caller of a mutex operation was not the owner."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_CALLER_NOT_OWNER" ", " "The caller of a mutex operation was not the owner.", } , [(AWS_ERROR_MUTEX_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_FAILED", .error_code = (AWS_ERROR_MUTEX_FAILED), .error_str = ("Mutex operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_FAILED" ", " "Mutex operation failed.", } , [(AWS_ERROR_COND_VARIABLE_INIT_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_INIT_FAILED", .error_code = (AWS_ERROR_COND_VARIABLE_INIT_FAILED), .error_str = ("Condition variable initialization failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_INIT_FAILED" ", " "Condition variable initialization failed.", } , [(AWS_ERROR_COND_VARIABLE_TIMED_OUT)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_TIMED_OUT", .error_code = (AWS_ERROR_COND_VARIABLE_TIMED_OUT), .error_str = ("Condition variable wait timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_TIMED_OUT" ", " "Condition variable wait timed out.", } , [(AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN", .error_code = (AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN), .error_str = ("Condition variable unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN" ", " "Condition variable unknown error.", } , [(AWS_ERROR_CLOCK_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_CLOCK_FAILURE", .error_code = (AWS_ERROR_CLOCK_FAILURE), .error_str = ("Clock operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_CLOCK_FAILURE" ", " "Clock operation failed.", } , [(AWS_ERROR_LIST_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EMPTY", .error_code = (AWS_ERROR_LIST_EMPTY), .error_str = ("Empty list."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EMPTY" ", " "Empty list.", } , [(AWS_ERROR_DEST_COPY_TOO_SMALL)-0x0000] = { .literal_name = "AWS_ERROR_DEST_COPY_TOO_SMALL", .error_code = (AWS_ERROR_DEST_COPY_TOO_SMALL), .error_str = ("Destination of copy is too small."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_DEST_COPY_TOO_SMALL" ", " "Destination of copy is too small.", } , [(AWS_ERROR_LIST_EXCEEDS_MAX_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE", .error_code = (AWS_ERROR_LIST_EXCEEDS_MAX_SIZE), .error_str = ("A requested operation on a list would exceed it's max size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE" ", " "A requested operation on a list would exceed it's max size.", } , [(AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK)-0x0000] = { .literal_name = "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK", .error_code = (AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK), .error_str = ("Attempt to shrink a list in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK" ", " "Attempt to shrink a list in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_FULL)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_FULL", .error_code = (AWS_ERROR_PRIORITY_QUEUE_FULL), .error_str = ("Attempt to add items to a full preallocated queue in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_FULL" ", " "Attempt to add items to a full preallocated queue in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_EMPTY", .error_code = (AWS_ERROR_PRIORITY_QUEUE_EMPTY), .error_str = ("Attempt to pop an item from an empty queue."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_EMPTY" ", " "Attempt to pop an item from an empty queue.", } , [(AWS_ERROR_PRIORITY_QUEUE_BAD_NODE)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE", .error_code = (AWS_ERROR_PRIORITY_QUEUE_BAD_NODE), .error_str = ("Bad node handle passed to remove."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE" ", " "Bad node handle passed to remove.", } , [(AWS_ERROR_HASHTBL_ITEM_NOT_FOUND)-0x0000] = { .literal_name = "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND", .error_code = (AWS_ERROR_HASHTBL_ITEM_NOT_FOUND), .error_str = ("Item not found in hash table."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND" ", " "Item not found in hash table.", } , [(AWS_ERROR_INVALID_DATE_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_DATE_STR", .error_code = (AWS_ERROR_INVALID_DATE_STR), .error_str = ("Date string is invalid and cannot be parsed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_DATE_STR" ", " "Date string is invalid and cannot be parsed.", } , [(AWS_ERROR_INVALID_ARGUMENT)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_ARGUMENT", .error_code = (AWS_ERROR_INVALID_ARGUMENT), .error_str = ("An invalid argument was passed to a function."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_ARGUMENT" ", " "An invalid argument was passed to a function.", } , [(AWS_ERROR_RANDOM_GEN_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_RANDOM_GEN_FAILED", .error_code = (AWS_ERROR_RANDOM_GEN_FAILED), .error_str = ("A call to the random number generator failed. Retry later."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_RANDOM_GEN_FAILED" ", " "A call to the random number generator failed. Retry later.", } , [(AWS_ERROR_MALFORMED_INPUT_STRING)-0x0000] = { .literal_name = "AWS_ERROR_MALFORMED_INPUT_STRING", .error_code = (AWS_ERROR_MALFORMED_INPUT_STRING), .error_str = ("An input string was passed to a parser and the string was incorrectly formatted."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MALFORMED_INPUT_STRING" ", " "An input string was passed to a parser and the string was incorrectly formatted.", } , [(AWS_ERROR_UNIMPLEMENTED)-0x0000] = { .literal_name = "AWS_ERROR_UNIMPLEMENTED", .error_code = (AWS_ERROR_UNIMPLEMENTED), .error_str = ("A function was called, but is not implemented."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNIMPLEMENTED" ", " "A function was called, but is not implemented.", } , [(AWS_ERROR_INVALID_STATE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_STATE", .error_code = (AWS_ERROR_INVALID_STATE), .error_str = ("An invalid state was encountered."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_STATE" ", " "An invalid state was encountered.", } , [(AWS_ERROR_ENVIRONMENT_GET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_GET", .error_code = (AWS_ERROR_ENVIRONMENT_GET), .error_str = ("System call failure when getting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_GET" ", " "System call failure when getting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_SET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_SET", .error_code = (AWS_ERROR_ENVIRONMENT_SET), .error_str = ("System call failure when setting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_SET" ", " "System call failure when setting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_UNSET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_UNSET", .error_code = (AWS_ERROR_ENVIRONMENT_UNSET), .error_str = ("System call failure when unsetting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_UNSET" ", " "System call failure when unsetting an environment variable.", } , [(AWS_ERROR_SYS_CALL_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_SYS_CALL_FAILURE", .error_code = (AWS_ERROR_SYS_CALL_FAILURE), .error_str = ("System call failure"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SYS_CALL_FAILURE" ", " "System call failure", } , [(AWS_ERROR_FILE_INVALID_PATH)-0x0000] = { .literal_name = "AWS_ERROR_FILE_INVALID_PATH", .error_code = (AWS_ERROR_FILE_INVALID_PATH), .error_str = ("Invalid file path."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_FILE_INVALID_PATH" ", " "Invalid file path.", } , [(AWS_ERROR_MAX_FDS_EXCEEDED)-0x0000] = { .literal_name = "AWS_ERROR_MAX_FDS_EXCEEDED", .error_code = (AWS_ERROR_MAX_FDS_EXCEEDED), .error_str = ("The maximum number of fds has been exceeded."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MAX_FDS_EXCEEDED" ", " "The maximum number of fds has been exceeded.", } , [(AWS_ERROR_NO_PERMISSION)-0x0000] = { .literal_name = "AWS_ERROR_NO_PERMISSION", .error_code = (AWS_ERROR_NO_PERMISSION), .error_str = ("User does not have permission to perform the requested action."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_NO_PERMISSION" ", " "User does not have permission to perform the requested action.", } , [(AWS_ERROR_STREAM_UNSEEKABLE)-0x0000] = { .literal_name = "AWS_ERROR_STREAM_UNSEEKABLE", .error_code = (AWS_ERROR_STREAM_UNSEEKABLE), .error_str = ("Stream does not support seek operations"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_STREAM_UNSEEKABLE" ", " "Stream does not support seek operations", } , }; [L7938-L7941] static struct aws_error_info_list s_list = { .error_list = errors, .count = (sizeof(errors) / sizeof((errors)[0])), }; [L7943-L7952] static struct aws_log_subject_info s_common_log_subject_infos[] = { { .subject_id = (AWS_LS_COMMON_GENERAL), .subject_name = ("aws-c-common"), .subject_description = ("Subject for aws-c-common logging that doesn't belong to any particular category") } , { .subject_id = (AWS_LS_COMMON_TASK_SCHEDULER), .subject_name = ("task-scheduler"), .subject_description = ("Subject for task scheduler or task specific logging.") } , }; [L7954-L7957] static struct aws_log_subject_info_list s_common_log_subject_list = { .subject_list = s_common_log_subject_infos, .count = (sizeof(s_common_log_subject_infos) / sizeof((s_common_log_subject_infos)[0])), }; [L7959-L7963] static _Bool s_common_library_initialized = 0 ; [L8495] CALL aws_priority_queue_remove_harness() [L8450] struct aws_priority_queue queue; [L8453] CALL, EXPR aws_priority_queue_is_bounded(&queue, 9223372036854775808U, 2) [L6791] CALL, EXPR aws_array_list_is_bounded(&queue->container, max_initial_item_allocation, max_item_size) [L6735] EXPR list->item_size [L6734-L6735] _Bool item_size_is_bounded = list->item_size <= max_item_size; [L6738] EXPR list->length [L6737-L6738] _Bool length_is_bounded = list->length <= max_initial_item_allocation; [L6739] return item_size_is_bounded && length_is_bounded; [L6791] RET, EXPR aws_array_list_is_bounded(&queue->container, max_initial_item_allocation, max_item_size) [L6789-L6791] _Bool container_is_bounded = aws_array_list_is_bounded(&queue->container, max_initial_item_allocation, max_item_size); [L6798-L6799] CALL, EXPR aws_array_list_is_bounded( &queue->backpointers, max_initial_item_allocation, sizeof(struct aws_priority_queue_node *)) [L6735] EXPR list->item_size [L6734-L6735] _Bool item_size_is_bounded = list->item_size <= max_item_size; [L6738] EXPR list->length [L6737-L6738] _Bool length_is_bounded = list->length <= max_initial_item_allocation; [L6739] return item_size_is_bounded && length_is_bounded; [L6798-L6799] RET, EXPR aws_array_list_is_bounded( &queue->backpointers, max_initial_item_allocation, sizeof(struct aws_priority_queue_node *)) [L6797-L6799] _Bool backpointers_list_is_bounded = aws_array_list_is_bounded( &queue->backpointers, max_initial_item_allocation, sizeof(struct aws_priority_queue_node *)); [L6800] return container_is_bounded && backpointers_list_is_bounded; [L8453] RET, EXPR aws_priority_queue_is_bounded(&queue, 9223372036854775808U, 2) [L8453] CALL assume_abort_if_not(aws_priority_queue_is_bounded(&queue, 9223372036854775808U, 2)) [L211] COND FALSE !(!cond) [L8453] RET assume_abort_if_not(aws_priority_queue_is_bounded(&queue, 9223372036854775808U, 2)) [L8454] CALL ensure_priority_queue_has_allocated_members(&queue) [L6804] CALL ensure_array_list_has_allocated_data_member(&queue->container) [L6743] EXPR list->current_size [L6743] list->current_size == 0 && list->length == 0 [L6743] EXPR list->length [L6743] list->current_size == 0 && list->length == 0 [L6743] COND TRUE list->current_size == 0 && list->length == 0 [L6744] EXPR list->data [L6744-L6746] CALL assume_abort_if_not(list->data == ((void *)0) ) [L211] COND FALSE !(!cond) [L6744-L6746] RET assume_abort_if_not(list->data == ((void *)0) ) [L6747] CALL, EXPR can_fail_allocator() [L6939] return &s_can_fail_allocator_static; [L6747] RET, EXPR can_fail_allocator() [L6747] list->alloc = can_fail_allocator() [L6804] RET ensure_array_list_has_allocated_data_member(&queue->container) [L6805] CALL ensure_array_list_has_allocated_data_member(&queue->backpointers) [L6743] EXPR list->current_size [L6743] list->current_size == 0 && list->length == 0 [L6743] EXPR list->length [L6743] list->current_size == 0 && list->length == 0 [L6743] COND TRUE list->current_size == 0 && list->length == 0 [L6744] EXPR list->data [L6744-L6746] CALL assume_abort_if_not(list->data == ((void *)0) ) [L211] COND FALSE !(!cond) [L6744-L6746] RET assume_abort_if_not(list->data == ((void *)0) ) [L6747] CALL, EXPR can_fail_allocator() [L6939] return &s_can_fail_allocator_static; [L6747] RET, EXPR can_fail_allocator() [L6747] list->alloc = can_fail_allocator() [L6805] RET ensure_array_list_has_allocated_data_member(&queue->backpointers) [L6806] queue->pred = nondet_compare [L8454] RET ensure_priority_queue_has_allocated_members(&queue) [L8457] CALL, EXPR aws_priority_queue_is_valid(&queue) [L8279] COND FALSE !(!queue) [L8286] EXPR queue->pred [L8285-L8288] _Bool pred_is_valid = (queue->pred != ((void *)0) ); [L8291] CALL, EXPR aws_array_list_is_valid(&queue->container) [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L2948] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2590] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2498] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] RET __CPROVER_overflow_mult(a, b) [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2948] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L8291] RET, EXPR aws_array_list_is_valid(&queue->container) [L8290-L8291] _Bool container_is_valid = aws_array_list_is_valid(&queue->container); [L8295] CALL, EXPR aws_priority_queue_backpointers_valid(queue) [L8220] COND FALSE !(!queue) [L8230] CALL, EXPR aws_array_list_is_valid(&queue->backpointers) [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L2948] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2590] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2498] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] RET __CPROVER_overflow_mult(a, b) [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2948] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L8230] RET, EXPR aws_array_list_is_valid(&queue->backpointers) [L8230] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) [L8230] EXPR queue->backpointers.current_size [L8230] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) [L8230-L8233] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ) [L8231] EXPR queue->backpointers.data [L8230-L8233] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ) [L8228-L8233] _Bool backpointer_list_is_valid = ((aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ))); [L8241] EXPR queue->backpointers.item_size [L8240-L8241] _Bool backpointer_list_item_size = queue->backpointers.item_size == sizeof(struct aws_priority_queue_node *); [L8244] EXPR queue->backpointers.length [L8244] EXPR queue->container.length [L8243-L8244] _Bool lists_equal_lengths = queue->backpointers.length == queue->container.length; [L8247] EXPR queue->backpointers.current_size [L8246-L8247] _Bool backpointers_non_zero_current_size = queue->backpointers.current_size > 0; [L8255-L8258] _Bool backpointers_valid_deep = 1 ; [L8263] EXPR queue->backpointers.current_size [L8263] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 [L8263] EXPR queue->backpointers.length [L8263] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 [L8263-L8264] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) [L8263] EXPR queue->backpointers.data [L8263-L8264] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) [L8261-L8265] _Bool backpointers_zero = (queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) ); [L8267-L8270] _Bool backpointer_struct_is_valid = backpointers_zero || (backpointer_list_item_size && lists_equal_lengths && backpointers_non_zero_current_size && backpointers_valid_deep); [L8272] EXPR (backpointer_list_is_valid && backpointer_struct_is_valid) || aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers)) [L8272] return ((backpointer_list_is_valid && backpointer_struct_is_valid) || aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers))); [L8295] RET, EXPR aws_priority_queue_backpointers_valid(queue) [L8294-L8295] _Bool backpointers_valid = aws_priority_queue_backpointers_valid(queue); [L8296] return pred_is_valid && container_is_valid && backpointers_valid; [L8457] RET, EXPR aws_priority_queue_is_valid(&queue) [L8457] CALL assume_abort_if_not(aws_priority_queue_is_valid(&queue)) [L211] COND FALSE !(!cond) [L8457] RET assume_abort_if_not(aws_priority_queue_is_valid(&queue)) [L8458] EXPR queue.container.item_size [L8458] CALL, EXPR can_fail_malloc(queue.container.item_size) [L6949] CALL, EXPR nondet_bool() [L261] return __VERIFIER_nondet_bool(); [L6949] RET, EXPR nondet_bool() [L6949-L6951] EXPR nondet_bool() ? ((void *)0) : bounded_malloc(size) [L6949-L6951] return nondet_bool() ? ((void *)0) : bounded_malloc(size); [L8458] RET, EXPR can_fail_malloc(queue.container.item_size) [L8458] void *item = can_fail_malloc(queue.container.item_size); [L8459] CALL, EXPR can_fail_malloc(sizeof(struct aws_priority_queue_node)) [L6949] CALL, EXPR nondet_bool() [L261] return __VERIFIER_nondet_bool(); [L6949] RET, EXPR nondet_bool() [L6949-L6951] EXPR nondet_bool() ? ((void *)0) : bounded_malloc(size) [L6949-L6951] return nondet_bool() ? ((void *)0) : bounded_malloc(size); [L8459] RET, EXPR can_fail_malloc(sizeof(struct aws_priority_queue_node)) [L8459] struct aws_priority_queue_node *backpointer = can_fail_malloc(sizeof(struct aws_priority_queue_node)); [L8461] EXPR queue.backpointers.data [L8461] COND FALSE !(queue.backpointers.data && backpointer) [L8478] struct aws_priority_queue old_queue = queue; [L8481] EXPR item && ((((queue.container.item_size)) == 0) || ((item))) [L8481] EXPR queue.container.item_size [L8481] EXPR item && ((((queue.container.item_size)) == 0) || ((item))) [L8481] CALL assume_abort_if_not(item && ((((queue.container.item_size)) == 0) || ((item)))) [L211] COND FALSE !(!cond) [L8481] RET assume_abort_if_not(item && ((((queue.container.item_size)) == 0) || ((item)))) [L8482] CALL assume_abort_if_not(backpointer && ((((sizeof(struct aws_priority_queue_node))) == 0) || ((backpointer)))) [L211] COND FALSE !(!cond) [L8482] RET assume_abort_if_not(backpointer && ((((sizeof(struct aws_priority_queue_node))) == 0) || ((backpointer)))) [L8485] CALL aws_priority_queue_remove(&queue, item, backpointer) [L8414] CALL, EXPR aws_priority_queue_is_valid(queue) [L8279] COND FALSE !(!queue) [L8286] EXPR queue->pred [L8285-L8288] _Bool pred_is_valid = (queue->pred != ((void *)0) ); [L8291] CALL, EXPR aws_array_list_is_valid(&queue->container) [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L2948] CALL, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2590] CALL, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2498] CALL __CPROVER_overflow_mult(a, b) [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] RET __CPROVER_overflow_mult(a, b) [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] RET, EXPR aws_mul_u64_checked(a, b, (uint64_t *)r) [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2948] RET, EXPR aws_mul_size_checked(list->length, list->item_size, &required_size) [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L8291] RET, EXPR aws_array_list_is_valid(&queue->container) [L8290-L8291] _Bool container_is_valid = aws_array_list_is_valid(&queue->container); [L8295] CALL, EXPR aws_priority_queue_backpointers_valid(queue) [L8220] COND TRUE !queue [L8221-L8223] return 0 ; [L8295] RET, EXPR aws_priority_queue_backpointers_valid(queue) [L8294-L8295] _Bool backpointers_valid = aws_priority_queue_backpointers_valid(queue); [L8296] return pred_is_valid && container_is_valid && backpointers_valid; [L8414] RET, EXPR aws_priority_queue_is_valid(queue) [L8414] CALL assume_abort_if_not((aws_priority_queue_is_valid(queue))) [L211] COND FALSE !(!cond) [L8414] RET assume_abort_if_not((aws_priority_queue_is_valid(queue))) [L8415] EXPR item && ((((queue->container.item_size)) == 0) || ((item))) [L8415] CALL assume_abort_if_not((item && ((((queue->container.item_size)) == 0) || ((item))))) [L211] COND FALSE !(!cond) [L8415] RET assume_abort_if_not((item && ((((queue->container.item_size)) == 0) || ((item))))) [L8416] CALL assume_abort_if_not((node && ((((sizeof(struct aws_priority_queue_node))) == 0) || ((node))))) [L211] COND FALSE !(!cond) [L8416] RET assume_abort_if_not((node && ((((sizeof(struct aws_priority_queue_node))) == 0) || ((node))))) [L8417] node->current_index [L8417] CALL aws_array_list_length(&queue->container) [L3169] EXPR list->length [L3169] EXPR !list->length || list->data [L3169] CALL assume_abort_if_not((!list->length || list->data)) [L211] COND FALSE !(!cond) [L3169] RET assume_abort_if_not((!list->length || list->data)) [L3170] CALL, EXPR aws_array_list_is_valid(list) [L2939] COND TRUE !list [L2940-L2942] return 0 ; [L3170] RET, EXPR aws_array_list_is_valid(list) [L3170] CALL assume_abort_if_not((aws_array_list_is_valid(list))) [L211] COND FALSE !(!cond) [L3170] RET assume_abort_if_not((aws_array_list_is_valid(list))) [L3171] EXPR list->length [L3171] size_t len = list->length; [L3172] CALL, EXPR aws_array_list_is_valid(list) [L2939] COND TRUE !list [L2940-L2942] return 0 ; [L3172] RET, EXPR aws_array_list_is_valid(list) [L3172] CALL __VERIFIER_assert((aws_array_list_is_valid(list))) [L223] COND TRUE !cond [L223] reach_error() - UnprovableResult [Line: 233]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 28 procedures, 460 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 47.2s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4496 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4170 mSDsluCounter, 20955 SdHoareTripleChecker+Invalid, 9.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 47 IncrementalHoareTripleChecker+Unchecked, 16617 mSDsCounter, 1122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3607 IncrementalHoareTripleChecker+Invalid, 4776 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1122 mSolverCounterUnsat, 4338 mSDtfsCounter, 3607 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1320 GetRequests, 1238 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=490occurred in iteration=7, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 472 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 10.5s SatisfiabilityAnalysisTime, 22.1s InterpolantComputationTime, 1816 NumberOfCodeBlocks, 1816 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1574 ConstructedInterpolants, 1 QuantifiedInterpolants, 4007 SizeOfPredicates, 35 NumberOfNonLiveVariables, 18010 ConjunctsInSsa, 309 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 2310/2322 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-16 21:42:00,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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_priority_queue_remove_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 1ebada516f0ccae5e55b91f6e0fe5802f70171054dc79c047f46877ad506c65e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 21:42:02,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 21:42:02,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 21:42:02,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 21:42:02,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 21:42:02,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 21:42:02,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 21:42:02,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 21:42:02,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 21:42:02,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 21:42:02,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 21:42:02,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 21:42:02,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 21:42:02,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 21:42:02,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 21:42:02,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 21:42:02,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 21:42:02,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 21:42:02,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 21:42:02,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 21:42:02,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 21:42:02,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 21:42:02,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 21:42:02,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 21:42:02,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 21:42:02,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 21:42:02,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 21:42:02,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 21:42:02,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 21:42:02,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 21:42:02,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 21:42:02,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 21:42:02,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 21:42:02,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 21:42:02,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 21:42:02,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 21:42:02,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 21:42:02,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 21:42:02,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 21:42:02,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 21:42:02,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 21:42:02,216 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-16 21:42:02,238 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 21:42:02,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 21:42:02,239 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 21:42:02,239 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 21:42:02,240 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 21:42:02,240 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 21:42:02,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 21:42:02,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 21:42:02,241 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 21:42:02,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 21:42:02,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 21:42:02,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 21:42:02,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 21:42:02,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 21:42:02,243 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-16 21:42:02,243 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-16 21:42:02,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 21:42:02,243 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 21:42:02,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 21:42:02,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 21:42:02,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 21:42:02,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 21:42:02,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:42:02,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 21:42:02,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 21:42:02,244 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 21:42:02,244 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-16 21:42:02,245 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-16 21:42:02,245 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 21:42:02,245 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 21:42:02,245 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 21:42:02,245 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 21:42:02,245 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-16 21:42:02,245 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 -> 1ebada516f0ccae5e55b91f6e0fe5802f70171054dc79c047f46877ad506c65e [2021-11-16 21:42:02,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 21:42:02,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 21:42:02,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 21:42:02,532 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 21:42:02,532 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 21:42:02,533 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_priority_queue_remove_harness.i [2021-11-16 21:42:02,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d793d4a2/2b0da9f7401745bdb7dee9dcccafd4ed/FLAGfb7dad9c3 [2021-11-16 21:42:03,139 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 21:42:03,140 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_remove_harness.i [2021-11-16 21:42:03,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d793d4a2/2b0da9f7401745bdb7dee9dcccafd4ed/FLAGfb7dad9c3 [2021-11-16 21:42:03,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d793d4a2/2b0da9f7401745bdb7dee9dcccafd4ed [2021-11-16 21:42:03,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 21:42:03,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 21:42:03,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 21:42:03,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 21:42:03,363 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 21:42:03,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:42:03" (1/1) ... [2021-11-16 21:42:03,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7bddf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:42:03, skipping insertion in model container [2021-11-16 21:42:03,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:42:03" (1/1) ... [2021-11-16 21:42:03,369 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 21:42:03,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 21:42:03,607 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_priority_queue_remove_harness.i[4499,4512] [2021-11-16 21:42:03,612 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_priority_queue_remove_harness.i[4559,4572] [2021-11-16 21:42:03,624 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:42:03,628 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:42:04,059 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,060 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,060 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,061 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,061 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,071 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,071 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,073 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,073 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,075 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,076 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,076 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,077 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,304 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:42:04,305 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:42:04,307 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:42:04,308 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:42:04,309 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:42:04,310 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:42:04,310 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:42:04,314 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:42:04,315 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:42:04,316 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:42:04,432 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:42:04,463 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,470 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,516 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,518 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,518 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,518 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,519 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,519 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,519 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,520 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,520 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,520 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,520 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,521 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,521 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,523 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,523 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,523 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,523 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,527 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,528 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,535 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,535 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,536 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,544 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,544 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,545 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,547 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:42:04,578 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 21:42:04,595 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_priority_queue_remove_harness.i[4499,4512] [2021-11-16 21:42:04,596 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_priority_queue_remove_harness.i[4559,4572] [2021-11-16 21:42:04,597 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:42:04,597 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:42:04,634 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,634 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,635 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,635 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,635 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,641 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,642 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,642 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,642 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,643 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,645 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,645 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,645 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,689 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:42:04,690 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:42:04,691 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:42:04,691 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:42:04,691 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:42:04,692 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:42:04,692 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:42:04,692 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:42:04,692 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:42:04,693 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:42:04,712 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:42:04,723 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,726 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,742 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,742 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,743 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,743 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,743 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,743 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,744 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,744 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,745 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,745 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,745 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,746 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,746 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,747 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,747 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,747 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,747 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,748 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,749 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,755 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,756 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,756 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,764 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,764 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,765 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,767 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:42:04,931 INFO L208 MainTranslator]: Completed translation [2021-11-16 21:42:04,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:42:04 WrapperNode [2021-11-16 21:42:04,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 21:42:04,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 21:42:04,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 21:42:04,932 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 21:42:04,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:42:04" (1/1) ... [2021-11-16 21:42:05,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:42:04" (1/1) ... [2021-11-16 21:42:05,088 INFO L137 Inliner]: procedures = 719, calls = 1923, calls flagged for inlining = 60, calls inlined = 15, statements flattened = 1038 [2021-11-16 21:42:05,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 21:42:05,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 21:42:05,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 21:42:05,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 21:42:05,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:42:04" (1/1) ... [2021-11-16 21:42:05,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:42:04" (1/1) ... [2021-11-16 21:42:05,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:42:04" (1/1) ... [2021-11-16 21:42:05,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:42:04" (1/1) ... [2021-11-16 21:42:05,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:42:04" (1/1) ... [2021-11-16 21:42:05,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:42:04" (1/1) ... [2021-11-16 21:42:05,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:42:04" (1/1) ... [2021-11-16 21:42:05,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 21:42:05,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 21:42:05,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 21:42:05,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 21:42:05,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:42:04" (1/1) ... [2021-11-16 21:42:05,206 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:42:05,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:42:05,222 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) [2021-11-16 21:42:05,248 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 [2021-11-16 21:42:05,272 INFO L130 BoogieDeclarations]: Found specification of procedure s_swap [2021-11-16 21:42:05,272 INFO L138 BoogieDeclarations]: Found implementation of procedure s_swap [2021-11-16 21:42:05,272 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2021-11-16 21:42:05,272 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2021-11-16 21:42:05,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 21:42:05,273 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2021-11-16 21:42:05,273 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2021-11-16 21:42:05,273 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2021-11-16 21:42:05,274 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2021-11-16 21:42:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-11-16 21:42:05,276 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-11-16 21:42:05,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-16 21:42:05,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-16 21:42:05,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-16 21:42:05,277 INFO L130 BoogieDeclarations]: Found specification of procedure s_sift_up [2021-11-16 21:42:05,277 INFO L138 BoogieDeclarations]: Found implementation of procedure s_sift_up [2021-11-16 21:42:05,277 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2021-11-16 21:42:05,277 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2021-11-16 21:42:05,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 21:42:05,281 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 21:42:05,281 INFO L130 BoogieDeclarations]: Found specification of procedure s_remove_node [2021-11-16 21:42:05,281 INFO L138 BoogieDeclarations]: Found implementation of procedure s_remove_node [2021-11-16 21:42:05,282 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~C_INT [2021-11-16 21:42:05,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~C_INT [2021-11-16 21:42:05,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 21:42:05,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 21:42:05,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 21:42:05,282 INFO L130 BoogieDeclarations]: Found specification of procedure my_abort [2021-11-16 21:42:05,282 INFO L138 BoogieDeclarations]: Found implementation of procedure my_abort [2021-11-16 21:42:05,282 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2021-11-16 21:42:05,282 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2021-11-16 21:42:05,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 21:42:05,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 21:42:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 21:42:05,283 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 21:42:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-16 21:42:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-16 21:42:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2021-11-16 21:42:05,283 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2021-11-16 21:42:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-16 21:42:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2021-11-16 21:42:05,283 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2021-11-16 21:42:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure aws_priority_queue_is_valid [2021-11-16 21:42:05,284 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_priority_queue_is_valid [2021-11-16 21:42:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_length [2021-11-16 21:42:05,284 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_length [2021-11-16 21:42:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-16 21:42:05,284 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-16 21:42:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 21:42:05,284 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 21:42:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2021-11-16 21:42:05,284 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2021-11-16 21:42:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_pop_back [2021-11-16 21:42:05,285 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_pop_back [2021-11-16 21:42:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 21:42:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-16 21:42:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 21:42:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-16 21:42:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 21:42:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_get_at_ptr [2021-11-16 21:42:05,286 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_get_at_ptr [2021-11-16 21:42:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-11-16 21:42:05,286 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-11-16 21:42:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2021-11-16 21:42:05,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2021-11-16 21:42:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-16 21:42:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2021-11-16 21:42:05,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2021-11-16 21:42:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure aws_priority_queue_backpointer_index_valid [2021-11-16 21:42:05,286 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_priority_queue_backpointer_index_valid [2021-11-16 21:42:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_get_at [2021-11-16 21:42:05,287 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_get_at [2021-11-16 21:42:05,569 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 21:42:05,570 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 21:42:09,091 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 21:42:09,104 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 21:42:09,104 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-11-16 21:42:09,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:42:09 BoogieIcfgContainer [2021-11-16 21:42:09,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 21:42:09,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 21:42:09,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 21:42:09,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 21:42:09,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:42:03" (1/3) ... [2021-11-16 21:42:09,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e647ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:42:09, skipping insertion in model container [2021-11-16 21:42:09,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:42:04" (2/3) ... [2021-11-16 21:42:09,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e647ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:42:09, skipping insertion in model container [2021-11-16 21:42:09,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:42:09" (3/3) ... [2021-11-16 21:42:09,113 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_remove_harness.i [2021-11-16 21:42:09,120 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 21:42:09,121 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-16 21:42:09,157 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 21:42:09,165 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-16 21:42:09,165 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-16 21:42:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 456 states, 266 states have (on average 1.2744360902255638) internal successors, (339), 271 states have internal predecessors, (339), 160 states have call successors, (160), 27 states have call predecessors, (160), 27 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2021-11-16 21:42:09,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-11-16 21:42:09,206 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:42:09,206 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:42:09,207 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:42:09,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:42:09,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1226682489, now seen corresponding path program 1 times [2021-11-16 21:42:09,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:42:09,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051328634] [2021-11-16 21:42:09,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:42:09,229 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:42:09,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:42:09,230 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:42:09,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-16 21:42:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:42:09,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-16 21:42:09,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:42:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2021-11-16 21:42:09,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:42:10,244 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2021-11-16 21:42:10,244 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:42:10,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051328634] [2021-11-16 21:42:10,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051328634] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 21:42:10,245 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:42:10,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-16 21:42:10,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557151261] [2021-11-16 21:42:10,247 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 21:42:10,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-16 21:42:10,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:42:10,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-16 21:42:10,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-16 21:42:10,267 INFO L87 Difference]: Start difference. First operand has 456 states, 266 states have (on average 1.2744360902255638) internal successors, (339), 271 states have internal predecessors, (339), 160 states have call successors, (160), 27 states have call predecessors, (160), 27 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-16 21:42:10,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:42:10,335 INFO L93 Difference]: Finished difference Result 899 states and 1432 transitions. [2021-11-16 21:42:10,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-16 21:42:10,336 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 141 [2021-11-16 21:42:10,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:42:10,351 INFO L225 Difference]: With dead ends: 899 [2021-11-16 21:42:10,351 INFO L226 Difference]: Without dead ends: 449 [2021-11-16 21:42:10,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-16 21:42:10,368 INFO L933 BasicCegarLoop]: 646 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, 646 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 [2021-11-16 21:42:10,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:42:10,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-11-16 21:42:10,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2021-11-16 21:42:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 261 states have (on average 1.2375478927203065) internal successors, (323), 264 states have internal predecessors, (323), 160 states have call successors, (160), 27 states have call predecessors, (160), 26 states have return successors, (158), 158 states have call predecessors, (158), 158 states have call successors, (158) [2021-11-16 21:42:10,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 641 transitions. [2021-11-16 21:42:10,454 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 641 transitions. Word has length 141 [2021-11-16 21:42:10,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:42:10,456 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 641 transitions. [2021-11-16 21:42:10,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-16 21:42:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 641 transitions. [2021-11-16 21:42:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-16 21:42:10,464 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:42:10,465 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:42:10,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-16 21:42:10,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:42:10,682 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:42:10,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:42:10,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1411277843, now seen corresponding path program 1 times [2021-11-16 21:42:10,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:42:10,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652064192] [2021-11-16 21:42:10,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:42:10,684 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:42:10,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:42:10,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:42:10,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-16 21:42:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:42:11,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-16 21:42:11,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:42:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-11-16 21:42:11,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:42:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2021-11-16 21:42:12,053 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:42:12,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652064192] [2021-11-16 21:42:12,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652064192] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:42:12,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:42:12,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2021-11-16 21:42:12,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208504302] [2021-11-16 21:42:12,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:42:12,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 21:42:12,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:42:12,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 21:42:12,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:42:12,055 INFO L87 Difference]: Start difference. First operand 449 states and 641 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2021-11-16 21:42:14,181 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:42:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:42:14,527 INFO L93 Difference]: Finished difference Result 864 states and 1251 transitions. [2021-11-16 21:42:14,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:42:14,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 156 [2021-11-16 21:42:14,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:42:14,532 INFO L225 Difference]: With dead ends: 864 [2021-11-16 21:42:14,532 INFO L226 Difference]: Without dead ends: 451 [2021-11-16 21:42:14,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:42:14,535 INFO L933 BasicCegarLoop]: 616 mSDtfsCounter, 36 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-16 21:42:14,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 2378 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2021-11-16 21:42:14,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-11-16 21:42:14,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 451. [2021-11-16 21:42:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 262 states have (on average 1.2366412213740459) internal successors, (324), 266 states have internal predecessors, (324), 160 states have call successors, (160), 27 states have call predecessors, (160), 27 states have return successors, (172), 158 states have call predecessors, (172), 158 states have call successors, (172) [2021-11-16 21:42:14,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 656 transitions. [2021-11-16 21:42:14,553 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 656 transitions. Word has length 156 [2021-11-16 21:42:14,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:42:14,553 INFO L470 AbstractCegarLoop]: Abstraction has 451 states and 656 transitions. [2021-11-16 21:42:14,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2021-11-16 21:42:14,554 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 656 transitions. [2021-11-16 21:42:14,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-11-16 21:42:14,555 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:42:14,555 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:42:14,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-16 21:42:14,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:42:14,771 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:42:14,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:42:14,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1659857565, now seen corresponding path program 1 times [2021-11-16 21:42:14,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:42:14,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743683419] [2021-11-16 21:42:14,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:42:14,774 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:42:14,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:42:14,775 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:42:14,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-16 21:42:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:42:15,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 1296 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 21:42:15,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:42:15,847 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-11-16 21:42:15,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:42:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2021-11-16 21:42:16,531 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:42:16,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743683419] [2021-11-16 21:42:16,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743683419] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:42:16,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:42:16,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2021-11-16 21:42:16,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660891750] [2021-11-16 21:42:16,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:42:16,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 21:42:16,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:42:16,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 21:42:16,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:42:16,533 INFO L87 Difference]: Start difference. First operand 451 states and 656 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2021-11-16 21:42:18,929 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:42:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:42:19,665 INFO L93 Difference]: Finished difference Result 887 states and 1324 transitions. [2021-11-16 21:42:19,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 21:42:19,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) Word has length 164 [2021-11-16 21:42:19,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:42:19,669 INFO L225 Difference]: With dead ends: 887 [2021-11-16 21:42:19,669 INFO L226 Difference]: Without dead ends: 472 [2021-11-16 21:42:19,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:42:19,672 INFO L933 BasicCegarLoop]: 595 mSDtfsCounter, 87 mSDsluCounter, 2847 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 3442 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:42:19,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 3442 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 336 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2021-11-16 21:42:19,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-11-16 21:42:19,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 470. [2021-11-16 21:42:19,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 278 states have (on average 1.2446043165467626) internal successors, (346), 282 states have internal predecessors, (346), 162 states have call successors, (162), 27 states have call predecessors, (162), 28 states have return successors, (191), 161 states have call predecessors, (191), 160 states have call successors, (191) [2021-11-16 21:42:19,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 699 transitions. [2021-11-16 21:42:19,690 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 699 transitions. Word has length 164 [2021-11-16 21:42:19,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:42:19,690 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 699 transitions. [2021-11-16 21:42:19,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2021-11-16 21:42:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 699 transitions. [2021-11-16 21:42:19,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-11-16 21:42:19,692 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:42:19,692 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:42:19,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-16 21:42:19,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:42:19,910 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:42:19,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:42:19,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1958921511, now seen corresponding path program 1 times [2021-11-16 21:42:19,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:42:19,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359331784] [2021-11-16 21:42:19,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:42:19,912 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:42:19,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:42:19,913 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:42:19,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-16 21:42:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:42:20,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 21:42:20,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:42:21,119 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-11-16 21:42:21,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:42:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2021-11-16 21:42:21,796 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:42:21,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359331784] [2021-11-16 21:42:21,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359331784] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:42:21,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:42:21,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2021-11-16 21:42:21,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545867745] [2021-11-16 21:42:21,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:42:21,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:42:21,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:42:21,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:42:21,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:42:21,798 INFO L87 Difference]: Start difference. First operand 470 states and 699 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2021-11-16 21:42:24,108 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:42:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:42:24,638 INFO L93 Difference]: Finished difference Result 912 states and 1399 transitions. [2021-11-16 21:42:24,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 21:42:24,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 179 [2021-11-16 21:42:24,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:42:24,642 INFO L225 Difference]: With dead ends: 912 [2021-11-16 21:42:24,642 INFO L226 Difference]: Without dead ends: 478 [2021-11-16 21:42:24,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:42:24,644 INFO L933 BasicCegarLoop]: 610 mSDtfsCounter, 59 mSDsluCounter, 2326 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 2936 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-16 21:42:24,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 2936 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2021-11-16 21:42:24,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-11-16 21:42:24,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 470. [2021-11-16 21:42:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 278 states have (on average 1.2446043165467626) internal successors, (346), 282 states have internal predecessors, (346), 162 states have call successors, (162), 27 states have call predecessors, (162), 28 states have return successors, (191), 161 states have call predecessors, (191), 160 states have call successors, (191) [2021-11-16 21:42:24,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 699 transitions. [2021-11-16 21:42:24,660 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 699 transitions. Word has length 179 [2021-11-16 21:42:24,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:42:24,660 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 699 transitions. [2021-11-16 21:42:24,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2021-11-16 21:42:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 699 transitions. [2021-11-16 21:42:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-11-16 21:42:24,662 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:42:24,662 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:42:24,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-11-16 21:42:24,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:42:24,879 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:42:24,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:42:24,880 INFO L85 PathProgramCache]: Analyzing trace with hash 110275706, now seen corresponding path program 1 times [2021-11-16 21:42:24,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:42:24,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24269771] [2021-11-16 21:42:24,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:42:24,881 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:42:24,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:42:24,882 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:42:24,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-16 21:42:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:42:25,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 1418 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 21:42:25,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:42:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-11-16 21:42:26,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:42:27,034 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2021-11-16 21:42:27,035 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:42:27,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24269771] [2021-11-16 21:42:27,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24269771] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:42:27,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:42:27,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2021-11-16 21:42:27,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539839129] [2021-11-16 21:42:27,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:42:27,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:42:27,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:42:27,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:42:27,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:42:27,037 INFO L87 Difference]: Start difference. First operand 470 states and 699 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2021-11-16 21:42:29,750 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:42:30,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:42:30,831 INFO L93 Difference]: Finished difference Result 934 states and 1418 transitions. [2021-11-16 21:42:30,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 21:42:30,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 195 [2021-11-16 21:42:30,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:42:30,835 INFO L225 Difference]: With dead ends: 934 [2021-11-16 21:42:30,835 INFO L226 Difference]: Without dead ends: 500 [2021-11-16 21:42:30,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-11-16 21:42:30,837 INFO L933 BasicCegarLoop]: 595 mSDtfsCounter, 131 mSDsluCounter, 3405 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 4000 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-11-16 21:42:30,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 4000 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 569 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2021-11-16 21:42:30,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2021-11-16 21:42:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 482. [2021-11-16 21:42:30,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 288 states have (on average 1.25) internal successors, (360), 292 states have internal predecessors, (360), 163 states have call successors, (163), 28 states have call predecessors, (163), 29 states have return successors, (192), 162 states have call predecessors, (192), 161 states have call successors, (192) [2021-11-16 21:42:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 715 transitions. [2021-11-16 21:42:30,851 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 715 transitions. Word has length 195 [2021-11-16 21:42:30,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:42:30,852 INFO L470 AbstractCegarLoop]: Abstraction has 482 states and 715 transitions. [2021-11-16 21:42:30,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2021-11-16 21:42:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 715 transitions. [2021-11-16 21:42:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-11-16 21:42:30,853 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:42:30,854 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:42:30,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-16 21:42:31,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:42:31,054 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:42:31,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:42:31,055 INFO L85 PathProgramCache]: Analyzing trace with hash -2030385312, now seen corresponding path program 2 times [2021-11-16 21:42:31,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:42:31,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667462051] [2021-11-16 21:42:31,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 21:42:31,056 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:42:31,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:42:31,057 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:42:31,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-16 21:43:30,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 21:43:30,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 21:43:30,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 1492 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-16 21:43:30,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:43:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2021-11-16 21:43:31,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:43:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2021-11-16 21:43:32,134 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:43:32,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667462051] [2021-11-16 21:43:32,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667462051] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:43:32,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:43:32,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2021-11-16 21:43:32,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702654485] [2021-11-16 21:43:32,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:43:32,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:43:32,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:43:32,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:43:32,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:43:32,136 INFO L87 Difference]: Start difference. First operand 482 states and 715 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-16 21:43:35,066 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:43:37,093 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:43:39,109 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:43:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:43:40,174 INFO L93 Difference]: Finished difference Result 964 states and 1492 transitions. [2021-11-16 21:43:40,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:43:40,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 210 [2021-11-16 21:43:40,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:43:40,179 INFO L225 Difference]: With dead ends: 964 [2021-11-16 21:43:40,179 INFO L226 Difference]: Without dead ends: 518 [2021-11-16 21:43:40,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:43:40,183 INFO L933 BasicCegarLoop]: 651 mSDtfsCounter, 21 mSDsluCounter, 2378 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3029 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2021-11-16 21:43:40,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 3029 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 260 Invalid, 3 Unknown, 0 Unchecked, 7.8s Time] [2021-11-16 21:43:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-11-16 21:43:40,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 490. [2021-11-16 21:43:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 296 states have (on average 1.25) internal successors, (370), 300 states have internal predecessors, (370), 163 states have call successors, (163), 28 states have call predecessors, (163), 29 states have return successors, (192), 162 states have call predecessors, (192), 161 states have call successors, (192) [2021-11-16 21:43:40,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 725 transitions. [2021-11-16 21:43:40,208 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 725 transitions. Word has length 210 [2021-11-16 21:43:40,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:43:40,209 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 725 transitions. [2021-11-16 21:43:40,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-16 21:43:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 725 transitions. [2021-11-16 21:43:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-11-16 21:43:40,211 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:43:40,211 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:43:40,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-16 21:43:40,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:43:40,425 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:43:40,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:43:40,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1911943838, now seen corresponding path program 1 times [2021-11-16 21:43:40,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:43:40,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237090561] [2021-11-16 21:43:40,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:43:40,427 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:43:40,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:43:40,428 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:43:40,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-16 21:43:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:43:41,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 21:43:41,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:43:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2021-11-16 21:43:42,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:43:42,639 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2021-11-16 21:43:42,639 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:43:42,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237090561] [2021-11-16 21:43:42,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237090561] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:43:42,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:43:42,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2021-11-16 21:43:42,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143208790] [2021-11-16 21:43:42,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:43:42,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 21:43:42,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:43:42,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 21:43:42,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:43:42,641 INFO L87 Difference]: Start difference. First operand 490 states and 725 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-16 21:43:45,814 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:43:47,826 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:43:49,819 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:43:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:43:50,953 INFO L93 Difference]: Finished difference Result 974 states and 1502 transitions. [2021-11-16 21:43:50,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 21:43:50,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 210 [2021-11-16 21:43:50,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:43:50,958 INFO L225 Difference]: With dead ends: 974 [2021-11-16 21:43:50,958 INFO L226 Difference]: Without dead ends: 520 [2021-11-16 21:43:50,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:43:50,961 INFO L933 BasicCegarLoop]: 651 mSDtfsCounter, 17 mSDsluCounter, 3024 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 3675 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2021-11-16 21:43:50,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 3675 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 278 Invalid, 2 Unknown, 0 Unchecked, 7.9s Time] [2021-11-16 21:43:50,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-11-16 21:43:50,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 494. [2021-11-16 21:43:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 300 states have (on average 1.2466666666666666) internal successors, (374), 304 states have internal predecessors, (374), 163 states have call successors, (163), 28 states have call predecessors, (163), 29 states have return successors, (192), 162 states have call predecessors, (192), 161 states have call successors, (192) [2021-11-16 21:43:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 729 transitions. [2021-11-16 21:43:50,983 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 729 transitions. Word has length 210 [2021-11-16 21:43:50,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:43:50,984 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 729 transitions. [2021-11-16 21:43:50,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-16 21:43:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 729 transitions. [2021-11-16 21:43:50,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-11-16 21:43:50,987 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:43:50,988 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:43:51,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-16 21:43:51,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:43:51,211 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:43:51,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:43:51,212 INFO L85 PathProgramCache]: Analyzing trace with hash 349629412, now seen corresponding path program 1 times [2021-11-16 21:43:51,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:43:51,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677390771] [2021-11-16 21:43:51,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:43:51,213 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:43:51,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:43:51,214 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:43:51,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-16 21:43:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:43:51,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 1487 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-16 21:43:51,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:43:52,633 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 152 proven. 3 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2021-11-16 21:43:52,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:43:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2021-11-16 21:43:53,309 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:43:53,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677390771] [2021-11-16 21:43:53,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677390771] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 21:43:53,309 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 21:43:53,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-11-16 21:43:53,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896170187] [2021-11-16 21:43:53,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 21:43:53,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 21:43:53,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:43:53,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 21:43:53,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-16 21:43:53,310 INFO L87 Difference]: Start difference. First operand 494 states and 729 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 9 states have internal predecessors, (96), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2021-11-16 21:43:55,506 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:43:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:43:56,399 INFO L93 Difference]: Finished difference Result 937 states and 1400 transitions. [2021-11-16 21:43:56,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:43:56,400 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 9 states have internal predecessors, (96), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 210 [2021-11-16 21:43:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:43:56,403 INFO L225 Difference]: With dead ends: 937 [2021-11-16 21:43:56,403 INFO L226 Difference]: Without dead ends: 497 [2021-11-16 21:43:56,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:43:56,406 INFO L933 BasicCegarLoop]: 602 mSDtfsCounter, 11 mSDsluCounter, 3559 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 4161 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:43:56,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 4161 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 339 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2021-11-16 21:43:56,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-11-16 21:43:56,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2021-11-16 21:43:56,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 302 states have (on average 1.2417218543046358) internal successors, (375), 307 states have internal predecessors, (375), 163 states have call successors, (163), 28 states have call predecessors, (163), 30 states have return successors, (195), 162 states have call predecessors, (195), 161 states have call successors, (195) [2021-11-16 21:43:56,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 733 transitions. [2021-11-16 21:43:56,423 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 733 transitions. Word has length 210 [2021-11-16 21:43:56,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:43:56,424 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 733 transitions. [2021-11-16 21:43:56,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 9 states have internal predecessors, (96), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2021-11-16 21:43:56,424 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 733 transitions. [2021-11-16 21:43:56,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2021-11-16 21:43:56,425 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:43:56,426 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:43:56,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-16 21:43:56,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:43:56,639 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:43:56,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:43:56,640 INFO L85 PathProgramCache]: Analyzing trace with hash -239859090, now seen corresponding path program 1 times [2021-11-16 21:43:56,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:43:56,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424582413] [2021-11-16 21:43:56,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:43:56,641 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:43:56,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:43:56,642 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:43:56,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-16 21:43:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:43:57,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 1511 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-16 21:43:57,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:43:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-11-16 21:43:58,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:43:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2021-11-16 21:43:58,720 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:43:58,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424582413] [2021-11-16 21:43:58,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424582413] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:43:58,720 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:43:58,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2021-11-16 21:43:58,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999988909] [2021-11-16 21:43:58,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:43:58,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:43:58,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:43:58,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:43:58,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:43:58,722 INFO L87 Difference]: Start difference. First operand 497 states and 733 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2021-11-16 21:43:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:43:59,881 INFO L93 Difference]: Finished difference Result 958 states and 1417 transitions. [2021-11-16 21:43:59,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:43:59,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) Word has length 221 [2021-11-16 21:43:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:43:59,885 INFO L225 Difference]: With dead ends: 958 [2021-11-16 21:43:59,885 INFO L226 Difference]: Without dead ends: 497 [2021-11-16 21:43:59,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-11-16 21:43:59,888 INFO L933 BasicCegarLoop]: 598 mSDtfsCounter, 2 mSDsluCounter, 3502 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4100 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:43:59,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 4100 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-16 21:43:59,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-11-16 21:43:59,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2021-11-16 21:43:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 302 states have (on average 1.2417218543046358) internal successors, (375), 307 states have internal predecessors, (375), 163 states have call successors, (163), 28 states have call predecessors, (163), 30 states have return successors, (194), 162 states have call predecessors, (194), 161 states have call successors, (194) [2021-11-16 21:43:59,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 732 transitions. [2021-11-16 21:43:59,901 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 732 transitions. Word has length 221 [2021-11-16 21:43:59,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:43:59,902 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 732 transitions. [2021-11-16 21:43:59,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (28), 4 states have call predecessors, (28), 3 states have call successors, (28) [2021-11-16 21:43:59,902 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 732 transitions. [2021-11-16 21:43:59,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-11-16 21:43:59,903 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:43:59,903 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:43:59,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-11-16 21:44:00,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:44:00,123 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:44:00,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:44:00,124 INFO L85 PathProgramCache]: Analyzing trace with hash -592509774, now seen corresponding path program 1 times [2021-11-16 21:44:00,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:44:00,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300399146] [2021-11-16 21:44:00,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:44:00,125 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:44:00,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:44:00,126 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:44:00,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-16 21:44:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:44:00,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 1533 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-16 21:44:00,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:44:26,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2021-11-16 21:44:26,308 INFO L388 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 25 treesize of output 13 [2021-11-16 21:44:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2021-11-16 21:44:27,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:44:40,362 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-16 21:44:40,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2021-11-16 21:44:40,416 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-11-16 21:44:40,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 34 [2021-11-16 21:44:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-11-16 21:44:40,678 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:44:40,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300399146] [2021-11-16 21:44:40,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300399146] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:44:40,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:44:40,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [15] total 22 [2021-11-16 21:44:40,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87504797] [2021-11-16 21:44:40,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:44:40,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-16 21:44:40,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:44:40,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-16 21:44:40,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=401, Unknown=3, NotChecked=0, Total=462 [2021-11-16 21:44:40,680 INFO L87 Difference]: Start difference. First operand 497 states and 732 transitions. Second operand has 16 states, 16 states have (on average 6.125) internal successors, (98), 14 states have internal predecessors, (98), 6 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (29), 8 states have call predecessors, (29), 6 states have call successors, (29) [2021-11-16 21:44:48,944 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:44:50,963 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:44:52,991 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:44:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:44:55,276 INFO L93 Difference]: Finished difference Result 994 states and 1521 transitions. [2021-11-16 21:44:55,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-16 21:44:55,278 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 14 states have internal predecessors, (98), 6 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (29), 8 states have call predecessors, (29), 6 states have call successors, (29) Word has length 232 [2021-11-16 21:44:55,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:44:55,282 INFO L225 Difference]: With dead ends: 994 [2021-11-16 21:44:55,282 INFO L226 Difference]: Without dead ends: 562 [2021-11-16 21:44:55,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 439 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 39.2s TimeCoverageRelationStatistics Valid=106, Invalid=645, Unknown=5, NotChecked=0, Total=756 [2021-11-16 21:44:55,285 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 77 mSDsluCounter, 4137 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 4763 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2021-11-16 21:44:55,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 4763 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 625 Invalid, 3 Unknown, 175 Unchecked, 9.3s Time] [2021-11-16 21:44:55,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-11-16 21:44:55,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 536. [2021-11-16 21:44:55,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 330 states have (on average 1.2303030303030302) internal successors, (406), 335 states have internal predecessors, (406), 169 states have call successors, (169), 32 states have call predecessors, (169), 35 states have return successors, (215), 169 states have call predecessors, (215), 167 states have call successors, (215) [2021-11-16 21:44:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 790 transitions. [2021-11-16 21:44:55,322 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 790 transitions. Word has length 232 [2021-11-16 21:44:55,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:44:55,325 INFO L470 AbstractCegarLoop]: Abstraction has 536 states and 790 transitions. [2021-11-16 21:44:55,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 14 states have internal predecessors, (98), 6 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (29), 8 states have call predecessors, (29), 6 states have call successors, (29) [2021-11-16 21:44:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 790 transitions. [2021-11-16 21:44:55,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-11-16 21:44:55,330 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:44:55,330 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:44:55,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-16 21:44:55,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:44:55,535 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:44:55,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:44:55,535 INFO L85 PathProgramCache]: Analyzing trace with hash -399459536, now seen corresponding path program 1 times [2021-11-16 21:44:55,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:44:55,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664119642] [2021-11-16 21:44:55,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:44:55,537 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:44:55,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:44:55,538 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:44:55,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-16 21:44:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:44:56,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 1535 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-16 21:44:56,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:44:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2021-11-16 21:44:56,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:44:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2021-11-16 21:44:57,435 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:44:57,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664119642] [2021-11-16 21:44:57,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664119642] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:44:57,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:44:57,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2021-11-16 21:44:57,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364943238] [2021-11-16 21:44:57,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:44:57,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 21:44:57,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:44:57,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 21:44:57,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:44:57,437 INFO L87 Difference]: Start difference. First operand 536 states and 790 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-16 21:44:57,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:44:57,563 INFO L93 Difference]: Finished difference Result 1029 states and 1589 transitions. [2021-11-16 21:44:57,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:44:57,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 232 [2021-11-16 21:44:57,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:44:57,566 INFO L225 Difference]: With dead ends: 1029 [2021-11-16 21:44:57,566 INFO L226 Difference]: Without dead ends: 556 [2021-11-16 21:44:57,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:44:57,569 INFO L933 BasicCegarLoop]: 663 mSDtfsCounter, 8 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2628 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:44:57,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 2628 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:44:57,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-11-16 21:44:57,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 544. [2021-11-16 21:44:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 338 states have (on average 1.227810650887574) internal successors, (415), 343 states have internal predecessors, (415), 169 states have call successors, (169), 32 states have call predecessors, (169), 35 states have return successors, (215), 169 states have call predecessors, (215), 167 states have call successors, (215) [2021-11-16 21:44:57,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 799 transitions. [2021-11-16 21:44:57,586 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 799 transitions. Word has length 232 [2021-11-16 21:44:57,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:44:57,586 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 799 transitions. [2021-11-16 21:44:57,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-16 21:44:57,586 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 799 transitions. [2021-11-16 21:44:57,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-11-16 21:44:57,587 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:44:57,588 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:44:57,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-16 21:44:57,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:44:57,801 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:44:57,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:44:57,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2014363318, now seen corresponding path program 1 times [2021-11-16 21:44:57,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:44:57,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154750738] [2021-11-16 21:44:57,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:44:57,803 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:44:57,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:44:57,804 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:44:57,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-16 21:44:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:44:58,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 1537 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 21:44:58,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:44:59,196 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2021-11-16 21:44:59,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:44:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2021-11-16 21:44:59,830 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:44:59,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154750738] [2021-11-16 21:44:59,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154750738] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 21:44:59,831 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:44:59,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2021-11-16 21:44:59,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123587044] [2021-11-16 21:44:59,831 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 21:44:59,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 21:44:59,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:44:59,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 21:44:59,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:44:59,832 INFO L87 Difference]: Start difference. First operand 544 states and 799 transitions. Second operand has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (35), 3 states have call predecessors, (35), 4 states have call successors, (35) [2021-11-16 21:45:02,041 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:45:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:45:02,684 INFO L93 Difference]: Finished difference Result 988 states and 1482 transitions. [2021-11-16 21:45:02,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:45:02,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (35), 3 states have call predecessors, (35), 4 states have call successors, (35) Word has length 233 [2021-11-16 21:45:02,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:45:02,688 INFO L225 Difference]: With dead ends: 988 [2021-11-16 21:45:02,688 INFO L226 Difference]: Without dead ends: 546 [2021-11-16 21:45:02,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:45:02,690 INFO L933 BasicCegarLoop]: 608 mSDtfsCounter, 80 mSDsluCounter, 2858 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 3466 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-16 21:45:02,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 3466 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 202 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2021-11-16 21:45:02,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2021-11-16 21:45:02,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2021-11-16 21:45:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 339 states have (on average 1.2271386430678466) internal successors, (416), 345 states have internal predecessors, (416), 169 states have call successors, (169), 32 states have call predecessors, (169), 36 states have return successors, (226), 169 states have call predecessors, (226), 167 states have call successors, (226) [2021-11-16 21:45:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 811 transitions. [2021-11-16 21:45:02,706 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 811 transitions. Word has length 233 [2021-11-16 21:45:02,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:45:02,706 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 811 transitions. [2021-11-16 21:45:02,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (35), 3 states have call predecessors, (35), 4 states have call successors, (35) [2021-11-16 21:45:02,706 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 811 transitions. [2021-11-16 21:45:02,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2021-11-16 21:45:02,708 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:45:02,708 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:45:02,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-11-16 21:45:02,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:45:02,920 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:45:02,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:45:02,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2076103812, now seen corresponding path program 1 times [2021-11-16 21:45:02,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:45:02,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191252992] [2021-11-16 21:45:02,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:45:02,921 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:45:02,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:45:02,922 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:45:02,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-16 21:45:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:45:03,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 1641 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 21:45:03,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:45:04,573 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2021-11-16 21:45:04,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:45:05,396 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2021-11-16 21:45:05,396 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:45:05,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191252992] [2021-11-16 21:45:05,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191252992] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 21:45:05,397 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:45:05,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2021-11-16 21:45:05,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603444449] [2021-11-16 21:45:05,397 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 21:45:05,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:45:05,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:45:05,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:45:05,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:45:05,398 INFO L87 Difference]: Start difference. First operand 546 states and 811 transitions. Second operand has 9 states, 8 states have (on average 12.375) internal successors, (99), 9 states have internal predecessors, (99), 6 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (37), 5 states have call predecessors, (37), 6 states have call successors, (37) [2021-11-16 21:45:07,782 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:45:08,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:45:08,606 INFO L93 Difference]: Finished difference Result 993 states and 1507 transitions. [2021-11-16 21:45:08,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:45:08,612 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 12.375) internal successors, (99), 9 states have internal predecessors, (99), 6 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (37), 5 states have call predecessors, (37), 6 states have call successors, (37) Word has length 256 [2021-11-16 21:45:08,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:45:08,615 INFO L225 Difference]: With dead ends: 993 [2021-11-16 21:45:08,615 INFO L226 Difference]: Without dead ends: 549 [2021-11-16 21:45:08,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-11-16 21:45:08,617 INFO L933 BasicCegarLoop]: 602 mSDtfsCounter, 129 mSDsluCounter, 2840 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 36 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 3442 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:45:08,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 3442 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 299 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2021-11-16 21:45:08,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2021-11-16 21:45:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 547. [2021-11-16 21:45:08,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 340 states have (on average 1.2264705882352942) internal successors, (417), 346 states have internal predecessors, (417), 169 states have call successors, (169), 32 states have call predecessors, (169), 36 states have return successors, (226), 169 states have call predecessors, (226), 167 states have call successors, (226) [2021-11-16 21:45:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 812 transitions. [2021-11-16 21:45:08,634 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 812 transitions. Word has length 256 [2021-11-16 21:45:08,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:45:08,634 INFO L470 AbstractCegarLoop]: Abstraction has 547 states and 812 transitions. [2021-11-16 21:45:08,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 12.375) internal successors, (99), 9 states have internal predecessors, (99), 6 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (37), 5 states have call predecessors, (37), 6 states have call successors, (37) [2021-11-16 21:45:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 812 transitions. [2021-11-16 21:45:08,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2021-11-16 21:45:08,636 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:45:08,636 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:45:08,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-16 21:45:08,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:45:08,864 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:45:08,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:45:08,865 INFO L85 PathProgramCache]: Analyzing trace with hash 313127199, now seen corresponding path program 1 times [2021-11-16 21:45:08,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:45:08,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32027957] [2021-11-16 21:45:08,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:45:08,874 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:45:08,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:45:08,875 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:45:08,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-16 21:45:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:45:09,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 1610 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 21:45:09,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:45:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 217 proven. 3 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2021-11-16 21:45:10,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:45:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2021-11-16 21:45:11,429 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:45:11,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32027957] [2021-11-16 21:45:11,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32027957] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 21:45:11,429 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 21:45:11,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-11-16 21:45:11,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894096837] [2021-11-16 21:45:11,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 21:45:11,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 21:45:11,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:45:11,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 21:45:11,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-16 21:45:11,430 INFO L87 Difference]: Start difference. First operand 547 states and 812 transitions. Second operand has 10 states, 9 states have (on average 12.555555555555555) internal successors, (113), 10 states have internal predecessors, (113), 7 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (38), 4 states have call predecessors, (38), 7 states have call successors, (38) [2021-11-16 21:45:13,949 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:45:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:45:15,061 INFO L93 Difference]: Finished difference Result 1025 states and 1558 transitions. [2021-11-16 21:45:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:45:15,062 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.555555555555555) internal successors, (113), 10 states have internal predecessors, (113), 7 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (38), 4 states have call predecessors, (38), 7 states have call successors, (38) Word has length 257 [2021-11-16 21:45:15,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:45:15,066 INFO L225 Difference]: With dead ends: 1025 [2021-11-16 21:45:15,066 INFO L226 Difference]: Without dead ends: 580 [2021-11-16 21:45:15,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-16 21:45:15,068 INFO L933 BasicCegarLoop]: 586 mSDtfsCounter, 158 mSDsluCounter, 3896 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 4482 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-11-16 21:45:15,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 4482 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 473 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2021-11-16 21:45:15,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-11-16 21:45:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 574. [2021-11-16 21:45:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 366 states have (on average 1.2322404371584699) internal successors, (451), 371 states have internal predecessors, (451), 170 states have call successors, (170), 32 states have call predecessors, (170), 36 states have return successors, (227), 171 states have call predecessors, (227), 168 states have call successors, (227) [2021-11-16 21:45:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 848 transitions. [2021-11-16 21:45:15,085 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 848 transitions. Word has length 257 [2021-11-16 21:45:15,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:45:15,085 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 848 transitions. [2021-11-16 21:45:15,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.555555555555555) internal successors, (113), 10 states have internal predecessors, (113), 7 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (38), 4 states have call predecessors, (38), 7 states have call successors, (38) [2021-11-16 21:45:15,086 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 848 transitions. [2021-11-16 21:45:15,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2021-11-16 21:45:15,087 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:45:15,087 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:45:15,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-16 21:45:15,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:45:15,301 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:45:15,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:45:15,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1570105985, now seen corresponding path program 2 times [2021-11-16 21:45:15,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:45:15,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259880541] [2021-11-16 21:45:15,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 21:45:15,303 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:45:15,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:45:15,304 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:45:15,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-16 21:45:44,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 21:45:44,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 21:45:44,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 1758 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 21:45:44,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:45:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2021-11-16 21:45:45,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:45:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2021-11-16 21:45:46,097 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:45:46,097 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259880541] [2021-11-16 21:45:46,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259880541] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 21:45:46,097 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:45:46,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2021-11-16 21:45:46,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725776770] [2021-11-16 21:45:46,097 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 21:45:46,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-16 21:45:46,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:45:46,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-16 21:45:46,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-16 21:45:46,098 INFO L87 Difference]: Start difference. First operand 574 states and 848 transitions. Second operand has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 11 states have internal predecessors, (112), 8 states have call successors, (50), 4 states have call predecessors, (50), 2 states have return successors, (47), 8 states have call predecessors, (47), 7 states have call successors, (47) [2021-11-16 21:45:48,567 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:45:49,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:45:49,420 INFO L93 Difference]: Finished difference Result 1050 states and 1572 transitions. [2021-11-16 21:45:49,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:45:49,421 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 11 states have internal predecessors, (112), 8 states have call successors, (50), 4 states have call predecessors, (50), 2 states have return successors, (47), 8 states have call predecessors, (47), 7 states have call successors, (47) Word has length 287 [2021-11-16 21:45:49,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:45:49,424 INFO L225 Difference]: With dead ends: 1050 [2021-11-16 21:45:49,424 INFO L226 Difference]: Without dead ends: 586 [2021-11-16 21:45:49,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-11-16 21:45:49,426 INFO L933 BasicCegarLoop]: 602 mSDtfsCounter, 99 mSDsluCounter, 4587 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 5189 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:45:49,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 5189 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 362 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2021-11-16 21:45:49,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-11-16 21:45:49,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2021-11-16 21:45:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 372 states have (on average 1.2311827956989247) internal successors, (458), 377 states have internal predecessors, (458), 175 states have call successors, (175), 33 states have call predecessors, (175), 37 states have return successors, (232), 176 states have call predecessors, (232), 173 states have call successors, (232) [2021-11-16 21:45:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 865 transitions. [2021-11-16 21:45:49,443 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 865 transitions. Word has length 287 [2021-11-16 21:45:49,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:45:49,443 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 865 transitions. [2021-11-16 21:45:49,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 11 states have internal predecessors, (112), 8 states have call successors, (50), 4 states have call predecessors, (50), 2 states have return successors, (47), 8 states have call predecessors, (47), 7 states have call successors, (47) [2021-11-16 21:45:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 865 transitions. [2021-11-16 21:45:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2021-11-16 21:45:49,445 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:45:49,445 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:45:49,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-16 21:45:49,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:45:49,656 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:45:49,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:45:49,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1692182333, now seen corresponding path program 1 times [2021-11-16 21:45:49,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:45:49,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572244123] [2021-11-16 21:45:49,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:45:49,658 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:45:49,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:45:49,658 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:45:49,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-16 21:45:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:45:53,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 1906 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-16 21:45:53,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:45:54,697 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-16 21:45:54,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 5 [2021-11-16 21:45:55,452 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2021-11-16 21:45:55,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:47:22,407 WARN L227 SmtUtils]: Spent 1.44m on a formula simplification. DAG size of input: 53 DAG size of output: 45 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-16 21:47:23,271 INFO L354 Elim1Store]: treesize reduction 51, result has 40.0 percent of original size [2021-11-16 21:47:23,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 45 [2021-11-16 21:47:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 9 proven. 50 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2021-11-16 21:47:24,041 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:47:24,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572244123] [2021-11-16 21:47:24,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572244123] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:47:24,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:47:24,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 14 [2021-11-16 21:47:24,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783324381] [2021-11-16 21:47:24,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:24,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-16 21:47:24,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:47:24,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-16 21:47:24,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:47:24,043 INFO L87 Difference]: Start difference. First operand 586 states and 865 transitions. Second operand has 12 states, 11 states have (on average 10.454545454545455) internal successors, (115), 12 states have internal predecessors, (115), 7 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2021-11-16 21:47:28,865 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:47:32,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:32,923 INFO L93 Difference]: Finished difference Result 1183 states and 1850 transitions. [2021-11-16 21:47:32,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-16 21:47:32,925 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.454545454545455) internal successors, (115), 12 states have internal predecessors, (115), 7 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) Word has length 317 [2021-11-16 21:47:32,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:32,928 INFO L225 Difference]: With dead ends: 1183 [2021-11-16 21:47:32,928 INFO L226 Difference]: Without dead ends: 633 [2021-11-16 21:47:32,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2021-11-16 21:47:32,932 INFO L933 BasicCegarLoop]: 601 mSDtfsCounter, 113 mSDsluCounter, 5051 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 5652 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:47:32,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 5652 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1264 Invalid, 1 Unknown, 0 Unchecked, 8.1s Time] [2021-11-16 21:47:32,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2021-11-16 21:47:32,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 592. [2021-11-16 21:47:32,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 376 states have (on average 1.2207446808510638) internal successors, (459), 381 states have internal predecessors, (459), 175 states have call successors, (175), 33 states have call predecessors, (175), 39 states have return successors, (251), 178 states have call predecessors, (251), 173 states have call successors, (251) [2021-11-16 21:47:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 885 transitions. [2021-11-16 21:47:32,951 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 885 transitions. Word has length 317 [2021-11-16 21:47:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:32,952 INFO L470 AbstractCegarLoop]: Abstraction has 592 states and 885 transitions. [2021-11-16 21:47:32,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.454545454545455) internal successors, (115), 12 states have internal predecessors, (115), 7 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2021-11-16 21:47:32,952 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 885 transitions. [2021-11-16 21:47:32,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2021-11-16 21:47:32,954 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:32,954 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:47:33,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-11-16 21:47:33,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:47:33,162 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:33,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:33,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1328352547, now seen corresponding path program 1 times [2021-11-16 21:47:33,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:47:33,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180121789] [2021-11-16 21:47:33,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:33,164 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:47:33,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:47:33,166 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:47:33,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-16 21:47:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:34,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 1829 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 21:47:34,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:47:34,951 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2021-11-16 21:47:34,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:47:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2021-11-16 21:47:35,542 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:47:35,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180121789] [2021-11-16 21:47:35,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180121789] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:47:35,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:47:35,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2021-11-16 21:47:35,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225491621] [2021-11-16 21:47:35,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:35,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 21:47:35,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:47:35,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 21:47:35,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 21:47:35,544 INFO L87 Difference]: Start difference. First operand 592 states and 885 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2021-11-16 21:47:35,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:35,620 INFO L93 Difference]: Finished difference Result 1148 states and 1819 transitions. [2021-11-16 21:47:35,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:47:35,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 302 [2021-11-16 21:47:35,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:35,624 INFO L225 Difference]: With dead ends: 1148 [2021-11-16 21:47:35,624 INFO L226 Difference]: Without dead ends: 592 [2021-11-16 21:47:35,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:47:35,628 INFO L933 BasicCegarLoop]: 644 mSDtfsCounter, 7 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:47:35,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 1912 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:47:35,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2021-11-16 21:47:35,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2021-11-16 21:47:35,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 376 states have (on average 1.2154255319148937) internal successors, (457), 381 states have internal predecessors, (457), 175 states have call successors, (175), 33 states have call predecessors, (175), 39 states have return successors, (251), 178 states have call predecessors, (251), 173 states have call successors, (251) [2021-11-16 21:47:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 883 transitions. [2021-11-16 21:47:35,646 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 883 transitions. Word has length 302 [2021-11-16 21:47:35,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:35,647 INFO L470 AbstractCegarLoop]: Abstraction has 592 states and 883 transitions. [2021-11-16 21:47:35,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2021-11-16 21:47:35,647 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 883 transitions. [2021-11-16 21:47:35,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2021-11-16 21:47:35,649 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:35,649 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:47:35,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-16 21:47:35,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:47:35,869 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:35,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:35,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1312054999, now seen corresponding path program 1 times [2021-11-16 21:47:35,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:47:35,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950088846] [2021-11-16 21:47:35,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:35,871 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:47:35,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:47:35,872 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:47:35,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-16 21:47:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:36,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 1846 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-16 21:47:36,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:47:37,686 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2021-11-16 21:47:37,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:47:38,363 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2021-11-16 21:47:38,364 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:47:38,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950088846] [2021-11-16 21:47:38,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950088846] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:47:38,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:47:38,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-11-16 21:47:38,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791581247] [2021-11-16 21:47:38,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:38,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 21:47:38,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:47:38,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 21:47:38,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:47:38,365 INFO L87 Difference]: Start difference. First operand 592 states and 883 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-16 21:47:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:38,508 INFO L93 Difference]: Finished difference Result 1129 states and 1758 transitions. [2021-11-16 21:47:38,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-16 21:47:38,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 308 [2021-11-16 21:47:38,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:38,513 INFO L225 Difference]: With dead ends: 1129 [2021-11-16 21:47:38,513 INFO L226 Difference]: Without dead ends: 597 [2021-11-16 21:47:38,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:47:38,516 INFO L933 BasicCegarLoop]: 633 mSDtfsCounter, 7 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:47:38,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 1890 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:47:38,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2021-11-16 21:47:38,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 593. [2021-11-16 21:47:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 377 states have (on average 1.2148541114058355) internal successors, (458), 382 states have internal predecessors, (458), 175 states have call successors, (175), 33 states have call predecessors, (175), 39 states have return successors, (251), 178 states have call predecessors, (251), 173 states have call successors, (251) [2021-11-16 21:47:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 884 transitions. [2021-11-16 21:47:38,535 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 884 transitions. Word has length 308 [2021-11-16 21:47:38,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:38,535 INFO L470 AbstractCegarLoop]: Abstraction has 593 states and 884 transitions. [2021-11-16 21:47:38,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2021-11-16 21:47:38,536 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 884 transitions. [2021-11-16 21:47:38,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2021-11-16 21:47:38,537 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:38,537 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:47:38,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-11-16 21:47:38,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:47:38,752 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:38,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:38,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1982601358, now seen corresponding path program 1 times [2021-11-16 21:47:38,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:47:38,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912854955] [2021-11-16 21:47:38,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:38,754 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:47:38,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:47:38,755 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:47:38,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-16 21:47:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:39,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 1926 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-16 21:47:39,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:47:40,789 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2021-11-16 21:47:40,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:47:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 9 proven. 31 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2021-11-16 21:47:41,700 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:47:41,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912854955] [2021-11-16 21:47:41,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912854955] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:47:41,700 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:47:41,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 11 [2021-11-16 21:47:41,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505118965] [2021-11-16 21:47:41,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:41,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 21:47:41,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:47:41,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 21:47:41,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:47:41,701 INFO L87 Difference]: Start difference. First operand 593 states and 884 transitions. Second operand has 10 states, 9 states have (on average 14.11111111111111) internal successors, (127), 8 states have internal predecessors, (127), 3 states have call successors, (35), 2 states have call predecessors, (35), 5 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2021-11-16 21:47:43,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:43,055 INFO L93 Difference]: Finished difference Result 1142 states and 1762 transitions. [2021-11-16 21:47:43,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 21:47:43,056 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.11111111111111) internal successors, (127), 8 states have internal predecessors, (127), 3 states have call successors, (35), 2 states have call predecessors, (35), 5 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) Word has length 325 [2021-11-16 21:47:43,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:43,060 INFO L225 Difference]: With dead ends: 1142 [2021-11-16 21:47:43,060 INFO L226 Difference]: Without dead ends: 612 [2021-11-16 21:47:43,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:47:43,062 INFO L933 BasicCegarLoop]: 616 mSDtfsCounter, 4 mSDsluCounter, 4827 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5443 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:47:43,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 5443 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-16 21:47:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2021-11-16 21:47:43,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 595. [2021-11-16 21:47:43,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 378 states have (on average 1.2142857142857142) internal successors, (459), 384 states have internal predecessors, (459), 175 states have call successors, (175), 33 states have call predecessors, (175), 40 states have return successors, (257), 178 states have call predecessors, (257), 173 states have call successors, (257) [2021-11-16 21:47:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 891 transitions. [2021-11-16 21:47:43,081 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 891 transitions. Word has length 325 [2021-11-16 21:47:43,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:43,081 INFO L470 AbstractCegarLoop]: Abstraction has 595 states and 891 transitions. [2021-11-16 21:47:43,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.11111111111111) internal successors, (127), 8 states have internal predecessors, (127), 3 states have call successors, (35), 2 states have call predecessors, (35), 5 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2021-11-16 21:47:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 891 transitions. [2021-11-16 21:47:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2021-11-16 21:47:43,083 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:43,083 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:47:43,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2021-11-16 21:47:43,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:47:43,298 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:43,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:43,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1435376195, now seen corresponding path program 1 times [2021-11-16 21:47:43,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:47:43,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522766996] [2021-11-16 21:47:43,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:43,300 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:47:43,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:47:43,300 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-16 21:47:43,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-11-16 21:48:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:48:47,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 1914 conjuncts, 102 conjunts are in the unsatisfiable core [2021-11-16 21:48:47,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:48:47,545 INFO L388 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 [2021-11-16 21:48:48,134 INFO L388 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 23 treesize of output 19 [2021-11-16 21:48:48,142 INFO L388 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 [2021-11-16 21:48:55,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:48:55,772 INFO L388 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 23 treesize of output 22 [2021-11-16 21:48:55,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:48:55,791 INFO L388 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 23 treesize of output 22 [2021-11-16 21:48:56,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:48:56,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-16 21:48:56,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:48:56,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-16 21:48:56,705 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-16 21:48:56,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2021-11-16 21:48:56,714 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-16 21:48:56,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2021-11-16 21:50:08,962 WARN L860 $PredicateComparison]: unable to prove that (exists ((|aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| (_ BitVec 64))) (let ((.cse1 (bvadd (_ bv4 64) |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset|))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_aws_mul_size_checked_#in~r#1.base| (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_aws_mul_size_checked_#in~r#1.base|))) (store (store (select |c_old(#memory_$Pointer$.offset)| |c_aws_mul_size_checked_#in~r#1.base|) |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| (select .cse0 |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset|)) .cse1 (select .cse0 .cse1))))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_aws_mul_size_checked_#in~r#1.base| (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_aws_mul_size_checked_#in~r#1.base|))) (store (store (select |c_old(#memory_$Pointer$.base)| |c_aws_mul_size_checked_#in~r#1.base|) |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| (select .cse2 |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset|)) .cse1 (select .cse2 .cse1)))))))) is different from true [2021-11-16 21:51:58,593 INFO L354 Elim1Store]: treesize reduction 561, result has 0.2 percent of original size [2021-11-16 21:51:58,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 196 treesize of output 1 [2021-11-16 21:51:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 310 proven. 22 refuted. 0 times theorem prover too weak. 315 trivial. 3 not checked. [2021-11-16 21:51:59,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:52:09,333 WARN L227 SmtUtils]: Spent 5.55s on a formula simplification. DAG size of input: 157 DAG size of output: 147 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) Killed by 15