./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_priority_queue_pop_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_pop_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 71774aeec0d0f8840a1b18b633767b26c38c9eb9d26569d28cdf01c44c9881ac --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 21:40:22,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 21:40:22,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 21:40:23,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 21:40:23,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 21:40:23,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 21:40:23,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 21:40:23,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 21:40:23,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 21:40:23,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 21:40:23,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 21:40:23,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 21:40:23,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 21:40:23,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 21:40:23,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 21:40:23,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 21:40:23,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 21:40:23,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 21:40:23,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 21:40:23,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 21:40:23,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 21:40:23,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 21:40:23,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 21:40:23,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 21:40:23,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 21:40:23,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 21:40:23,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 21:40:23,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 21:40:23,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 21:40:23,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 21:40:23,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 21:40:23,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 21:40:23,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 21:40:23,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 21:40:23,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 21:40:23,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 21:40:23,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 21:40:23,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 21:40:23,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 21:40:23,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 21:40:23,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 21:40:23,036 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:40:23,065 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 21:40:23,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 21:40:23,073 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 21:40:23,073 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 21:40:23,074 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 21:40:23,074 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 21:40:23,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 21:40:23,075 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 21:40:23,075 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 21:40:23,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 21:40:23,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-16 21:40:23,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 21:40:23,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 21:40:23,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 21:40:23,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 21:40:23,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 21:40:23,077 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 21:40:23,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 21:40:23,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 21:40:23,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 21:40:23,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 21:40:23,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:40:23,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 21:40:23,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 21:40:23,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 21:40:23,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-16 21:40:23,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-16 21:40:23,079 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 21:40:23,080 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 21:40:23,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 21:40:23,080 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 21:40:23,080 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 -> 71774aeec0d0f8840a1b18b633767b26c38c9eb9d26569d28cdf01c44c9881ac [2021-11-16 21:40:23,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 21:40:23,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 21:40:23,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 21:40:23,326 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 21:40:23,326 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 21:40:23,327 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_pop_harness.i [2021-11-16 21:40:23,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c262cad7/2e07545db7bc48fbb36ca33b98e30a71/FLAG3649f4b9f [2021-11-16 21:40:24,009 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 21:40:24,013 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_pop_harness.i [2021-11-16 21:40:24,067 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c262cad7/2e07545db7bc48fbb36ca33b98e30a71/FLAG3649f4b9f [2021-11-16 21:40:24,135 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c262cad7/2e07545db7bc48fbb36ca33b98e30a71 [2021-11-16 21:40:24,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 21:40:24,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 21:40:24,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 21:40:24,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 21:40:24,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 21:40:24,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:40:24" (1/1) ... [2021-11-16 21:40:24,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17fee73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:40:24, skipping insertion in model container [2021-11-16 21:40:24,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:40:24" (1/1) ... [2021-11-16 21:40:24,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 21:40:24,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 21:40:24,490 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_pop_harness.i[4496,4509] [2021-11-16 21:40:24,496 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_pop_harness.i[4556,4569] [2021-11-16 21:40:24,509 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:40:24,515 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:40:25,097 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,099 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,100 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,101 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,102 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,114 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,114 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,116 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,116 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,117 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,118 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,119 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,119 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,391 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:40:25,393 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:40:25,394 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:40:25,395 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:40:25,396 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:40:25,396 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:40:25,397 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:40:25,402 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:40:25,402 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:40:25,405 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:40:25,526 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:40:25,560 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,573 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,644 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,644 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,645 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,645 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,645 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,646 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,646 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,646 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,647 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,647 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,647 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,647 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,648 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,656 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,657 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,657 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,657 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,661 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,662 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,671 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,672 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,672 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,685 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:40:25,721 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 21:40:25,733 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_pop_harness.i[4496,4509] [2021-11-16 21:40:25,743 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_pop_harness.i[4556,4569] [2021-11-16 21:40:25,748 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:40:25,748 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:40:25,771 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,772 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,772 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,772 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,773 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,777 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,777 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,778 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,778 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,779 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,780 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,780 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,780 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,805 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:40:25,806 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:40:25,807 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:40:25,807 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:40:25,808 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:40:25,808 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:40:25,809 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:40:25,809 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:40:25,810 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:40:25,810 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:40:25,840 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:40:25,852 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,858 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,879 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,880 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,880 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,881 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,881 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,881 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,882 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,882 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,883 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,883 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,883 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,884 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,884 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,885 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,886 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,886 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,887 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,890 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,890 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,897 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,898 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,898 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:40:25,910 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:40:26,107 INFO L208 MainTranslator]: Completed translation [2021-11-16 21:40:26,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:40:26 WrapperNode [2021-11-16 21:40:26,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 21:40:26,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 21:40:26,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 21:40:26,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 21:40:26,117 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:40:26" (1/1) ... [2021-11-16 21:40:26,205 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:40:26" (1/1) ... [2021-11-16 21:40:26,281 INFO L137 Inliner]: procedures = 699, calls = 1920, calls flagged for inlining = 60, calls inlined = 15, statements flattened = 1030 [2021-11-16 21:40:26,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 21:40:26,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 21:40:26,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 21:40:26,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 21:40:26,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:40:26" (1/1) ... [2021-11-16 21:40:26,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:40:26" (1/1) ... [2021-11-16 21:40:26,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:40:26" (1/1) ... [2021-11-16 21:40:26,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:40:26" (1/1) ... [2021-11-16 21:40:26,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:40:26" (1/1) ... [2021-11-16 21:40:26,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:40:26" (1/1) ... [2021-11-16 21:40:26,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:40:26" (1/1) ... [2021-11-16 21:40:26,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 21:40:26,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 21:40:26,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 21:40:26,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 21:40:26,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:40:26" (1/1) ... [2021-11-16 21:40:26,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:40:26,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:40:26,444 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:40:26,467 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:40:26,493 INFO L130 BoogieDeclarations]: Found specification of procedure s_swap [2021-11-16 21:40:26,494 INFO L138 BoogieDeclarations]: Found implementation of procedure s_swap [2021-11-16 21:40:26,494 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2021-11-16 21:40:26,494 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2021-11-16 21:40:26,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 21:40:26,494 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2021-11-16 21:40:26,494 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2021-11-16 21:40:26,494 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2021-11-16 21:40:26,495 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2021-11-16 21:40:26,495 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-11-16 21:40:26,495 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-11-16 21:40:26,495 INFO L130 BoogieDeclarations]: Found specification of procedure s_sift_up [2021-11-16 21:40:26,496 INFO L138 BoogieDeclarations]: Found implementation of procedure s_sift_up [2021-11-16 21:40:26,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-16 21:40:26,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-16 21:40:26,496 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2021-11-16 21:40:26,497 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2021-11-16 21:40:26,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 21:40:26,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 21:40:26,500 INFO L130 BoogieDeclarations]: Found specification of procedure s_remove_node [2021-11-16 21:40:26,500 INFO L138 BoogieDeclarations]: Found implementation of procedure s_remove_node [2021-11-16 21:40:26,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 21:40:26,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 21:40:26,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 21:40:26,501 INFO L130 BoogieDeclarations]: Found specification of procedure my_abort [2021-11-16 21:40:26,501 INFO L138 BoogieDeclarations]: Found implementation of procedure my_abort [2021-11-16 21:40:26,505 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2021-11-16 21:40:26,506 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2021-11-16 21:40:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 21:40:26,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 21:40:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 21:40:26,506 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 21:40:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2021-11-16 21:40:26,507 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2021-11-16 21:40:26,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-16 21:40:26,507 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2021-11-16 21:40:26,507 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2021-11-16 21:40:26,507 INFO L130 BoogieDeclarations]: Found specification of procedure aws_priority_queue_is_valid [2021-11-16 21:40:26,507 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_priority_queue_is_valid [2021-11-16 21:40:26,507 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_length [2021-11-16 21:40:26,508 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_length [2021-11-16 21:40:26,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-16 21:40:26,508 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-16 21:40:26,508 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 21:40:26,508 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 21:40:26,508 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2021-11-16 21:40:26,508 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2021-11-16 21:40:26,509 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_pop_back [2021-11-16 21:40:26,509 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_pop_back [2021-11-16 21:40:26,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 21:40:26,509 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-16 21:40:26,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 21:40:26,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 21:40:26,509 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_get_at_ptr [2021-11-16 21:40:26,510 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_get_at_ptr [2021-11-16 21:40:26,510 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-11-16 21:40:26,510 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-11-16 21:40:26,510 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2021-11-16 21:40:26,510 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2021-11-16 21:40:26,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-16 21:40:26,510 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2021-11-16 21:40:26,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2021-11-16 21:40:26,511 INFO L130 BoogieDeclarations]: Found specification of procedure aws_priority_queue_backpointer_index_valid [2021-11-16 21:40:26,511 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_priority_queue_backpointer_index_valid [2021-11-16 21:40:26,511 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-16 21:40:26,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-16 21:40:26,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-16 21:40:26,511 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_get_at [2021-11-16 21:40:26,512 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_get_at [2021-11-16 21:40:26,887 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 21:40:26,889 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 21:40:29,822 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 21:40:29,831 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 21:40:29,831 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-16 21:40:29,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:40:29 BoogieIcfgContainer [2021-11-16 21:40:29,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 21:40:29,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 21:40:29,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 21:40:29,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 21:40:29,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:40:24" (1/3) ... [2021-11-16 21:40:29,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9dbadc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:40:29, skipping insertion in model container [2021-11-16 21:40:29,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:40:26" (2/3) ... [2021-11-16 21:40:29,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9dbadc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:40:29, skipping insertion in model container [2021-11-16 21:40:29,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:40:29" (3/3) ... [2021-11-16 21:40:29,840 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_pop_harness.i [2021-11-16 21:40:29,844 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 21:40:29,844 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-16 21:40:29,881 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 21:40:29,886 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:40:29,887 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-16 21:40:29,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 448 states, 263 states have (on average 1.2623574144486691) internal successors, (332), 266 states have internal predecessors, (332), 156 states have call successors, (156), 27 states have call predecessors, (156), 27 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2021-11-16 21:40:29,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-11-16 21:40:29,920 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:40:29,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:29,921 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:40:29,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:40:29,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1140837343, now seen corresponding path program 1 times [2021-11-16 21:40:29,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:40:29,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307683684] [2021-11-16 21:40:29,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:40:29,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:40:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:40:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:40:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 21:40:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 21:40:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:40:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:40:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-16 21:40:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:40:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:40:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-16 21:40:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-16 21:40:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 21:40:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:40:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 21:40:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-16 21:40:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-16 21:40:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 21:40:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-16 21:40:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-16 21:40:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-16 21:40:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-16 21:40:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2021-11-16 21:40:30,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:40:30,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307683684] [2021-11-16 21:40:30,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307683684] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:40:30,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:40:30,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 21:40:30,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130689451] [2021-11-16 21:40:30,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:40:30,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 21:40:30,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:40:30,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 21:40:30,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:40:30,835 INFO L87 Difference]: Start difference. First operand has 448 states, 263 states have (on average 1.2623574144486691) internal successors, (332), 266 states have internal predecessors, (332), 156 states have call successors, (156), 27 states have call predecessors, (156), 27 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 5 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-16 21:40:33,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:40:33,333 INFO L93 Difference]: Finished difference Result 1063 states and 1806 transitions. [2021-11-16 21:40:33,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:40:33,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 5 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 133 [2021-11-16 21:40:33,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:40:33,350 INFO L225 Difference]: With dead ends: 1063 [2021-11-16 21:40:33,350 INFO L226 Difference]: Without dead ends: 621 [2021-11-16 21:40:33,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:40:33,360 INFO L933 BasicCegarLoop]: 690 mSDtfsCounter, 465 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 768 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 768 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-16 21:40:33,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 963 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [768 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-16 21:40:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2021-11-16 21:40:33,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 441. [2021-11-16 21:40:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 257 states have (on average 1.2373540856031129) internal successors, (318), 260 states have internal predecessors, (318), 156 states have call successors, (156), 27 states have call predecessors, (156), 26 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2021-11-16 21:40:33,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 628 transitions. [2021-11-16 21:40:33,457 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 628 transitions. Word has length 133 [2021-11-16 21:40:33,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:40:33,458 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 628 transitions. [2021-11-16 21:40:33,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 5 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-16 21:40:33,458 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 628 transitions. [2021-11-16 21:40:33,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-11-16 21:40:33,462 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:40:33,462 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:33,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-16 21:40:33,462 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:40:33,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:40:33,463 INFO L85 PathProgramCache]: Analyzing trace with hash 826891299, now seen corresponding path program 1 times [2021-11-16 21:40:33,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:40:33,464 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824516338] [2021-11-16 21:40:33,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:40:33,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:40:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:40:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:40:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 21:40:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 21:40:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:40:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:40:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-16 21:40:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:40:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:40:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-16 21:40:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-16 21:40:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 21:40:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:40:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 21:40:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-16 21:40:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-16 21:40:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 21:40:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-16 21:40:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-16 21:40:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-16 21:40:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-16 21:40:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2021-11-16 21:40:33,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:40:33,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824516338] [2021-11-16 21:40:33,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824516338] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:40:33,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725532138] [2021-11-16 21:40:33,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:40:33,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:40:33,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:40:33,971 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:40:34,011 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:40:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:34,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 2262 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-16 21:40:34,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:40:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-11-16 21:40:34,828 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:40:34,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725532138] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:40:34,829 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:40:34,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2021-11-16 21:40:34,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615979916] [2021-11-16 21:40:34,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:40:34,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:40:34,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:40:34,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:40:34,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-16 21:40:34,835 INFO L87 Difference]: Start difference. First operand 441 states and 628 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-16 21:40:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:40:35,896 INFO L93 Difference]: Finished difference Result 848 states and 1225 transitions. [2021-11-16 21:40:35,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:40:35,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 133 [2021-11-16 21:40:35,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:40:35,900 INFO L225 Difference]: With dead ends: 848 [2021-11-16 21:40:35,900 INFO L226 Difference]: Without dead ends: 443 [2021-11-16 21:40:35,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 168 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:40:35,904 INFO L933 BasicCegarLoop]: 568 mSDtfsCounter, 643 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:40:35,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [665 Valid, 2194 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-16 21:40:35,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-11-16 21:40:35,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2021-11-16 21:40:35,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 258 states have (on average 1.2364341085271318) internal successors, (319), 262 states have internal predecessors, (319), 156 states have call successors, (156), 27 states have call predecessors, (156), 27 states have return successors, (167), 154 states have call predecessors, (167), 154 states have call successors, (167) [2021-11-16 21:40:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 642 transitions. [2021-11-16 21:40:35,938 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 642 transitions. Word has length 133 [2021-11-16 21:40:35,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:40:35,939 INFO L470 AbstractCegarLoop]: Abstraction has 443 states and 642 transitions. [2021-11-16 21:40:35,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-16 21:40:35,940 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 642 transitions. [2021-11-16 21:40:35,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-11-16 21:40:35,942 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:40:35,942 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:40:35,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-16 21:40:36,159 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:40:36,159 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:40:36,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:40:36,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1886231881, now seen corresponding path program 1 times [2021-11-16 21:40:36,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:40:36,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611647229] [2021-11-16 21:40:36,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:40:36,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:40:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:40:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-16 21:40:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 21:40:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 21:40:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:40:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:40:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-16 21:40:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:40:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:40:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-16 21:40:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:40:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-16 21:40:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-16 21:40:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:40:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:40:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-16 21:40:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-16 21:40:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-16 21:40:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-11-16 21:40:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-16 21:40:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-16 21:40:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-16 21:40:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2021-11-16 21:40:36,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:40:36,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611647229] [2021-11-16 21:40:36,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611647229] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:40:36,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914857667] [2021-11-16 21:40:36,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:40:36,578 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:40:36,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:40:36,579 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:40:36,592 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:40:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:37,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 2312 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-16 21:40:37,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:40:37,421 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-11-16 21:40:37,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:40:37,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914857667] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:40:37,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:40:37,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2021-11-16 21:40:37,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632510546] [2021-11-16 21:40:37,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:40:37,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:40:37,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:40:37,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:40:37,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-11-16 21:40:37,425 INFO L87 Difference]: Start difference. First operand 443 states and 642 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2021-11-16 21:40:38,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:40:38,890 INFO L93 Difference]: Finished difference Result 871 states and 1296 transitions. [2021-11-16 21:40:38,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:40:38,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 141 [2021-11-16 21:40:38,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:40:38,897 INFO L225 Difference]: With dead ends: 871 [2021-11-16 21:40:38,897 INFO L226 Difference]: Without dead ends: 464 [2021-11-16 21:40:38,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2021-11-16 21:40:38,903 INFO L933 BasicCegarLoop]: 565 mSDtfsCounter, 667 mSDsluCounter, 2673 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 3238 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-16 21:40:38,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [717 Valid, 3238 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-16 21:40:38,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-11-16 21:40:38,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 462. [2021-11-16 21:40:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 274 states have (on average 1.2445255474452555) internal successors, (341), 278 states have internal predecessors, (341), 158 states have call successors, (158), 27 states have call predecessors, (158), 28 states have return successors, (186), 157 states have call predecessors, (186), 156 states have call successors, (186) [2021-11-16 21:40:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 685 transitions. [2021-11-16 21:40:38,948 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 685 transitions. Word has length 141 [2021-11-16 21:40:38,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:40:38,949 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 685 transitions. [2021-11-16 21:40:38,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2021-11-16 21:40:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 685 transitions. [2021-11-16 21:40:38,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-16 21:40:38,954 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:40:38,954 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:40:38,974 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:40:39,155 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:40:39,156 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:40:39,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:40:39,156 INFO L85 PathProgramCache]: Analyzing trace with hash -523305437, now seen corresponding path program 1 times [2021-11-16 21:40:39,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:40:39,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759323289] [2021-11-16 21:40:39,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:40:39,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:40:39,203 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:40:39,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1921510575] [2021-11-16 21:40:39,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:40:39,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:40:39,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:40:39,205 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:40:39,207 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:40:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:39,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 2433 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-16 21:40:39,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:40:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-11-16 21:40:40,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:40:40,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:40:40,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759323289] [2021-11-16 21:40:40,012 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:40:40,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921510575] [2021-11-16 21:40:40,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921510575] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:40:40,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:40:40,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-16 21:40:40,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124031267] [2021-11-16 21:40:40,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:40:40,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 21:40:40,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:40:40,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 21:40:40,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:40:40,014 INFO L87 Difference]: Start difference. First operand 462 states and 685 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2021-11-16 21:40:41,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:40:41,209 INFO L93 Difference]: Finished difference Result 896 states and 1369 transitions. [2021-11-16 21:40:41,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:40:41,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 156 [2021-11-16 21:40:41,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:40:41,214 INFO L225 Difference]: With dead ends: 896 [2021-11-16 21:40:41,214 INFO L226 Difference]: Without dead ends: 470 [2021-11-16 21:40:41,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-11-16 21:40:41,219 INFO L933 BasicCegarLoop]: 562 mSDtfsCounter, 667 mSDsluCounter, 2145 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 2707 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:40:41,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [689 Valid, 2707 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-16 21:40:41,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-11-16 21:40:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 462. [2021-11-16 21:40:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 274 states have (on average 1.2445255474452555) internal successors, (341), 278 states have internal predecessors, (341), 158 states have call successors, (158), 27 states have call predecessors, (158), 28 states have return successors, (186), 157 states have call predecessors, (186), 156 states have call successors, (186) [2021-11-16 21:40:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 685 transitions. [2021-11-16 21:40:41,243 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 685 transitions. Word has length 156 [2021-11-16 21:40:41,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:40:41,244 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 685 transitions. [2021-11-16 21:40:41,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2021-11-16 21:40:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 685 transitions. [2021-11-16 21:40:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-11-16 21:40:41,246 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:40:41,246 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:41,270 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:40:41,459 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:40:41,460 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:40:41,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:40:41,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1664024204, now seen corresponding path program 1 times [2021-11-16 21:40:41,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:40:41,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946522212] [2021-11-16 21:40:41,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:40:41,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:40:41,505 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:40:41,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [471651525] [2021-11-16 21:40:41,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:40:41,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:40:41,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:40:41,507 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:40:41,529 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:40:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:41,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 2505 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-16 21:40:41,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:40:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-11-16 21:40:42,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:40:42,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:40:42,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946522212] [2021-11-16 21:40:42,288 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:40:42,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471651525] [2021-11-16 21:40:42,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471651525] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:40:42,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:40:42,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 21:40:42,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199319880] [2021-11-16 21:40:42,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:40:42,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:40:42,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:40:42,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:40:42,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:40:42,290 INFO L87 Difference]: Start difference. First operand 462 states and 685 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2021-11-16 21:40:45,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:40:45,039 INFO L93 Difference]: Finished difference Result 906 states and 1373 transitions. [2021-11-16 21:40:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 21:40:45,040 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) Word has length 172 [2021-11-16 21:40:45,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:40:45,044 INFO L225 Difference]: With dead ends: 906 [2021-11-16 21:40:45,045 INFO L226 Difference]: Without dead ends: 480 [2021-11-16 21:40:45,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 166 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:40:45,049 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 732 mSDsluCounter, 3103 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 3644 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-11-16 21:40:45,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [782 Valid, 3644 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2021-11-16 21:40:45,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-11-16 21:40:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 462. [2021-11-16 21:40:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 274 states have (on average 1.2445255474452555) internal successors, (341), 278 states have internal predecessors, (341), 158 states have call successors, (158), 27 states have call predecessors, (158), 28 states have return successors, (186), 157 states have call predecessors, (186), 156 states have call successors, (186) [2021-11-16 21:40:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 685 transitions. [2021-11-16 21:40:45,077 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 685 transitions. Word has length 172 [2021-11-16 21:40:45,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:40:45,078 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 685 transitions. [2021-11-16 21:40:45,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2021-11-16 21:40:45,078 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 685 transitions. [2021-11-16 21:40:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-11-16 21:40:45,082 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:40:45,082 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:45,112 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:40:45,295 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:40:45,295 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:40:45,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:40:45,296 INFO L85 PathProgramCache]: Analyzing trace with hash -294824304, now seen corresponding path program 2 times [2021-11-16 21:40:45,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:40:45,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698781019] [2021-11-16 21:40:45,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:40:45,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:40:45,347 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:40:45,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1759293624] [2021-11-16 21:40:45,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 21:40:45,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:40:45,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:40:45,350 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:40:45,377 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:40:45,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 21:40:45,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 21:40:45,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 2626 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-16 21:40:46,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:40:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-11-16 21:40:46,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:40:46,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:40:46,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698781019] [2021-11-16 21:40:46,361 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:40:46,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759293624] [2021-11-16 21:40:46,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759293624] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:40:46,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:40:46,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-16 21:40:46,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888693063] [2021-11-16 21:40:46,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:40:46,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 21:40:46,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:40:46,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 21:40:46,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:40:46,364 INFO L87 Difference]: Start difference. First operand 462 states and 685 transitions. Second operand has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2021-11-16 21:40:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:40:48,740 INFO L93 Difference]: Finished difference Result 858 states and 1293 transitions. [2021-11-16 21:40:48,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 21:40:48,740 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 187 [2021-11-16 21:40:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:40:48,744 INFO L225 Difference]: With dead ends: 858 [2021-11-16 21:40:48,745 INFO L226 Difference]: Without dead ends: 464 [2021-11-16 21:40:48,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:40:48,748 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 655 mSDsluCounter, 2178 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-16 21:40:48,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [677 Valid, 2745 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-16 21:40:48,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-11-16 21:40:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2021-11-16 21:40:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 275 states have (on average 1.2436363636363637) internal successors, (342), 280 states have internal predecessors, (342), 158 states have call successors, (158), 27 states have call predecessors, (158), 29 states have return successors, (197), 157 states have call predecessors, (197), 156 states have call successors, (197) [2021-11-16 21:40:48,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 697 transitions. [2021-11-16 21:40:48,769 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 697 transitions. Word has length 187 [2021-11-16 21:40:48,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:40:48,770 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 697 transitions. [2021-11-16 21:40:48,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2021-11-16 21:40:48,770 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 697 transitions. [2021-11-16 21:40:48,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-11-16 21:40:48,772 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:40:48,772 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:48,807 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:40:48,999 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:40:49,000 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:40:49,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:40:49,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1770519646, now seen corresponding path program 1 times [2021-11-16 21:40:49,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:40:49,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753016602] [2021-11-16 21:40:49,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:40:49,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:40:49,055 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:40:49,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2068883507] [2021-11-16 21:40:49,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:40:49,055 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:40:49,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:40:49,057 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:40:49,059 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:40:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:49,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 2797 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-16 21:40:49,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:40:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2021-11-16 21:40:49,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:40:49,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:40:49,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753016602] [2021-11-16 21:40:49,888 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:40:49,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068883507] [2021-11-16 21:40:49,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068883507] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:40:49,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:40:49,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 21:40:49,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157024484] [2021-11-16 21:40:49,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:40:49,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:40:49,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:40:49,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:40:49,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:40:49,890 INFO L87 Difference]: Start difference. First operand 464 states and 697 transitions. Second operand has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 8 states have internal predecessors, (86), 5 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 4 states have call predecessors, (24), 5 states have call successors, (24) [2021-11-16 21:40:51,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:40:51,358 INFO L93 Difference]: Finished difference Result 863 states and 1318 transitions. [2021-11-16 21:40:51,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:40:51,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 8 states have internal predecessors, (86), 5 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 4 states have call predecessors, (24), 5 states have call successors, (24) Word has length 210 [2021-11-16 21:40:51,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:40:51,363 INFO L225 Difference]: With dead ends: 863 [2021-11-16 21:40:51,364 INFO L226 Difference]: Without dead ends: 467 [2021-11-16 21:40:51,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:40:51,367 INFO L933 BasicCegarLoop]: 561 mSDtfsCounter, 679 mSDsluCounter, 2690 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 3251 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-16 21:40:51,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [701 Valid, 3251 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-16 21:40:51,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2021-11-16 21:40:51,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 465. [2021-11-16 21:40:51,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 276 states have (on average 1.2427536231884058) internal successors, (343), 281 states have internal predecessors, (343), 158 states have call successors, (158), 27 states have call predecessors, (158), 29 states have return successors, (197), 157 states have call predecessors, (197), 156 states have call successors, (197) [2021-11-16 21:40:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 698 transitions. [2021-11-16 21:40:51,391 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 698 transitions. Word has length 210 [2021-11-16 21:40:51,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:40:51,391 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 698 transitions. [2021-11-16 21:40:51,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 8 states have internal predecessors, (86), 5 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 4 states have call predecessors, (24), 5 states have call successors, (24) [2021-11-16 21:40:51,392 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 698 transitions. [2021-11-16 21:40:51,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-11-16 21:40:51,394 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:40:51,394 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:51,439 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:40:51,619 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:40:51,620 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:40:51,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:40:51,620 INFO L85 PathProgramCache]: Analyzing trace with hash -236319775, now seen corresponding path program 1 times [2021-11-16 21:40:51,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:40:51,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187556519] [2021-11-16 21:40:51,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:40:51,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:40:51,664 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:40:51,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1307604797] [2021-11-16 21:40:51,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:40:51,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:40:51,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:40:51,666 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:40:51,668 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:40:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:40:52,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 2748 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-16 21:40:52,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:40:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 137 proven. 3 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2021-11-16 21:40:52,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:40:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2021-11-16 21:40:53,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:40:53,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187556519] [2021-11-16 21:40:53,106 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:40:53,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307604797] [2021-11-16 21:40:53,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307604797] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 21:40:53,107 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 21:40:53,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2021-11-16 21:40:53,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841168960] [2021-11-16 21:40:53,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 21:40:53,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-16 21:40:53,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:40:53,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-16 21:40:53,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:40:53,109 INFO L87 Difference]: Start difference. First operand 465 states and 698 transitions. Second operand has 14 states, 12 states have (on average 9.916666666666666) internal successors, (119), 14 states have internal predecessors, (119), 9 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (42), 5 states have call predecessors, (42), 9 states have call successors, (42) [2021-11-16 21:40:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:40:55,964 INFO L93 Difference]: Finished difference Result 881 states and 1352 transitions. [2021-11-16 21:40:55,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:40:55,964 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 9.916666666666666) internal successors, (119), 14 states have internal predecessors, (119), 9 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (42), 5 states have call predecessors, (42), 9 states have call successors, (42) Word has length 211 [2021-11-16 21:40:55,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:40:55,968 INFO L225 Difference]: With dead ends: 881 [2021-11-16 21:40:55,969 INFO L226 Difference]: Without dead ends: 484 [2021-11-16 21:40:55,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2021-11-16 21:40:55,972 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 1085 mSDsluCounter, 4178 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 4724 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-16 21:40:55,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1135 Valid, 4724 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-11-16 21:40:55,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-11-16 21:40:55,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 478. [2021-11-16 21:40:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 288 states have (on average 1.25) internal successors, (360), 292 states have internal predecessors, (360), 159 states have call successors, (159), 27 states have call predecessors, (159), 29 states have return successors, (198), 159 states have call predecessors, (198), 157 states have call successors, (198) [2021-11-16 21:40:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 717 transitions. [2021-11-16 21:40:55,994 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 717 transitions. Word has length 211 [2021-11-16 21:40:55,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:40:55,994 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 717 transitions. [2021-11-16 21:40:55,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 9.916666666666666) internal successors, (119), 14 states have internal predecessors, (119), 9 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (42), 5 states have call predecessors, (42), 9 states have call successors, (42) [2021-11-16 21:40:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 717 transitions. [2021-11-16 21:40:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2021-11-16 21:40:55,997 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:40:55,997 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 6, 6, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:56,028 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:40:56,215 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:40:56,215 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:40:56,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:40:56,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1051846891, now seen corresponding path program 2 times [2021-11-16 21:40:56,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:40:56,216 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261550749] [2021-11-16 21:40:56,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:40:56,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:40:56,266 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:40:56,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1010405543] [2021-11-16 21:40:56,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 21:40:56,267 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:40:56,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:40:56,268 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:40:56,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-16 21:40:58,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 21:40:58,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 21:40:58,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 2869 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-16 21:40:58,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:40:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-11-16 21:40:59,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:40:59,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:40:59,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261550749] [2021-11-16 21:40:59,317 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:40:59,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010405543] [2021-11-16 21:40:59,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010405543] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:40:59,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:40:59,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-16 21:40:59,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859982163] [2021-11-16 21:40:59,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:40:59,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 21:40:59,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:40:59,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 21:40:59,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-16 21:40:59,319 INFO L87 Difference]: Start difference. First operand 478 states and 717 transitions. Second operand has 10 states, 9 states have (on average 11.11111111111111) internal successors, (100), 10 states have internal predecessors, (100), 6 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (25), 5 states have call predecessors, (25), 6 states have call successors, (25) [2021-11-16 21:41:01,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:01,888 INFO L93 Difference]: Finished difference Result 890 states and 1355 transitions. [2021-11-16 21:41:01,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 21:41:01,889 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 11.11111111111111) internal successors, (100), 10 states have internal predecessors, (100), 6 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (25), 5 states have call predecessors, (25), 6 states have call successors, (25) Word has length 226 [2021-11-16 21:41:01,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:01,893 INFO L225 Difference]: With dead ends: 890 [2021-11-16 21:41:01,893 INFO L226 Difference]: Without dead ends: 480 [2021-11-16 21:41:01,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-11-16 21:41:01,897 INFO L933 BasicCegarLoop]: 540 mSDtfsCounter, 744 mSDsluCounter, 3625 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 4165 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-16 21:41:01,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [794 Valid, 4165 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-11-16 21:41:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-11-16 21:41:01,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 462. [2021-11-16 21:41:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 274 states have (on average 1.2445255474452555) internal successors, (341), 278 states have internal predecessors, (341), 158 states have call successors, (158), 27 states have call predecessors, (158), 28 states have return successors, (184), 157 states have call predecessors, (184), 156 states have call successors, (184) [2021-11-16 21:41:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 683 transitions. [2021-11-16 21:41:01,917 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 683 transitions. Word has length 226 [2021-11-16 21:41:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:01,918 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 683 transitions. [2021-11-16 21:41:01,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 11.11111111111111) internal successors, (100), 10 states have internal predecessors, (100), 6 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (25), 5 states have call predecessors, (25), 6 states have call successors, (25) [2021-11-16 21:41:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 683 transitions. [2021-11-16 21:41:01,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2021-11-16 21:41:01,920 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:01,921 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-11-16 21:41:02,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-16 21:41:02,143 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:02,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:02,144 INFO L85 PathProgramCache]: Analyzing trace with hash 664794371, now seen corresponding path program 3 times [2021-11-16 21:41:02,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:02,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565904618] [2021-11-16 21:41:02,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:02,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:02,183 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:41:02,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1722724923] [2021-11-16 21:41:02,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-16 21:41:02,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:02,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:02,185 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:41:02,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-16 21:41:04,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-16 21:41:04,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 21:41:04,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 1881 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-16 21:41:04,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2021-11-16 21:41:04,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:41:04,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:04,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565904618] [2021-11-16 21:41:04,752 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:41:04,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722724923] [2021-11-16 21:41:04,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722724923] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:41:04,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:41:04,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 21:41:04,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085824202] [2021-11-16 21:41:04,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:41:04,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:41:04,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:41:04,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:41:04,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:41:04,755 INFO L87 Difference]: Start difference. First operand 462 states and 683 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2021-11-16 21:41:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:04,965 INFO L93 Difference]: Finished difference Result 851 states and 1291 transitions. [2021-11-16 21:41:04,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:41:04,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 241 [2021-11-16 21:41:04,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:04,970 INFO L225 Difference]: With dead ends: 851 [2021-11-16 21:41:04,970 INFO L226 Difference]: Without dead ends: 462 [2021-11-16 21:41:04,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:41:04,973 INFO L933 BasicCegarLoop]: 591 mSDtfsCounter, 2 mSDsluCounter, 2285 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:41:04,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2876 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 21:41:04,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-11-16 21:41:04,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2021-11-16 21:41:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 274 states have (on average 1.2445255474452555) internal successors, (341), 278 states have internal predecessors, (341), 158 states have call successors, (158), 27 states have call predecessors, (158), 28 states have return successors, (183), 157 states have call predecessors, (183), 156 states have call successors, (183) [2021-11-16 21:41:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 682 transitions. [2021-11-16 21:41:04,992 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 682 transitions. Word has length 241 [2021-11-16 21:41:04,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:04,993 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 682 transitions. [2021-11-16 21:41:04,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2021-11-16 21:41:04,993 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 682 transitions. [2021-11-16 21:41:04,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2021-11-16 21:41:04,995 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:04,996 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-16 21:41:05,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-16 21:41:05,223 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:05,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:05,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1662762273, now seen corresponding path program 4 times [2021-11-16 21:41:05,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:05,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123755028] [2021-11-16 21:41:05,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:05,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:05,281 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:41:05,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1881072634] [2021-11-16 21:41:05,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-16 21:41:05,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:05,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:05,283 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:41:05,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-16 21:41:05,769 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-16 21:41:05,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 21:41:05,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 3111 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-16 21:41:05,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:06,227 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2021-11-16 21:41:06,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:41:06,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:06,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123755028] [2021-11-16 21:41:06,228 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:41:06,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881072634] [2021-11-16 21:41:06,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881072634] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:41:06,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:41:06,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 21:41:06,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110259508] [2021-11-16 21:41:06,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:41:06,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:41:06,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:41:06,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:41:06,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:41:06,230 INFO L87 Difference]: Start difference. First operand 462 states and 682 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 5 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) [2021-11-16 21:41:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:07,860 INFO L93 Difference]: Finished difference Result 862 states and 1283 transitions. [2021-11-16 21:41:07,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:41:07,860 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 5 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) Word has length 256 [2021-11-16 21:41:07,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:07,864 INFO L225 Difference]: With dead ends: 862 [2021-11-16 21:41:07,864 INFO L226 Difference]: Without dead ends: 474 [2021-11-16 21:41:07,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 250 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:07,867 INFO L933 BasicCegarLoop]: 558 mSDtfsCounter, 661 mSDsluCounter, 3266 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 3824 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-16 21:41:07,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [692 Valid, 3824 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-16 21:41:07,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-11-16 21:41:07,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2021-11-16 21:41:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 280 states have (on average 1.2428571428571429) internal successors, (348), 284 states have internal predecessors, (348), 163 states have call successors, (163), 28 states have call predecessors, (163), 29 states have return successors, (188), 162 states have call predecessors, (188), 161 states have call successors, (188) [2021-11-16 21:41:07,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 699 transitions. [2021-11-16 21:41:07,885 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 699 transitions. Word has length 256 [2021-11-16 21:41:07,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:07,886 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 699 transitions. [2021-11-16 21:41:07,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 5 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) [2021-11-16 21:41:07,886 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 699 transitions. [2021-11-16 21:41:07,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-11-16 21:41:07,889 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:07,889 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-16 21:41:08,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-16 21:41:08,103 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:08,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:08,104 INFO L85 PathProgramCache]: Analyzing trace with hash -350828385, now seen corresponding path program 1 times [2021-11-16 21:41:08,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:08,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318766602] [2021-11-16 21:41:08,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:08,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:08,148 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:41:08,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [97790550] [2021-11-16 21:41:08,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:08,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:08,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:08,150 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:41:08,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-16 21:41:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:08,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 3232 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-16 21:41:08,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:09,188 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2021-11-16 21:41:09,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:41:09,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:09,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318766602] [2021-11-16 21:41:09,188 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:41:09,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97790550] [2021-11-16 21:41:09,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97790550] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:41:09,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:41:09,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 21:41:09,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064221978] [2021-11-16 21:41:09,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:41:09,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:41:09,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:41:09,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:41:09,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:41:09,190 INFO L87 Difference]: Start difference. First operand 474 states and 699 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-16 21:41:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:11,673 INFO L93 Difference]: Finished difference Result 948 states and 1454 transitions. [2021-11-16 21:41:11,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:41:11,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 271 [2021-11-16 21:41:11,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:11,677 INFO L225 Difference]: With dead ends: 948 [2021-11-16 21:41:11,677 INFO L226 Difference]: Without dead ends: 510 [2021-11-16 21:41:11,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:41:11,681 INFO L933 BasicCegarLoop]: 635 mSDtfsCounter, 21 mSDsluCounter, 2320 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 2955 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-16 21:41:11,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 2955 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-16 21:41:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-11-16 21:41:11,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 482. [2021-11-16 21:41:11,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 288 states have (on average 1.2430555555555556) internal successors, (358), 292 states have internal predecessors, (358), 163 states have call successors, (163), 28 states have call predecessors, (163), 29 states have return successors, (188), 162 states have call predecessors, (188), 161 states have call successors, (188) [2021-11-16 21:41:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 709 transitions. [2021-11-16 21:41:11,706 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 709 transitions. Word has length 271 [2021-11-16 21:41:11,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:11,707 INFO L470 AbstractCegarLoop]: Abstraction has 482 states and 709 transitions. [2021-11-16 21:41:11,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-16 21:41:11,707 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 709 transitions. [2021-11-16 21:41:11,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-11-16 21:41:11,709 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:11,709 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-16 21:41:11,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-16 21:41:11,936 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:11,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:11,936 INFO L85 PathProgramCache]: Analyzing trace with hash -899887649, now seen corresponding path program 1 times [2021-11-16 21:41:11,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:11,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038574242] [2021-11-16 21:41:11,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:11,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:11,982 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:41:11,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [710591979] [2021-11-16 21:41:11,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:11,983 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:11,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:11,984 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:41:11,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-16 21:41:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:12,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 3226 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 21:41:12,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2021-11-16 21:41:12,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:41:12,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:12,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038574242] [2021-11-16 21:41:12,933 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:41:12,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710591979] [2021-11-16 21:41:12,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710591979] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:41:12,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:41:12,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 21:41:12,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472125877] [2021-11-16 21:41:12,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:41:12,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 21:41:12,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:41:12,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 21:41:12,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 21:41:12,935 INFO L87 Difference]: Start difference. First operand 482 states and 709 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-16 21:41:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:12,979 INFO L93 Difference]: Finished difference Result 936 states and 1412 transitions. [2021-11-16 21:41:12,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:41:12,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 271 [2021-11-16 21:41:12,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:12,984 INFO L225 Difference]: With dead ends: 936 [2021-11-16 21:41:12,984 INFO L226 Difference]: Without dead ends: 490 [2021-11-16 21:41:12,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 268 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:41:12,987 INFO L933 BasicCegarLoop]: 625 mSDtfsCounter, 3 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:41:12,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 1870 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:41:12,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-11-16 21:41:13,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 486. [2021-11-16 21:41:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 292 states have (on average 1.2397260273972603) internal successors, (362), 296 states have internal predecessors, (362), 163 states have call successors, (163), 28 states have call predecessors, (163), 29 states have return successors, (188), 162 states have call predecessors, (188), 161 states have call successors, (188) [2021-11-16 21:41:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 713 transitions. [2021-11-16 21:41:13,009 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 713 transitions. Word has length 271 [2021-11-16 21:41:13,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:13,009 INFO L470 AbstractCegarLoop]: Abstraction has 486 states and 713 transitions. [2021-11-16 21:41:13,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-11-16 21:41:13,010 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 713 transitions. [2021-11-16 21:41:13,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-11-16 21:41:13,011 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:13,011 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-16 21:41:13,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-16 21:41:13,228 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:13,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:13,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1910711071, now seen corresponding path program 1 times [2021-11-16 21:41:13,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:13,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656751517] [2021-11-16 21:41:13,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:13,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:13,267 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:41:13,268 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1561647565] [2021-11-16 21:41:13,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:13,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:13,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:13,269 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:41:13,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-16 21:41:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:13,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 3216 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-16 21:41:13,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-11-16 21:41:14,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:41:14,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:14,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656751517] [2021-11-16 21:41:14,261 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:41:14,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561647565] [2021-11-16 21:41:14,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561647565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:41:14,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:41:14,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 21:41:14,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348766838] [2021-11-16 21:41:14,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:41:14,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:41:14,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:41:14,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:41:14,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:41:14,263 INFO L87 Difference]: Start difference. First operand 486 states and 713 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (25), 5 states have call predecessors, (25), 4 states have call successors, (25) [2021-11-16 21:41:16,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:16,463 INFO L93 Difference]: Finished difference Result 943 states and 1400 transitions. [2021-11-16 21:41:16,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:41:16,464 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (25), 5 states have call predecessors, (25), 4 states have call successors, (25) Word has length 271 [2021-11-16 21:41:16,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:16,468 INFO L225 Difference]: With dead ends: 943 [2021-11-16 21:41:16,468 INFO L226 Difference]: Without dead ends: 528 [2021-11-16 21:41:16,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-16 21:41:16,471 INFO L933 BasicCegarLoop]: 639 mSDtfsCounter, 42 mSDsluCounter, 3800 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 4439 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:41:16,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 4439 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-16 21:41:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-11-16 21:41:16,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 505. [2021-11-16 21:41:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 305 states have (on average 1.2426229508196722) internal successors, (379), 309 states have internal predecessors, (379), 168 states have call successors, (168), 28 states have call predecessors, (168), 30 states have return successors, (198), 168 states have call predecessors, (198), 166 states have call successors, (198) [2021-11-16 21:41:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 745 transitions. [2021-11-16 21:41:16,498 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 745 transitions. Word has length 271 [2021-11-16 21:41:16,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:16,499 INFO L470 AbstractCegarLoop]: Abstraction has 505 states and 745 transitions. [2021-11-16 21:41:16,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (25), 5 states have call predecessors, (25), 4 states have call successors, (25) [2021-11-16 21:41:16,500 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 745 transitions. [2021-11-16 21:41:16,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-11-16 21:41:16,501 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:16,502 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-16 21:41:16,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-16 21:41:16,715 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:16,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1178743645, now seen corresponding path program 1 times [2021-11-16 21:41:16,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:16,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680617967] [2021-11-16 21:41:16,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:16,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:16,766 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:41:16,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [786513105] [2021-11-16 21:41:16,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:16,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:16,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:16,768 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:41:16,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-16 21:41:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:17,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 3213 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-16 21:41:17,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-11-16 21:41:17,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:41:17,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:17,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680617967] [2021-11-16 21:41:17,740 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:41:17,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786513105] [2021-11-16 21:41:17,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786513105] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:41:17,740 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:41:17,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 21:41:17,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101405849] [2021-11-16 21:41:17,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:41:17,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:41:17,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:41:17,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:41:17,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:41:17,742 INFO L87 Difference]: Start difference. First operand 505 states and 745 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 4 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2021-11-16 21:41:18,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:18,183 INFO L93 Difference]: Finished difference Result 953 states and 1415 transitions. [2021-11-16 21:41:18,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:41:18,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 4 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 271 [2021-11-16 21:41:18,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:18,188 INFO L225 Difference]: With dead ends: 953 [2021-11-16 21:41:18,188 INFO L226 Difference]: Without dead ends: 532 [2021-11-16 21:41:18,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:41:18,216 INFO L933 BasicCegarLoop]: 648 mSDtfsCounter, 31 mSDsluCounter, 2532 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 3180 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-16 21:41:18,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 3180 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-16 21:41:18,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-11-16 21:41:18,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 511. [2021-11-16 21:41:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 308 states have (on average 1.2370129870129871) internal successors, (381), 312 states have internal predecessors, (381), 171 states have call successors, (171), 28 states have call predecessors, (171), 30 states have return successors, (201), 171 states have call predecessors, (201), 169 states have call successors, (201) [2021-11-16 21:41:18,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 753 transitions. [2021-11-16 21:41:18,240 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 753 transitions. Word has length 271 [2021-11-16 21:41:18,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:18,241 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 753 transitions. [2021-11-16 21:41:18,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 4 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2021-11-16 21:41:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 753 transitions. [2021-11-16 21:41:18,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-11-16 21:41:18,243 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:18,243 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-16 21:41:18,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:18,470 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:18,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:18,470 INFO L85 PathProgramCache]: Analyzing trace with hash -957139557, now seen corresponding path program 1 times [2021-11-16 21:41:18,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:18,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395534196] [2021-11-16 21:41:18,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:18,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:18,515 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:41:18,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416242534] [2021-11-16 21:41:18,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:18,516 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:18,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:18,517 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:41:18,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-16 21:41:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:19,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 3210 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-16 21:41:19,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2021-11-16 21:41:19,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:41:19,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:19,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395534196] [2021-11-16 21:41:19,447 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:41:19,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416242534] [2021-11-16 21:41:19,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416242534] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:41:19,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:41:19,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 21:41:19,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873809690] [2021-11-16 21:41:19,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:41:19,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 21:41:19,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:41:19,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 21:41:19,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:41:19,449 INFO L87 Difference]: Start difference. First operand 511 states and 753 transitions. Second operand has 5 states, 4 states have (on average 27.75) internal successors, (111), 5 states have internal predecessors, (111), 3 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (27), 2 states have call predecessors, (27), 3 states have call successors, (27) [2021-11-16 21:41:20,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:20,131 INFO L93 Difference]: Finished difference Result 926 states and 1371 transitions. [2021-11-16 21:41:20,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:41:20,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.75) internal successors, (111), 5 states have internal predecessors, (111), 3 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (27), 2 states have call predecessors, (27), 3 states have call successors, (27) Word has length 271 [2021-11-16 21:41:20,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:20,135 INFO L225 Difference]: With dead ends: 926 [2021-11-16 21:41:20,135 INFO L226 Difference]: Without dead ends: 489 [2021-11-16 21:41:20,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:41:20,137 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 2 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2279 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-16 21:41:20,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2279 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-16 21:41:20,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-11-16 21:41:20,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2021-11-16 21:41:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 294 states have (on average 1.2312925170068028) internal successors, (362), 299 states have internal predecessors, (362), 163 states have call successors, (163), 28 states have call predecessors, (163), 30 states have return successors, (190), 162 states have call predecessors, (190), 161 states have call successors, (190) [2021-11-16 21:41:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 715 transitions. [2021-11-16 21:41:20,157 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 715 transitions. Word has length 271 [2021-11-16 21:41:20,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:20,158 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 715 transitions. [2021-11-16 21:41:20,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.75) internal successors, (111), 5 states have internal predecessors, (111), 3 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (27), 2 states have call predecessors, (27), 3 states have call successors, (27) [2021-11-16 21:41:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 715 transitions. [2021-11-16 21:41:20,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2021-11-16 21:41:20,160 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:20,160 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-16 21:41:20,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-16 21:41:20,387 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:20,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:20,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1871546181, now seen corresponding path program 1 times [2021-11-16 21:41:20,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:20,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67482120] [2021-11-16 21:41:20,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:20,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:20,444 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:41:20,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1491155189] [2021-11-16 21:41:20,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:20,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:20,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:20,446 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:41:20,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-16 21:41:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:21,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 3247 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-16 21:41:21,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:21,370 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 11 treesize of output 5 [2021-11-16 21:41:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2021-11-16 21:41:21,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:41:21,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:21,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67482120] [2021-11-16 21:41:21,637 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:41:21,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491155189] [2021-11-16 21:41:21,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491155189] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:41:21,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:41:21,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-16 21:41:21,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150009905] [2021-11-16 21:41:21,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:41:21,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 21:41:21,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:41:21,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 21:41:21,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:41:21,639 INFO L87 Difference]: Start difference. First operand 489 states and 715 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 6 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) [2021-11-16 21:41:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:26,106 INFO L93 Difference]: Finished difference Result 993 states and 1533 transitions. [2021-11-16 21:41:26,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-16 21:41:26,106 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 6 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) Word has length 282 [2021-11-16 21:41:26,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:26,110 INFO L225 Difference]: With dead ends: 993 [2021-11-16 21:41:26,110 INFO L226 Difference]: Without dead ends: 540 [2021-11-16 21:41:26,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2021-11-16 21:41:26,114 INFO L933 BasicCegarLoop]: 584 mSDtfsCounter, 118 mSDsluCounter, 4888 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 5472 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-11-16 21:41:26,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 5472 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2021-11-16 21:41:26,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-11-16 21:41:26,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 500. [2021-11-16 21:41:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 304 states have (on average 1.230263157894737) internal successors, (374), 308 states have internal predecessors, (374), 163 states have call successors, (163), 28 states have call predecessors, (163), 31 states have return successors, (209), 164 states have call predecessors, (209), 161 states have call successors, (209) [2021-11-16 21:41:26,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 746 transitions. [2021-11-16 21:41:26,136 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 746 transitions. Word has length 282 [2021-11-16 21:41:26,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:26,137 INFO L470 AbstractCegarLoop]: Abstraction has 500 states and 746 transitions. [2021-11-16 21:41:26,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 6 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) [2021-11-16 21:41:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 746 transitions. [2021-11-16 21:41:26,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2021-11-16 21:41:26,139 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:26,139 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-16 21:41:26,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-16 21:41:26,353 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:26,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:26,353 INFO L85 PathProgramCache]: Analyzing trace with hash -39816585, now seen corresponding path program 1 times [2021-11-16 21:41:26,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:26,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689588772] [2021-11-16 21:41:26,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:26,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:26,395 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:41:26,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [462652971] [2021-11-16 21:41:26,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:26,396 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:26,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:26,397 INFO L229 MonitoredProcess]: Starting monitored process 18 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,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-16 21:41:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:26,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 3245 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 21:41:26,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:27,257 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2021-11-16 21:41:27,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:41:27,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:27,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689588772] [2021-11-16 21:41:27,258 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:41:27,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462652971] [2021-11-16 21:41:27,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462652971] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:41:27,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:41:27,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 21:41:27,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880865263] [2021-11-16 21:41:27,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:41:27,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 21:41:27,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:41:27,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 21:41:27,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 21:41:27,259 INFO L87 Difference]: Start difference. First operand 500 states and 746 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-16 21:41:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:27,325 INFO L93 Difference]: Finished difference Result 964 states and 1513 transitions. [2021-11-16 21:41:27,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:41:27,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 282 [2021-11-16 21:41:27,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:27,330 INFO L225 Difference]: With dead ends: 964 [2021-11-16 21:41:27,330 INFO L226 Difference]: Without dead ends: 500 [2021-11-16 21:41:27,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 280 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:41:27,333 INFO L933 BasicCegarLoop]: 630 mSDtfsCounter, 7 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1870 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:41:27,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 1870 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:41:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2021-11-16 21:41:27,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2021-11-16 21:41:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 304 states have (on average 1.2269736842105263) internal successors, (373), 308 states have internal predecessors, (373), 163 states have call successors, (163), 28 states have call predecessors, (163), 31 states have return successors, (209), 164 states have call predecessors, (209), 161 states have call successors, (209) [2021-11-16 21:41:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 745 transitions. [2021-11-16 21:41:27,357 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 745 transitions. Word has length 282 [2021-11-16 21:41:27,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:27,358 INFO L470 AbstractCegarLoop]: Abstraction has 500 states and 745 transitions. [2021-11-16 21:41:27,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-16 21:41:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 745 transitions. [2021-11-16 21:41:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2021-11-16 21:41:27,360 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:27,360 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-16 21:41:27,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-16 21:41:27,575 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:27,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:27,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2131138231, now seen corresponding path program 1 times [2021-11-16 21:41:27,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:27,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498611533] [2021-11-16 21:41:27,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:27,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:27,608 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:41:27,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1220630353] [2021-11-16 21:41:27,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:27,609 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:27,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:27,610 INFO L229 MonitoredProcess]: Starting monitored process 19 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:27,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-16 21:41:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:28,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 3253 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-16 21:41:28,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:28,513 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2021-11-16 21:41:28,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:41:28,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:28,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498611533] [2021-11-16 21:41:28,513 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:41:28,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220630353] [2021-11-16 21:41:28,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220630353] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:41:28,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:41:28,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 21:41:28,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350116107] [2021-11-16 21:41:28,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:41:28,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 21:41:28,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:41:28,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 21:41:28,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:41:28,515 INFO L87 Difference]: Start difference. First operand 500 states and 745 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-16 21:41:28,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:28,562 INFO L93 Difference]: Finished difference Result 984 states and 1522 transitions. [2021-11-16 21:41:28,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:41:28,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 282 [2021-11-16 21:41:28,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:28,567 INFO L225 Difference]: With dead ends: 984 [2021-11-16 21:41:28,567 INFO L226 Difference]: Without dead ends: 520 [2021-11-16 21:41:28,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:41:28,570 INFO L933 BasicCegarLoop]: 650 mSDtfsCounter, 8 mSDsluCounter, 1922 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2572 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:41:28,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 2572 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 21:41:28,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-11-16 21:41:28,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 508. [2021-11-16 21:41:28,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 312 states have (on average 1.2211538461538463) internal successors, (381), 316 states have internal predecessors, (381), 163 states have call successors, (163), 28 states have call predecessors, (163), 31 states have return successors, (209), 164 states have call predecessors, (209), 161 states have call successors, (209) [2021-11-16 21:41:28,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 753 transitions. [2021-11-16 21:41:28,592 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 753 transitions. Word has length 282 [2021-11-16 21:41:28,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:28,593 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 753 transitions. [2021-11-16 21:41:28,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-16 21:41:28,593 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 753 transitions. [2021-11-16 21:41:28,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2021-11-16 21:41:28,595 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:28,595 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-16 21:41:28,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:28,813 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:28,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:28,814 INFO L85 PathProgramCache]: Analyzing trace with hash 277938223, now seen corresponding path program 1 times [2021-11-16 21:41:28,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:28,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690445135] [2021-11-16 21:41:28,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:28,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:28,856 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:41:28,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1821222175] [2021-11-16 21:41:28,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:28,857 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:28,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:28,858 INFO L229 MonitoredProcess]: Starting monitored process 20 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:28,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-16 21:41:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:29,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 3257 conjuncts, 81 conjunts are in the unsatisfiable core [2021-11-16 21:41:29,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:29,579 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 15 treesize of output 1 [2021-11-16 21:41:30,385 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 32 treesize of output 24 [2021-11-16 21:41:30,388 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 21 treesize of output 13 [2021-11-16 21:41:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-11-16 21:41:30,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:41:30,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:30,623 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690445135] [2021-11-16 21:41:30,624 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:41:30,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821222175] [2021-11-16 21:41:30,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821222175] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:41:30,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:41:30,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-16 21:41:30,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688884482] [2021-11-16 21:41:30,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:41:30,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-16 21:41:30,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:41:30,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-16 21:41:30,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-11-16 21:41:30,625 INFO L87 Difference]: Start difference. First operand 508 states and 753 transitions. Second operand has 16 states, 16 states have (on average 8.0625) internal successors, (129), 15 states have internal predecessors, (129), 8 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2021-11-16 21:41:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:34,575 INFO L93 Difference]: Finished difference Result 1056 states and 1612 transitions. [2021-11-16 21:41:34,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-16 21:41:34,575 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.0625) internal successors, (129), 15 states have internal predecessors, (129), 8 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) Word has length 286 [2021-11-16 21:41:34,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:34,580 INFO L225 Difference]: With dead ends: 1056 [2021-11-16 21:41:34,580 INFO L226 Difference]: Without dead ends: 611 [2021-11-16 21:41:34,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 269 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2021-11-16 21:41:34,584 INFO L933 BasicCegarLoop]: 579 mSDtfsCounter, 144 mSDsluCounter, 6433 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 7012 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-11-16 21:41:34,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 7012 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1392 Invalid, 0 Unknown, 171 Unchecked, 3.6s Time] [2021-11-16 21:41:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-11-16 21:41:34,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 569. [2021-11-16 21:41:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 360 states have (on average 1.2083333333333333) internal successors, (435), 364 states have internal predecessors, (435), 169 states have call successors, (169), 32 states have call predecessors, (169), 38 states have return successors, (268), 173 states have call predecessors, (268), 167 states have call successors, (268) [2021-11-16 21:41:34,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 872 transitions. [2021-11-16 21:41:34,610 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 872 transitions. Word has length 286 [2021-11-16 21:41:34,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:34,611 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 872 transitions. [2021-11-16 21:41:34,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.0625) internal successors, (129), 15 states have internal predecessors, (129), 8 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2021-11-16 21:41:34,611 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 872 transitions. [2021-11-16 21:41:34,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2021-11-16 21:41:34,613 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:34,613 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-16 21:41:34,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:34,839 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:34,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:34,840 INFO L85 PathProgramCache]: Analyzing trace with hash 154656557, now seen corresponding path program 1 times [2021-11-16 21:41:34,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:34,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021698988] [2021-11-16 21:41:34,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:34,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:34,907 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:41:34,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149259433] [2021-11-16 21:41:34,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:34,908 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:34,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:34,909 INFO L229 MonitoredProcess]: Starting monitored process 21 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:34,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-16 21:41:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:35,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 3252 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 21:41:35,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2021-11-16 21:41:35,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:41:35,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:35,916 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021698988] [2021-11-16 21:41:35,916 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:41:35,916 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149259433] [2021-11-16 21:41:35,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149259433] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:41:35,916 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:41:35,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 21:41:35,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354815615] [2021-11-16 21:41:35,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:41:35,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 21:41:35,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:41:35,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 21:41:35,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:41:35,917 INFO L87 Difference]: Start difference. First operand 569 states and 872 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-16 21:41:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:41:38,090 INFO L93 Difference]: Finished difference Result 1088 states and 1744 transitions. [2021-11-16 21:41:38,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:41:38,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 286 [2021-11-16 21:41:38,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:41:38,095 INFO L225 Difference]: With dead ends: 1088 [2021-11-16 21:41:38,095 INFO L226 Difference]: Without dead ends: 555 [2021-11-16 21:41:38,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:41:38,104 INFO L933 BasicCegarLoop]: 642 mSDtfsCounter, 7 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2412 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:41:38,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 2412 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-16 21:41:38,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-11-16 21:41:38,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2021-11-16 21:41:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 347 states have (on average 1.2046109510086456) internal successors, (418), 351 states have internal predecessors, (418), 169 states have call successors, (169), 32 states have call predecessors, (169), 37 states have return successors, (249), 172 states have call predecessors, (249), 167 states have call successors, (249) [2021-11-16 21:41:38,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 836 transitions. [2021-11-16 21:41:38,136 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 836 transitions. Word has length 286 [2021-11-16 21:41:38,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:41:38,136 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 836 transitions. [2021-11-16 21:41:38,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-16 21:41:38,137 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 836 transitions. [2021-11-16 21:41:38,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2021-11-16 21:41:38,139 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:41:38,139 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-16 21:41:38,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-16 21:41:38,368 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:41:38,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:41:38,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1378953583, now seen corresponding path program 1 times [2021-11-16 21:41:38,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:41:38,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887795740] [2021-11-16 21:41:38,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:38,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:41:38,409 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-16 21:41:38,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1525770949] [2021-11-16 21:41:38,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:41:38,410 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:41:38,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:41:38,411 INFO L229 MonitoredProcess]: Starting monitored process 22 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,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-16 21:41:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:41:39,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 3282 conjuncts, 198 conjunts are in the unsatisfiable core [2021-11-16 21:41:39,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:41:49,446 WARN L227 SmtUtils]: Spent 9.97s on a formula simplification. DAG size of input: 37 DAG size of output: 13 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-16 21:41:49,446 INFO L354 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2021-11-16 21:41:49,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 553 treesize of output 563 [2021-11-16 21:41:59,462 WARN L227 SmtUtils]: Spent 10.00s on a formula simplification. DAG size of input: 37 DAG size of output: 13 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-16 21:41:59,463 INFO L354 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2021-11-16 21:41:59,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 648 treesize of output 658 [2021-11-16 21:41:59,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:41:59,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887795740] [2021-11-16 21:41:59,488 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-16 21:41:59,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525770949] [2021-11-16 21:41:59,488 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-16 21:41:59,488 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:41:59,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-16 21:41:59,489 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-16 21:41:59,489 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-16 21:41:59,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-11-16 21:41:59,498 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-11-16 21:41:59,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-16 21:41:59,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-16 21:41:59,714 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:41:59,719 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-16 21:41:59,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 09:41:59 BoogieIcfgContainer [2021-11-16 21:41:59,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-16 21:41:59,778 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-16 21:41:59,778 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-16 21:41:59,778 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-16 21:41:59,779 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 09:40:29" (3/4) ... [2021-11-16 21:41:59,783 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-16 21:41:59,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-16 21:41:59,786 INFO L158 Benchmark]: Toolchain (without parser) took 95642.08ms. Allocated memory was 102.8MB in the beginning and 310.4MB in the end (delta: 207.6MB). Free memory was 71.2MB in the beginning and 103.9MB in the end (delta: -32.6MB). Peak memory consumption was 174.9MB. Max. memory is 16.1GB. [2021-11-16 21:41:59,787 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory was 59.8MB in the beginning and 59.7MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 21:41:59,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1965.70ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 71.2MB in the beginning and 61.5MB in the end (delta: 9.7MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. [2021-11-16 21:41:59,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 172.75ms. Allocated memory is still 130.0MB. Free memory was 61.5MB in the beginning and 50.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-16 21:41:59,790 INFO L158 Benchmark]: Boogie Preprocessor took 130.15ms. Allocated memory was 130.0MB in the beginning and 178.3MB in the end (delta: 48.2MB). Free memory was 50.5MB in the beginning and 125.3MB in the end (delta: -74.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-16 21:41:59,790 INFO L158 Benchmark]: RCFGBuilder took 3419.78ms. Allocated memory is still 178.3MB. Free memory was 125.3MB in the beginning and 70.6MB in the end (delta: 54.6MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2021-11-16 21:41:59,791 INFO L158 Benchmark]: TraceAbstraction took 89942.84ms. Allocated memory was 178.3MB in the beginning and 310.4MB in the end (delta: 132.1MB). Free memory was 69.6MB in the beginning and 103.9MB in the end (delta: -34.3MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. [2021-11-16 21:41:59,791 INFO L158 Benchmark]: Witness Printer took 4.89ms. Allocated memory is still 310.4MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 21:41:59,794 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory was 59.8MB in the beginning and 59.7MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1965.70ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 71.2MB in the beginning and 61.5MB in the end (delta: 9.7MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 172.75ms. Allocated memory is still 130.0MB. Free memory was 61.5MB in the beginning and 50.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 130.15ms. Allocated memory was 130.0MB in the beginning and 178.3MB in the end (delta: 48.2MB). Free memory was 50.5MB in the beginning and 125.3MB in the end (delta: -74.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 3419.78ms. Allocated memory is still 178.3MB. Free memory was 125.3MB in the beginning and 70.6MB in the end (delta: 54.6MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. * TraceAbstraction took 89942.84ms. Allocated memory was 178.3MB in the beginning and 310.4MB in the end (delta: 132.1MB). Free memory was 69.6MB in the beginning and 103.9MB in the end (delta: -34.3MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. * Witness Printer took 4.89ms. Allocated memory is still 310.4MB. Free memory is still 103.9MB. 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 ; [L8492] CALL aws_priority_queue_pop_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) ) [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] CALL, EXPR aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers)) [L2335] size_t i; [L2336] const uint8_t *buf_u8 = (const uint8_t *)buf; [L2337] i = 0 [L2337] COND FALSE !(i < bufsize) [L2345-L2347] return 1 ; [L8272] RET, EXPR aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers)) [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) [L6951] CALL, EXPR bounded_malloc(size) [L6932-L6934] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) [L211] COND FALSE !(!cond) [L6932-L6934] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) [L6935] return malloc(size); [L6951] RET, EXPR bounded_malloc(size) [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); [L8460] queue.backpointers.data [L8460] COND FALSE !(queue.backpointers.data) [L8476] struct aws_priority_queue old_queue = queue; [L8479] EXPR item && ((((queue.container.item_size)) == 0) || ((item))) [L8479] EXPR queue.container.item_size [L8479] EXPR item && ((((queue.container.item_size)) == 0) || ((item))) [L8479] CALL assume_abort_if_not(item && ((((queue.container.item_size)) == 0) || ((item)))) [L211] COND FALSE !(!cond) [L8479] RET assume_abort_if_not(item && ((((queue.container.item_size)) == 0) || ((item)))) [L8482] CALL aws_priority_queue_pop(&queue, item) [L8427] 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-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2957] EXPR list->current_size [L2957] EXPR (((list->current_size)) == 0) || ((list->data)) [L2957] EXPR list->data [L2957] EXPR (((list->current_size)) == 0) || ((list->data)) [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-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; [L8427] RET, EXPR aws_priority_queue_is_valid(queue) [L8427] CALL assume_abort_if_not((aws_priority_queue_is_valid(queue))) [L211] COND FALSE !(!cond) [L8427] RET assume_abort_if_not((aws_priority_queue_is_valid(queue))) [L8428] EXPR item && ((((queue->container.item_size)) == 0) || ((item))) [L8428] EXPR queue->container.item_size [L8428] EXPR item && ((((queue->container.item_size)) == 0) || ((item))) [L8428] CALL assume_abort_if_not((item && ((((queue->container.item_size)) == 0) || ((item))))) [L211] COND FALSE !(!cond) [L8428] RET assume_abort_if_not((item && ((((queue->container.item_size)) == 0) || ((item))))) [L8429] 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 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; [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 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; [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, 448 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 89.8s, OverallIterations: 22, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 36.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7807 SdHoareTripleChecker+Valid, 34.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7383 mSDsluCounter, 68392 SdHoareTripleChecker+Invalid, 32.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 171 IncrementalHoareTripleChecker+Unchecked, 55881 mSDsCounter, 1830 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8681 IncrementalHoareTripleChecker+Invalid, 10682 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1830 mSolverCounterUnsat, 12511 mSDtfsCounter, 8681 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5156 GetRequests, 4936 SyntacticMatches, 3 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=569occurred in iteration=20, InterpolantAutomatonStates: 170, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 404 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.7s SsaConstructionTime, 11.5s SatisfiabilityAnalysisTime, 31.9s InterpolantComputationTime, 5404 NumberOfCodeBlocks, 5202 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 5300 ConstructedInterpolants, 24 QuantifiedInterpolants, 7999 SizeOfPredicates, 113 NumberOfNonLiveVariables, 61177 ConjunctsInSsa, 506 ConjunctsInUnsatCore, 24 InterpolantComputations, 20 PerfectInterpolantSequences, 7978/8001 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:41:59,837 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_pop_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 71774aeec0d0f8840a1b18b633767b26c38c9eb9d26569d28cdf01c44c9881ac --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 21:42:01,711 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 21:42:01,714 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 21:42:01,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 21:42:01,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 21:42:01,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 21:42:01,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 21:42:01,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 21:42:01,770 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 21:42:01,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 21:42:01,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 21:42:01,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 21:42:01,779 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 21:42:01,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 21:42:01,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 21:42:01,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 21:42:01,786 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 21:42:01,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 21:42:01,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 21:42:01,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 21:42:01,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 21:42:01,797 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 21:42:01,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 21:42:01,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 21:42:01,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 21:42:01,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 21:42:01,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 21:42:01,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 21:42:01,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 21:42:01,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 21:42:01,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 21:42:01,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 21:42:01,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 21:42:01,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 21:42:01,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 21:42:01,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 21:42:01,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 21:42:01,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 21:42:01,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 21:42:01,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 21:42:01,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 21:42:01,820 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:01,852 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 21:42:01,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 21:42:01,854 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 21:42:01,854 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 21:42:01,855 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 21:42:01,855 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 21:42:01,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 21:42:01,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 21:42:01,856 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 21:42:01,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 21:42:01,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 21:42:01,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 21:42:01,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 21:42:01,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 21:42:01,858 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-16 21:42:01,858 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-16 21:42:01,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 21:42:01,858 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 21:42:01,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 21:42:01,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 21:42:01,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 21:42:01,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 21:42:01,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:42:01,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 21:42:01,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 21:42:01,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 21:42:01,860 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-16 21:42:01,860 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-16 21:42:01,860 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 21:42:01,860 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 21:42:01,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 21:42:01,861 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 21:42:01,861 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-16 21:42:01,861 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 -> 71774aeec0d0f8840a1b18b633767b26c38c9eb9d26569d28cdf01c44c9881ac [2021-11-16 21:42:02,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 21:42:02,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 21:42:02,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 21:42:02,201 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 21:42:02,202 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 21:42:02,203 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_pop_harness.i [2021-11-16 21:42:02,260 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3252dfb4d/9544a21ced98478992b2071d3813f1b8/FLAGbe7c435ca [2021-11-16 21:42:02,934 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 21:42:02,935 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_pop_harness.i [2021-11-16 21:42:02,970 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3252dfb4d/9544a21ced98478992b2071d3813f1b8/FLAGbe7c435ca [2021-11-16 21:42:03,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3252dfb4d/9544a21ced98478992b2071d3813f1b8 [2021-11-16 21:42:03,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 21:42:03,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 21:42:03,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 21:42:03,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 21:42:03,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 21:42:03,294 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,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c1a1cc 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,295 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,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 21:42:03,400 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 21:42:03,625 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_pop_harness.i[4496,4509] [2021-11-16 21:42:03,632 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_pop_harness.i[4556,4569] [2021-11-16 21:42:03,654 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:42:03,661 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:42:04,258 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,259 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,259 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,260 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,261 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,284 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,284 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,286 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,286 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,287 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,288 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,289 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,289 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,520 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:42:04,521 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:42:04,522 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:42:04,523 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:42:04,524 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:42:04,525 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:42:04,525 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:42:04,526 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:42:04,526 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:42:04,527 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:42:04,622 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:42:04,643 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,650 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,723 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,724 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,724 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,724 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,725 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,725 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,725 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,726 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,727 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,727 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,727 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,728 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,730 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,730 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,730 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,731 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,734 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,734 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,757 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:42:04,783 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 21:42:04,797 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_pop_harness.i[4496,4509] [2021-11-16 21:42:04,798 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_pop_harness.i[4556,4569] [2021-11-16 21:42:04,799 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 21:42:04,800 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 21:42:04,829 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,829 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,830 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,830 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,830 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,835 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,836 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,836 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,837 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,837 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,838 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,838 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,838 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,885 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 21:42:04,886 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 21:42:04,887 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 21:42:04,887 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 21:42:04,888 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 21:42:04,889 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 21:42:04,890 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 21:42:04,890 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 21:42:04,891 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 21:42:04,891 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 21:42:04,925 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 21:42:04,938 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,948 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,979 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,980 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,980 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,980 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,980 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,983 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,983 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,984 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,984 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,985 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,986 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,986 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,986 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,988 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,988 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,988 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,989 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,993 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:04,993 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:05,001 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:05,002 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:05,002 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 21:42:05,013 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 21:42:05,247 INFO L208 MainTranslator]: Completed translation [2021-11-16 21:42:05,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:42:05 WrapperNode [2021-11-16 21:42:05,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 21:42:05,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 21:42:05,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 21:42:05,248 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 21:42:05,254 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:05" (1/1) ... [2021-11-16 21:42:05,386 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:05" (1/1) ... [2021-11-16 21:42:05,473 INFO L137 Inliner]: procedures = 719, calls = 1920, calls flagged for inlining = 60, calls inlined = 15, statements flattened = 1012 [2021-11-16 21:42:05,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 21:42:05,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 21:42:05,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 21:42:05,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 21:42:05,482 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:05" (1/1) ... [2021-11-16 21:42:05,484 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:05" (1/1) ... [2021-11-16 21:42:05,510 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:05" (1/1) ... [2021-11-16 21:42:05,511 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:05" (1/1) ... [2021-11-16 21:42:05,574 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:05" (1/1) ... [2021-11-16 21:42:05,584 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:05" (1/1) ... [2021-11-16 21:42:05,603 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:05" (1/1) ... [2021-11-16 21:42:05,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 21:42:05,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 21:42:05,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 21:42:05,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 21:42:05,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:42:05" (1/1) ... [2021-11-16 21:42:05,635 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 21:42:05,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:42:05,665 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,681 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,699 INFO L130 BoogieDeclarations]: Found specification of procedure s_swap [2021-11-16 21:42:05,699 INFO L138 BoogieDeclarations]: Found implementation of procedure s_swap [2021-11-16 21:42:05,699 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2021-11-16 21:42:05,700 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2021-11-16 21:42:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 21:42:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2021-11-16 21:42:05,700 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2021-11-16 21:42:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2021-11-16 21:42:05,700 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2021-11-16 21:42:05,701 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-11-16 21:42:05,701 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-11-16 21:42:05,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-16 21:42:05,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-16 21:42:05,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-16 21:42:05,702 INFO L130 BoogieDeclarations]: Found specification of procedure s_sift_up [2021-11-16 21:42:05,702 INFO L138 BoogieDeclarations]: Found implementation of procedure s_sift_up [2021-11-16 21:42:05,702 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2021-11-16 21:42:05,702 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2021-11-16 21:42:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 21:42:05,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 21:42:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure s_remove_node [2021-11-16 21:42:05,703 INFO L138 BoogieDeclarations]: Found implementation of procedure s_remove_node [2021-11-16 21:42:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~C_INT [2021-11-16 21:42:05,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~C_INT [2021-11-16 21:42:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 21:42:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 21:42:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 21:42:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure my_abort [2021-11-16 21:42:05,703 INFO L138 BoogieDeclarations]: Found implementation of procedure my_abort [2021-11-16 21:42:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2021-11-16 21:42:05,703 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2021-11-16 21:42:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 21:42:05,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 21:42:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 21:42:05,704 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 21:42:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-16 21:42:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-16 21:42:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2021-11-16 21:42:05,704 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2021-11-16 21:42:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-16 21:42:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2021-11-16 21:42:05,704 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2021-11-16 21:42:05,704 INFO L130 BoogieDeclarations]: Found specification of procedure aws_priority_queue_is_valid [2021-11-16 21:42:05,705 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_priority_queue_is_valid [2021-11-16 21:42:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_length [2021-11-16 21:42:05,705 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_length [2021-11-16 21:42:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-16 21:42:05,705 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-16 21:42:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 21:42:05,705 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 21:42:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2021-11-16 21:42:05,705 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2021-11-16 21:42:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_pop_back [2021-11-16 21:42:05,705 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_pop_back [2021-11-16 21:42:05,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 21:42:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-16 21:42:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 21:42:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-16 21:42:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 21:42:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_get_at_ptr [2021-11-16 21:42:05,706 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_get_at_ptr [2021-11-16 21:42:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-11-16 21:42:05,706 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-11-16 21:42:05,706 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2021-11-16 21:42:05,706 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2021-11-16 21:42:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-16 21:42:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2021-11-16 21:42:05,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2021-11-16 21:42:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure aws_priority_queue_backpointer_index_valid [2021-11-16 21:42:05,707 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_priority_queue_backpointer_index_valid [2021-11-16 21:42:05,707 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_get_at [2021-11-16 21:42:05,707 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_get_at [2021-11-16 21:42:06,132 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 21:42:06,133 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 21:42:09,908 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 21:42:09,921 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 21:42:09,922 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-16 21:42:09,925 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,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 21:42:09,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 21:42:09,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 21:42:09,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 21:42:09,930 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,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f95de13 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,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:42:05" (2/3) ... [2021-11-16 21:42:09,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f95de13 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,931 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,939 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_pop_harness.i [2021-11-16 21:42:09,947 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 21:42:09,948 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-16 21:42:09,994 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 21:42:10,003 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:10,003 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-16 21:42:10,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 444 states, 259 states have (on average 1.2664092664092663) internal successors, (328), 262 states have internal predecessors, (328), 156 states have call successors, (156), 27 states have call predecessors, (156), 27 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2021-11-16 21:42:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-11-16 21:42:10,052 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:42:10,053 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,054 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:42:10,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:42:10,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1834595556, now seen corresponding path program 1 times [2021-11-16 21:42:10,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:42:10,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234298757] [2021-11-16 21:42:10,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:42:10,073 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:42:10,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:42:10,075 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:10,113 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:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:42:10,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-16 21:42:10,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:42:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-11-16 21:42:10,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:42:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2021-11-16 21:42:11,220 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:42:11,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234298757] [2021-11-16 21:42:11,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234298757] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 21:42:11,221 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:42:11,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-16 21:42:11,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906104666] [2021-11-16 21:42:11,223 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 21:42:11,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-16 21:42:11,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:42:11,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-16 21:42:11,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-16 21:42:11,265 INFO L87 Difference]: Start difference. First operand has 444 states, 259 states have (on average 1.2664092664092663) internal successors, (328), 262 states have internal predecessors, (328), 156 states have call successors, (156), 27 states have call predecessors, (156), 27 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-16 21:42:11,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:42:11,374 INFO L93 Difference]: Finished difference Result 875 states and 1391 transitions. [2021-11-16 21:42:11,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-16 21:42:11,376 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2021-11-16 21:42:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:42:11,393 INFO L225 Difference]: With dead ends: 875 [2021-11-16 21:42:11,393 INFO L226 Difference]: Without dead ends: 437 [2021-11-16 21:42:11,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 264 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:11,406 INFO L933 BasicCegarLoop]: 629 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, 629 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:11,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 629 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:11,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-11-16 21:42:11,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2021-11-16 21:42:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 253 states have (on average 1.2411067193675889) internal successors, (314), 256 states have internal predecessors, (314), 156 states have call successors, (156), 27 states have call predecessors, (156), 26 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2021-11-16 21:42:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 624 transitions. [2021-11-16 21:42:11,497 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 624 transitions. Word has length 133 [2021-11-16 21:42:11,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:42:11,498 INFO L470 AbstractCegarLoop]: Abstraction has 437 states and 624 transitions. [2021-11-16 21:42:11,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-11-16 21:42:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 624 transitions. [2021-11-16 21:42:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-11-16 21:42:11,501 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:42:11,501 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-16 21:42:11,712 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:11,713 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:42:11,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:42:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash 133133086, now seen corresponding path program 1 times [2021-11-16 21:42:11,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:42:11,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030305635] [2021-11-16 21:42:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:42:11,720 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:42:11,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:42:11,721 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:11,722 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:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:42:12,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-16 21:42:12,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:42:12,681 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-11-16 21:42:12,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:42:13,095 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2021-11-16 21:42:13,095 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:42:13,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030305635] [2021-11-16 21:42:13,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030305635] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:42:13,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:42:13,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2021-11-16 21:42:13,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3789635] [2021-11-16 21:42:13,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:42:13,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 21:42:13,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:42:13,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 21:42:13,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:42:13,098 INFO L87 Difference]: Start difference. First operand 437 states and 624 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-16 21:42:15,238 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:15,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:42:15,605 INFO L93 Difference]: Finished difference Result 840 states and 1217 transitions. [2021-11-16 21:42:15,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:42:15,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 133 [2021-11-16 21:42:15,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:42:15,614 INFO L225 Difference]: With dead ends: 840 [2021-11-16 21:42:15,614 INFO L226 Difference]: Without dead ends: 439 [2021-11-16 21:42:15,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 260 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:15,620 INFO L933 BasicCegarLoop]: 599 mSDtfsCounter, 35 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 2312 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:15,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 2312 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:15,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-11-16 21:42:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2021-11-16 21:42:15,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 254 states have (on average 1.2401574803149606) internal successors, (315), 258 states have internal predecessors, (315), 156 states have call successors, (156), 27 states have call predecessors, (156), 27 states have return successors, (168), 154 states have call predecessors, (168), 154 states have call successors, (168) [2021-11-16 21:42:15,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 639 transitions. [2021-11-16 21:42:15,657 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 639 transitions. Word has length 133 [2021-11-16 21:42:15,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:42:15,659 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 639 transitions. [2021-11-16 21:42:15,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-16 21:42:15,659 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 639 transitions. [2021-11-16 21:42:15,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-11-16 21:42:15,662 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:42:15,662 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:42:15,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-16 21:42:15,867 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:15,868 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:42:15,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:42:15,868 INFO L85 PathProgramCache]: Analyzing trace with hash 74249020, now seen corresponding path program 1 times [2021-11-16 21:42:15,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:42:15,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787045891] [2021-11-16 21:42:15,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:42:15,870 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:42:15,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:42:15,871 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:15,873 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:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:42:16,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 1257 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 21:42:16,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:42:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-11-16 21:42:17,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:42:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2021-11-16 21:42:17,634 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:42:17,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787045891] [2021-11-16 21:42:17,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787045891] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:42:17,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:42:17,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2021-11-16 21:42:17,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051379388] [2021-11-16 21:42:17,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:42:17,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 21:42:17,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:42:17,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 21:42:17,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:42:17,636 INFO L87 Difference]: Start difference. First operand 439 states and 639 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2021-11-16 21:42:20,008 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:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:42:20,842 INFO L93 Difference]: Finished difference Result 863 states and 1290 transitions. [2021-11-16 21:42:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 21:42:20,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 141 [2021-11-16 21:42:20,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:42:20,847 INFO L225 Difference]: With dead ends: 863 [2021-11-16 21:42:20,847 INFO L226 Difference]: Without dead ends: 460 [2021-11-16 21:42:20,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 273 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:20,850 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 87 mSDsluCounter, 2761 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 3338 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.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:42:20,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 3338 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 336 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2021-11-16 21:42:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-11-16 21:42:20,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 458. [2021-11-16 21:42:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 270 states have (on average 1.2481481481481482) internal successors, (337), 274 states have internal predecessors, (337), 158 states have call successors, (158), 27 states have call predecessors, (158), 28 states have return successors, (187), 157 states have call predecessors, (187), 156 states have call successors, (187) [2021-11-16 21:42:20,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 682 transitions. [2021-11-16 21:42:20,879 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 682 transitions. Word has length 141 [2021-11-16 21:42:20,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:42:20,880 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 682 transitions. [2021-11-16 21:42:20,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2021-11-16 21:42:20,881 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 682 transitions. [2021-11-16 21:42:20,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-16 21:42:20,885 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:42:20,885 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:42:20,912 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:21,107 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:21,108 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:42:21,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:42:21,109 INFO L85 PathProgramCache]: Analyzing trace with hash -782989412, now seen corresponding path program 1 times [2021-11-16 21:42:21,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:42:21,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216969405] [2021-11-16 21:42:21,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:42:21,111 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:42:21,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:42:21,113 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:21,115 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:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:42:21,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 21:42:21,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:42:22,430 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-11-16 21:42:22,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:42:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2021-11-16 21:42:23,059 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:42:23,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216969405] [2021-11-16 21:42:23,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216969405] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:42:23,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:42:23,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2021-11-16 21:42:23,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55974359] [2021-11-16 21:42:23,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:42:23,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:42:23,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:42:23,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:42:23,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:42:23,060 INFO L87 Difference]: Start difference. First operand 458 states and 682 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2021-11-16 21:42:25,372 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:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:42:26,084 INFO L93 Difference]: Finished difference Result 888 states and 1365 transitions. [2021-11-16 21:42:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 21:42:26,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 156 [2021-11-16 21:42:26,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:42:26,090 INFO L225 Difference]: With dead ends: 888 [2021-11-16 21:42:26,091 INFO L226 Difference]: Without dead ends: 466 [2021-11-16 21:42:26,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 304 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:26,096 INFO L933 BasicCegarLoop]: 593 mSDtfsCounter, 58 mSDsluCounter, 2260 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 2853 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.9s IncrementalHoareTripleChecker+Time [2021-11-16 21:42:26,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 2853 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2021-11-16 21:42:26,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-11-16 21:42:26,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 458. [2021-11-16 21:42:26,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 270 states have (on average 1.2481481481481482) internal successors, (337), 274 states have internal predecessors, (337), 158 states have call successors, (158), 27 states have call predecessors, (158), 28 states have return successors, (187), 157 states have call predecessors, (187), 156 states have call successors, (187) [2021-11-16 21:42:26,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 682 transitions. [2021-11-16 21:42:26,122 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 682 transitions. Word has length 156 [2021-11-16 21:42:26,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:42:26,123 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 682 transitions. [2021-11-16 21:42:26,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2021-11-16 21:42:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 682 transitions. [2021-11-16 21:42:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-11-16 21:42:26,127 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:42:26,127 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-16 21:42:26,347 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:26,347 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:42:26,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:42:26,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1549701389, now seen corresponding path program 1 times [2021-11-16 21:42:26,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:42:26,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963921843] [2021-11-16 21:42:26,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:42:26,349 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:42:26,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:42:26,350 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:26,351 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:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:42:27,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 1379 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 21:42:27,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:42:27,619 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-11-16 21:42:27,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:42:28,421 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-11-16 21:42:28,422 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:42:28,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963921843] [2021-11-16 21:42:28,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963921843] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:42:28,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:42:28,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2021-11-16 21:42:28,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260234248] [2021-11-16 21:42:28,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:42:28,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:42:28,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:42:28,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:42:28,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:42:28,424 INFO L87 Difference]: Start difference. First operand 458 states and 682 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2021-11-16 21:42:31,235 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:32,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:42:32,263 INFO L93 Difference]: Finished difference Result 910 states and 1384 transitions. [2021-11-16 21:42:32,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 21:42:32,264 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) Word has length 172 [2021-11-16 21:42:32,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:42:32,268 INFO L225 Difference]: With dead ends: 910 [2021-11-16 21:42:32,268 INFO L226 Difference]: Without dead ends: 488 [2021-11-16 21:42:32,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 334 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:32,271 INFO L933 BasicCegarLoop]: 578 mSDtfsCounter, 130 mSDsluCounter, 3305 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 3883 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:32,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 3883 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:32,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-11-16 21:42:32,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 470. [2021-11-16 21:42:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 280 states have (on average 1.2535714285714286) internal successors, (351), 284 states have internal predecessors, (351), 159 states have call successors, (159), 28 states have call predecessors, (159), 29 states have return successors, (188), 158 states have call predecessors, (188), 157 states have call successors, (188) [2021-11-16 21:42:32,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 698 transitions. [2021-11-16 21:42:32,290 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 698 transitions. Word has length 172 [2021-11-16 21:42:32,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:42:32,291 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 698 transitions. [2021-11-16 21:42:32,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2021-11-16 21:42:32,291 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 698 transitions. [2021-11-16 21:42:32,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-11-16 21:42:32,293 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:42:32,294 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,328 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:32,515 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:32,516 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:42:32,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:42:32,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1969354101, now seen corresponding path program 2 times [2021-11-16 21:42:32,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:42:32,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59999637] [2021-11-16 21:42:32,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 21:42:32,518 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:42:32,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:42:32,518 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:32,519 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:04,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 21:43:04,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 21:43:04,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 1453 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-16 21:43:04,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:43:05,574 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-11-16 21:43:05,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:43:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2021-11-16 21:43:06,291 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:43:06,291 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59999637] [2021-11-16 21:43:06,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59999637] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:43:06,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:43:06,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2021-11-16 21:43:06,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652376836] [2021-11-16 21:43:06,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:43:06,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:43:06,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:43:06,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:43:06,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:43:06,293 INFO L87 Difference]: Start difference. First operand 470 states and 698 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-16 21:43:09,344 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:11,354 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:13,369 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:14,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:43:14,502 INFO L93 Difference]: Finished difference Result 940 states and 1458 transitions. [2021-11-16 21:43:14,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:43:14,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 187 [2021-11-16 21:43:14,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:43:14,509 INFO L225 Difference]: With dead ends: 940 [2021-11-16 21:43:14,509 INFO L226 Difference]: Without dead ends: 506 [2021-11-16 21:43:14,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:43:14,513 INFO L933 BasicCegarLoop]: 635 mSDtfsCounter, 21 mSDsluCounter, 2319 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 2954 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2021-11-16 21:43:14,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 2954 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 3 Unknown, 0 Unchecked, 7.9s Time] [2021-11-16 21:43:14,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-11-16 21:43:14,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 478. [2021-11-16 21:43:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 288 states have (on average 1.2534722222222223) internal successors, (361), 292 states have internal predecessors, (361), 159 states have call successors, (159), 28 states have call predecessors, (159), 29 states have return successors, (188), 158 states have call predecessors, (188), 157 states have call successors, (188) [2021-11-16 21:43:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 708 transitions. [2021-11-16 21:43:14,534 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 708 transitions. Word has length 187 [2021-11-16 21:43:14,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:43:14,535 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 708 transitions. [2021-11-16 21:43:14,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-16 21:43:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 708 transitions. [2021-11-16 21:43:14,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-11-16 21:43:14,537 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:43:14,538 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,575 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:14,751 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:14,751 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:43:14,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:43:14,752 INFO L85 PathProgramCache]: Analyzing trace with hash -402596151, now seen corresponding path program 1 times [2021-11-16 21:43:14,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:43:14,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019343383] [2021-11-16 21:43:14,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:43:14,754 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:43:14,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:43:14,755 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:14,755 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:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:43:15,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 21:43:15,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:43:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-11-16 21:43:16,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:43:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2021-11-16 21:43:16,985 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:43:16,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019343383] [2021-11-16 21:43:16,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019343383] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:43:16,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:43:16,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2021-11-16 21:43:16,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263319366] [2021-11-16 21:43:16,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:43:16,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 21:43:16,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:43:16,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 21:43:16,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:43:16,987 INFO L87 Difference]: Start difference. First operand 478 states and 708 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-16 21:43:20,077 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:22,089 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:24,110 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:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:43:25,231 INFO L93 Difference]: Finished difference Result 950 states and 1468 transitions. [2021-11-16 21:43:25,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 21:43:25,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 187 [2021-11-16 21:43:25,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:43:25,238 INFO L225 Difference]: With dead ends: 950 [2021-11-16 21:43:25,238 INFO L226 Difference]: Without dead ends: 508 [2021-11-16 21:43:25,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 365 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:25,243 INFO L933 BasicCegarLoop]: 633 mSDtfsCounter, 17 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2021-11-16 21:43:25,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 3574 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 271 Invalid, 3 Unknown, 0 Unchecked, 7.9s Time] [2021-11-16 21:43:25,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-11-16 21:43:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 482. [2021-11-16 21:43:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 292 states have (on average 1.25) internal successors, (365), 296 states have internal predecessors, (365), 159 states have call successors, (159), 28 states have call predecessors, (159), 29 states have return successors, (188), 158 states have call predecessors, (188), 157 states have call successors, (188) [2021-11-16 21:43:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 712 transitions. [2021-11-16 21:43:25,290 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 712 transitions. Word has length 187 [2021-11-16 21:43:25,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:43:25,291 INFO L470 AbstractCegarLoop]: Abstraction has 482 states and 712 transitions. [2021-11-16 21:43:25,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-16 21:43:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 712 transitions. [2021-11-16 21:43:25,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-11-16 21:43:25,293 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:43:25,294 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,335 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:25,515 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:25,516 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:43:25,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:43:25,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1545098617, now seen corresponding path program 1 times [2021-11-16 21:43:25,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:43:25,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552312478] [2021-11-16 21:43:25,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:43:25,518 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:43:25,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:43:25,519 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:25,519 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:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:43:26,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-16 21:43:26,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:43:34,711 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:43:34,721 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:43:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-11-16 21:43:35,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:43:41,074 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-16 21:43:41,075 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:43:41,118 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-11-16 21:43:41,118 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:43:41,470 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2021-11-16 21:43:41,470 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:43:41,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552312478] [2021-11-16 21:43:41,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552312478] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:43:41,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:43:41,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 13 [2021-11-16 21:43:41,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103975948] [2021-11-16 21:43:41,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:43:41,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 21:43:41,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:43:41,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 21:43:41,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=124, Unknown=2, NotChecked=0, Total=156 [2021-11-16 21:43:41,473 INFO L87 Difference]: Start difference. First operand 482 states and 712 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 6 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2021-11-16 21:43:49,548 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:51,560 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:53,579 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:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:43:56,061 INFO L93 Difference]: Finished difference Result 964 states and 1483 transitions. [2021-11-16 21:43:56,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-16 21:43:56,063 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 6 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 187 [2021-11-16 21:43:56,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:43:56,067 INFO L225 Difference]: With dead ends: 964 [2021-11-16 21:43:56,068 INFO L226 Difference]: Without dead ends: 545 [2021-11-16 21:43:56,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 359 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=83, Invalid=293, Unknown=4, NotChecked=0, Total=380 [2021-11-16 21:43:56,075 INFO L933 BasicCegarLoop]: 609 mSDtfsCounter, 88 mSDsluCounter, 3976 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 4585 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2021-11-16 21:43:56,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 4585 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 615 Invalid, 3 Unknown, 150 Unchecked, 9.4s Time] [2021-11-16 21:43:56,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-11-16 21:43:56,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 519. [2021-11-16 21:43:56,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 319 states have (on average 1.2413793103448276) internal successors, (396), 323 states have internal predecessors, (396), 164 states have call successors, (164), 32 states have call predecessors, (164), 34 states have return successors, (208), 164 states have call predecessors, (208), 162 states have call successors, (208) [2021-11-16 21:43:56,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 768 transitions. [2021-11-16 21:43:56,106 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 768 transitions. Word has length 187 [2021-11-16 21:43:56,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:43:56,106 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 768 transitions. [2021-11-16 21:43:56,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 6 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2021-11-16 21:43:56,106 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 768 transitions. [2021-11-16 21:43:56,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-11-16 21:43:56,109 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:43:56,109 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-11-16 21:43:56,327 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,327 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:43:56,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:43:56,328 INFO L85 PathProgramCache]: Analyzing trace with hash 446482249, now seen corresponding path program 1 times [2021-11-16 21:43:56,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:43:56,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060026395] [2021-11-16 21:43:56,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:43:56,329 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:43:56,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:43:56,330 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,331 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,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:43:57,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-16 21:43:57,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:43:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-11-16 21:43:57,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:43:57,953 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2021-11-16 21:43:57,953 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:43:57,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060026395] [2021-11-16 21:43:57,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060026395] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:43:57,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:43:57,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2021-11-16 21:43:57,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784036970] [2021-11-16 21:43:57,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:43:57,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 21:43:57,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:43:57,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 21:43:57,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 21:43:57,955 INFO L87 Difference]: Start difference. First operand 519 states and 768 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-16 21:43:58,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:43:58,100 INFO L93 Difference]: Finished difference Result 997 states and 1547 transitions. [2021-11-16 21:43:58,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:43:58,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 187 [2021-11-16 21:43:58,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:43:58,105 INFO L225 Difference]: With dead ends: 997 [2021-11-16 21:43:58,105 INFO L226 Difference]: Without dead ends: 539 [2021-11-16 21:43:58,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 369 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:43:58,109 INFO L933 BasicCegarLoop]: 647 mSDtfsCounter, 8 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2564 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:43:58,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 2564 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 21:43:58,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-11-16 21:43:58,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 527. [2021-11-16 21:43:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 327 states have (on average 1.238532110091743) internal successors, (405), 331 states have internal predecessors, (405), 164 states have call successors, (164), 32 states have call predecessors, (164), 34 states have return successors, (208), 164 states have call predecessors, (208), 162 states have call successors, (208) [2021-11-16 21:43:58,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 777 transitions. [2021-11-16 21:43:58,132 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 777 transitions. Word has length 187 [2021-11-16 21:43:58,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:43:58,133 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 777 transitions. [2021-11-16 21:43:58,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-11-16 21:43:58,133 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 777 transitions. [2021-11-16 21:43:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-16 21:43:58,135 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:43:58,136 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-16 21:43:58,351 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:43:58,352 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:43:58,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:43:58,352 INFO L85 PathProgramCache]: Analyzing trace with hash 519703029, now seen corresponding path program 1 times [2021-11-16 21:43:58,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:43:58,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389879685] [2021-11-16 21:43:58,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:43:58,354 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:43:58,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:43:58,355 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:43:58,357 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:43:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:43:59,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-16 21:43:59,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:43:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-11-16 21:43:59,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:44:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2021-11-16 21:44:00,273 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:44:00,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389879685] [2021-11-16 21:44:00,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389879685] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 21:44:00,273 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:44:00,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2021-11-16 21:44:00,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033889535] [2021-11-16 21:44:00,273 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 21:44:00,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 21:44:00,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:44:00,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 21:44:00,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:44:00,275 INFO L87 Difference]: Start difference. First operand 527 states and 777 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-16 21:44:02,365 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:02,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:44:02,478 INFO L93 Difference]: Finished difference Result 984 states and 1472 transitions. [2021-11-16 21:44:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 21:44:02,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) Word has length 188 [2021-11-16 21:44:02,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:44:02,483 INFO L225 Difference]: With dead ends: 984 [2021-11-16 21:44:02,483 INFO L226 Difference]: Without dead ends: 547 [2021-11-16 21:44:02,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:44:02,487 INFO L933 BasicCegarLoop]: 625 mSDtfsCounter, 7 mSDsluCounter, 3112 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3737 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:44:02,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 3737 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-11-16 21:44:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-11-16 21:44:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2021-11-16 21:44:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 341 states have (on average 1.2375366568914956) internal successors, (422), 345 states have internal predecessors, (422), 166 states have call successors, (166), 32 states have call predecessors, (166), 36 states have return successors, (216), 168 states have call predecessors, (216), 164 states have call successors, (216) [2021-11-16 21:44:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 804 transitions. [2021-11-16 21:44:02,509 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 804 transitions. Word has length 188 [2021-11-16 21:44:02,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:44:02,509 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 804 transitions. [2021-11-16 21:44:02,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-16 21:44:02,510 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 804 transitions. [2021-11-16 21:44:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-16 21:44:02,512 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:44:02,512 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,549 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:02,731 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:02,731 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:44:02,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:44:02,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1395722035, now seen corresponding path program 1 times [2021-11-16 21:44:02,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:44:02,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049823822] [2021-11-16 21:44:02,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:44:02,733 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:44:02,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:44:02,734 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:02,734 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:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:44:03,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-16 21:44:03,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:44:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-11-16 21:44:04,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:44:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2021-11-16 21:44:04,745 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:44:04,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049823822] [2021-11-16 21:44:04,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049823822] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:44:04,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:44:04,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 10 [2021-11-16 21:44:04,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208826731] [2021-11-16 21:44:04,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:44:04,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:44:04,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:44:04,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:44:04,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-16 21:44:04,747 INFO L87 Difference]: Start difference. First operand 545 states and 804 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2021-11-16 21:44:07,000 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:44:08,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:44:08,032 INFO L93 Difference]: Finished difference Result 982 states and 1468 transitions. [2021-11-16 21:44:08,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:44:08,033 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 188 [2021-11-16 21:44:08,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:44:08,037 INFO L225 Difference]: With dead ends: 982 [2021-11-16 21:44:08,038 INFO L226 Difference]: Without dead ends: 530 [2021-11-16 21:44:08,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 366 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:44:08,041 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 8 mSDsluCounter, 4021 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4608 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:44:08,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 4608 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 398 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2021-11-16 21:44:08,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-11-16 21:44:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2021-11-16 21:44:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 329 states have (on average 1.2310030395136777) internal successors, (405), 334 states have internal predecessors, (405), 164 states have call successors, (164), 32 states have call predecessors, (164), 35 states have return successors, (210), 164 states have call predecessors, (210), 162 states have call successors, (210) [2021-11-16 21:44:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 779 transitions. [2021-11-16 21:44:08,068 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 779 transitions. Word has length 188 [2021-11-16 21:44:08,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:44:08,069 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 779 transitions. [2021-11-16 21:44:08,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2021-11-16 21:44:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 779 transitions. [2021-11-16 21:44:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-11-16 21:44:08,072 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:44:08,072 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,111 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:08,287 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:08,288 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:44:08,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:44:08,288 INFO L85 PathProgramCache]: Analyzing trace with hash -807170079, now seen corresponding path program 1 times [2021-11-16 21:44:08,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:44:08,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465177111] [2021-11-16 21:44:08,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:44:08,290 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:44:08,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:44:08,290 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:08,291 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:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:44:09,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 1471 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 21:44:09,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:44:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-11-16 21:44:09,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:44:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-11-16 21:44:10,254 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:44:10,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465177111] [2021-11-16 21:44:10,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465177111] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 21:44:10,254 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:44:10,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2021-11-16 21:44:10,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459217489] [2021-11-16 21:44:10,255 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 21:44:10,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 21:44:10,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:44:10,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 21:44:10,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-16 21:44:10,256 INFO L87 Difference]: Start difference. First operand 530 states and 779 transitions. Second operand has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 7 states have internal predecessors, (91), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (31), 3 states have call predecessors, (31), 4 states have call successors, (31) [2021-11-16 21:44:12,483 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:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:44:13,062 INFO L93 Difference]: Finished difference Result 966 states and 1451 transitions. [2021-11-16 21:44:13,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:44:13,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 7 states have internal predecessors, (91), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (31), 3 states have call predecessors, (31), 4 states have call successors, (31) Word has length 199 [2021-11-16 21:44:13,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:44:13,067 INFO L225 Difference]: With dead ends: 966 [2021-11-16 21:44:13,067 INFO L226 Difference]: Without dead ends: 532 [2021-11-16 21:44:13,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 392 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:44:13,070 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 66 mSDsluCounter, 2246 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2838 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-16 21:44:13,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 2838 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 156 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2021-11-16 21:44:13,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-11-16 21:44:13,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2021-11-16 21:44:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 330 states have (on average 1.2303030303030302) internal successors, (406), 336 states have internal predecessors, (406), 164 states have call successors, (164), 32 states have call predecessors, (164), 36 states have return successors, (221), 164 states have call predecessors, (221), 162 states have call successors, (221) [2021-11-16 21:44:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 791 transitions. [2021-11-16 21:44:13,103 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 791 transitions. Word has length 199 [2021-11-16 21:44:13,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:44:13,104 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 791 transitions. [2021-11-16 21:44:13,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 7 states have internal predecessors, (91), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (31), 3 states have call predecessors, (31), 4 states have call successors, (31) [2021-11-16 21:44:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 791 transitions. [2021-11-16 21:44:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-11-16 21:44:13,107 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:44:13,107 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-16 21:44:13,327 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:44:13,328 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:44:13,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:44:13,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1196534915, now seen corresponding path program 1 times [2021-11-16 21:44:13,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:44:13,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802616211] [2021-11-16 21:44:13,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:44:13,329 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:44:13,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:44:13,330 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:44:13,331 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:44:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:44:14,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 1501 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 21:44:14,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:44:14,784 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2021-11-16 21:44:14,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:44:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-11-16 21:44:15,699 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:44:15,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802616211] [2021-11-16 21:44:15,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802616211] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:44:15,700 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:44:15,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 10 [2021-11-16 21:44:15,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921166205] [2021-11-16 21:44:15,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:44:15,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 21:44:15,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:44:15,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 21:44:15,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-16 21:44:15,701 INFO L87 Difference]: Start difference. First operand 532 states and 791 transitions. Second operand has 8 states, 7 states have (on average 13.428571428571429) internal successors, (94), 8 states have internal predecessors, (94), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (26), 4 states have call predecessors, (26), 5 states have call successors, (26) [2021-11-16 21:44:18,370 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:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:44:19,403 INFO L93 Difference]: Finished difference Result 998 states and 1512 transitions. [2021-11-16 21:44:19,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:44:19,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.428571428571429) internal successors, (94), 8 states have internal predecessors, (94), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (26), 4 states have call predecessors, (26), 5 states have call successors, (26) Word has length 207 [2021-11-16 21:44:19,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:44:19,409 INFO L225 Difference]: With dead ends: 998 [2021-11-16 21:44:19,409 INFO L226 Difference]: Without dead ends: 562 [2021-11-16 21:44:19,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 406 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:44:19,412 INFO L933 BasicCegarLoop]: 570 mSDtfsCounter, 118 mSDsluCounter, 3258 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 3828 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-11-16 21:44:19,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 3828 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 404 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2021-11-16 21:44:19,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-11-16 21:44:19,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 560. [2021-11-16 21:44:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 357 states have (on average 1.2352941176470589) internal successors, (441), 362 states have internal predecessors, (441), 165 states have call successors, (165), 32 states have call predecessors, (165), 36 states have return successors, (222), 166 states have call predecessors, (222), 163 states have call successors, (222) [2021-11-16 21:44:19,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 828 transitions. [2021-11-16 21:44:19,439 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 828 transitions. Word has length 207 [2021-11-16 21:44:19,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:44:19,440 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 828 transitions. [2021-11-16 21:44:19,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.428571428571429) internal successors, (94), 8 states have internal predecessors, (94), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (26), 4 states have call predecessors, (26), 5 states have call successors, (26) [2021-11-16 21:44:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 828 transitions. [2021-11-16 21:44:19,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2021-11-16 21:44:19,442 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:44:19,442 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,484 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:44:19,663 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:44:19,664 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:44:19,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:44:19,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1706346939, now seen corresponding path program 2 times [2021-11-16 21:44:19,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:44:19,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355246312] [2021-11-16 21:44:19,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 21:44:19,666 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:44:19,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:44:19,666 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:44:19,668 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:44:51,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 21:44:51,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 21:44:51,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 1575 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 21:44:51,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:44:51,732 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2021-11-16 21:44:51,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:44:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2021-11-16 21:44:52,583 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:44:52,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355246312] [2021-11-16 21:44:52,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355246312] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 21:44:52,584 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:44:52,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2021-11-16 21:44:52,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512271932] [2021-11-16 21:44:52,584 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 21:44:52,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:44:52,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:44:52,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:44:52,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:44:52,586 INFO L87 Difference]: Start difference. First operand 560 states and 828 transitions. Second operand has 9 states, 8 states have (on average 12.0) internal successors, (96), 9 states have internal predecessors, (96), 6 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (33), 5 states have call predecessors, (33), 6 states have call successors, (33) [2021-11-16 21:44:54,948 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:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:44:55,776 INFO L93 Difference]: Finished difference Result 1032 states and 1575 transitions. [2021-11-16 21:44:55,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:44:55,777 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 12.0) internal successors, (96), 9 states have internal predecessors, (96), 6 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (33), 5 states have call predecessors, (33), 6 states have call successors, (33) Word has length 222 [2021-11-16 21:44:55,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:44:55,781 INFO L225 Difference]: With dead ends: 1032 [2021-11-16 21:44:55,781 INFO L226 Difference]: Without dead ends: 568 [2021-11-16 21:44:55,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 438 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:44:55,785 INFO L933 BasicCegarLoop]: 586 mSDtfsCounter, 115 mSDsluCounter, 2780 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 3366 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:44:55,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 3366 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 298 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2021-11-16 21:44:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-11-16 21:44:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 560. [2021-11-16 21:44:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 357 states have (on average 1.2352941176470589) internal successors, (441), 362 states have internal predecessors, (441), 165 states have call successors, (165), 32 states have call predecessors, (165), 36 states have return successors, (222), 166 states have call predecessors, (222), 163 states have call successors, (222) [2021-11-16 21:44:55,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 828 transitions. [2021-11-16 21:44:55,808 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 828 transitions. Word has length 222 [2021-11-16 21:44:55,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:44:55,809 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 828 transitions. [2021-11-16 21:44:55,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 12.0) internal successors, (96), 9 states have internal predecessors, (96), 6 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (33), 5 states have call predecessors, (33), 6 states have call successors, (33) [2021-11-16 21:44:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 828 transitions. [2021-11-16 21:44:55,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-11-16 21:44:55,811 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:44:55,811 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,855 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:44:56,031 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:44:56,032 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:44:56,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:44:56,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1881400440, now seen corresponding path program 1 times [2021-11-16 21:44:56,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:44:56,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156262686] [2021-11-16 21:44:56,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:44:56,034 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:44:56,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:44:56,037 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:44:56,039 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:44:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:44:57,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 1618 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-16 21:44:57,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:44:57,775 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2021-11-16 21:44:57,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:44:58,858 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2021-11-16 21:44:58,858 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:44:58,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156262686] [2021-11-16 21:44:58,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156262686] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:44:58,859 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:44:58,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 12 [2021-11-16 21:44:58,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030185368] [2021-11-16 21:44:58,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:44:58,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:44:58,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:44:58,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:44:58,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-16 21:44:58,860 INFO L87 Difference]: Start difference. First operand 560 states and 828 transitions. Second operand has 9 states, 8 states have (on average 13.125) internal successors, (105), 9 states have internal predecessors, (105), 6 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (27), 5 states have call predecessors, (27), 6 states have call successors, (27) [2021-11-16 21:45:01,876 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:03,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:45:03,297 INFO L93 Difference]: Finished difference Result 1026 states and 1546 transitions. [2021-11-16 21:45:03,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 21:45:03,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 13.125) internal successors, (105), 9 states have internal predecessors, (105), 6 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (27), 5 states have call predecessors, (27), 6 states have call successors, (27) Word has length 238 [2021-11-16 21:45:03,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:45:03,302 INFO L225 Difference]: With dead ends: 1026 [2021-11-16 21:45:03,302 INFO L226 Difference]: Without dead ends: 562 [2021-11-16 21:45:03,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-11-16 21:45:03,306 INFO L933 BasicCegarLoop]: 571 mSDtfsCounter, 161 mSDsluCounter, 3796 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 4367 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:45:03,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 4367 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 648 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2021-11-16 21:45:03,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-11-16 21:45:03,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 530. [2021-11-16 21:45:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 329 states have (on average 1.2310030395136777) internal successors, (405), 334 states have internal predecessors, (405), 164 states have call successors, (164), 32 states have call predecessors, (164), 35 states have return successors, (207), 164 states have call predecessors, (207), 162 states have call successors, (207) [2021-11-16 21:45:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 776 transitions. [2021-11-16 21:45:03,326 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 776 transitions. Word has length 238 [2021-11-16 21:45:03,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:45:03,327 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 776 transitions. [2021-11-16 21:45:03,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 13.125) internal successors, (105), 9 states have internal predecessors, (105), 6 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (27), 5 states have call predecessors, (27), 6 states have call successors, (27) [2021-11-16 21:45:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 776 transitions. [2021-11-16 21:45:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-11-16 21:45:03,329 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:45:03,329 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-11-16 21:45:03,543 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:03,543 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:45:03,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:45:03,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2073342888, now seen corresponding path program 2 times [2021-11-16 21:45:03,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:45:03,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661912499] [2021-11-16 21:45:03,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 21:45:03,546 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:45:03,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:45:03,547 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:03,548 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:35,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 21:45:35,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 21:45:35,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 1692 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 21:45:35,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:45:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2021-11-16 21:45:36,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:45:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2021-11-16 21:45:36,954 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:45:36,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661912499] [2021-11-16 21:45:36,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661912499] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-16 21:45:36,954 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:45:36,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2021-11-16 21:45:36,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522020257] [2021-11-16 21:45:36,955 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-16 21:45:36,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-16 21:45:36,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:45:36,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-16 21:45:36,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-16 21:45:36,956 INFO L87 Difference]: Start difference. First operand 530 states and 776 transitions. Second operand has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 11 states have internal predecessors, (106), 8 states have call successors, (44), 4 states have call predecessors, (44), 2 states have return successors, (41), 8 states have call predecessors, (41), 7 states have call successors, (41) [2021-11-16 21:45:39,336 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:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:45:40,221 INFO L93 Difference]: Finished difference Result 970 states and 1441 transitions. [2021-11-16 21:45:40,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 21:45:40,222 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 11 states have internal predecessors, (106), 8 states have call successors, (44), 4 states have call predecessors, (44), 2 states have return successors, (41), 8 states have call predecessors, (41), 7 states have call successors, (41) Word has length 253 [2021-11-16 21:45:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:45:40,225 INFO L225 Difference]: With dead ends: 970 [2021-11-16 21:45:40,225 INFO L226 Difference]: Without dead ends: 542 [2021-11-16 21:45:40,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-11-16 21:45:40,227 INFO L933 BasicCegarLoop]: 586 mSDtfsCounter, 103 mSDsluCounter, 3973 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 4559 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:45:40,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 4559 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 337 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2021-11-16 21:45:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2021-11-16 21:45:40,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2021-11-16 21:45:40,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 335 states have (on average 1.2298507462686568) internal successors, (412), 340 states have internal predecessors, (412), 169 states have call successors, (169), 33 states have call predecessors, (169), 36 states have return successors, (212), 169 states have call predecessors, (212), 167 states have call successors, (212) [2021-11-16 21:45:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 793 transitions. [2021-11-16 21:45:40,264 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 793 transitions. Word has length 253 [2021-11-16 21:45:40,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:45:40,265 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 793 transitions. [2021-11-16 21:45:40,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 11 states have internal predecessors, (106), 8 states have call successors, (44), 4 states have call predecessors, (44), 2 states have return successors, (41), 8 states have call predecessors, (41), 7 states have call successors, (41) [2021-11-16 21:45:40,266 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 793 transitions. [2021-11-16 21:45:40,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-11-16 21:45:40,267 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:45:40,268 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-16 21:45:40,487 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:45:40,487 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:45:40,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:45:40,488 INFO L85 PathProgramCache]: Analyzing trace with hash -669863688, now seen corresponding path program 1 times [2021-11-16 21:45:40,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:45:40,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256209501] [2021-11-16 21:45:40,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:45:40,490 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:45:40,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:45:40,491 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:45:40,491 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:45:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:45:46,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 1840 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-16 21:45:46,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:45:47,700 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-16 21:45:47,701 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:48,367 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2021-11-16 21:45:48,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:47:13,271 WARN L227 SmtUtils]: Spent 1.40m 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:14,172 INFO L354 Elim1Store]: treesize reduction 51, result has 40.0 percent of original size [2021-11-16 21:47:14,172 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:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 9 proven. 50 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2021-11-16 21:47:15,000 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:47:15,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256209501] [2021-11-16 21:47:15,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256209501] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:47:15,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:47:15,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 14 [2021-11-16 21:47:15,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308370820] [2021-11-16 21:47:15,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:15,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-16 21:47:15,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:47:15,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-16 21:47:15,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:47:15,003 INFO L87 Difference]: Start difference. First operand 542 states and 793 transitions. Second operand has 12 states, 11 states have (on average 10.181818181818182) internal successors, (112), 12 states have internal predecessors, (112), 7 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 7 states have call predecessors, (30), 7 states have call successors, (30) [2021-11-16 21:47:19,441 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:22,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:22,863 INFO L93 Difference]: Finished difference Result 1098 states and 1697 transitions. [2021-11-16 21:47:22,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-16 21:47:22,865 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.181818181818182) internal successors, (112), 12 states have internal predecessors, (112), 7 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 7 states have call predecessors, (30), 7 states have call successors, (30) Word has length 283 [2021-11-16 21:47:22,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:22,868 INFO L225 Difference]: With dead ends: 1098 [2021-11-16 21:47:22,869 INFO L226 Difference]: Without dead ends: 592 [2021-11-16 21:47:22,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2021-11-16 21:47:22,872 INFO L933 BasicCegarLoop]: 584 mSDtfsCounter, 111 mSDsluCounter, 4409 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 4993 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:47:22,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 4993 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1108 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2021-11-16 21:47:22,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2021-11-16 21:47:22,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 552. [2021-11-16 21:47:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 343 states have (on average 1.2244897959183674) internal successors, (420), 348 states have internal predecessors, (420), 169 states have call successors, (169), 33 states have call predecessors, (169), 38 states have return successors, (231), 171 states have call predecessors, (231), 167 states have call successors, (231) [2021-11-16 21:47:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 820 transitions. [2021-11-16 21:47:22,894 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 820 transitions. Word has length 283 [2021-11-16 21:47:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:22,895 INFO L470 AbstractCegarLoop]: Abstraction has 552 states and 820 transitions. [2021-11-16 21:47:22,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.181818181818182) internal successors, (112), 12 states have internal predecessors, (112), 7 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 7 states have call predecessors, (30), 7 states have call successors, (30) [2021-11-16 21:47:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 820 transitions. [2021-11-16 21:47:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-11-16 21:47:22,897 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:22,897 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-11-16 21:47:23,113 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:23,113 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:23,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:23,114 INFO L85 PathProgramCache]: Analyzing trace with hash -575082312, now seen corresponding path program 1 times [2021-11-16 21:47:23,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:47:23,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411025420] [2021-11-16 21:47:23,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:23,115 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:47:23,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:47:23,116 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:23,117 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:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:24,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 1834 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 21:47:24,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:47:24,950 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2021-11-16 21:47:24,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:47:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2021-11-16 21:47:25,533 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:47:25,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411025420] [2021-11-16 21:47:25,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411025420] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:47:25,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:47:25,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2021-11-16 21:47:25,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028925555] [2021-11-16 21:47:25,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:25,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 21:47:25,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:47:25,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 21:47:25,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 21:47:25,536 INFO L87 Difference]: Start difference. First operand 552 states and 820 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-16 21:47:25,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:25,621 INFO L93 Difference]: Finished difference Result 1068 states and 1675 transitions. [2021-11-16 21:47:25,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 21:47:25,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 283 [2021-11-16 21:47:25,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:25,626 INFO L225 Difference]: With dead ends: 1068 [2021-11-16 21:47:25,626 INFO L226 Difference]: Without dead ends: 552 [2021-11-16 21:47:25,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 563 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:25,630 INFO L933 BasicCegarLoop]: 627 mSDtfsCounter, 7 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1861 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:25,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 1861 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:25,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2021-11-16 21:47:25,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2021-11-16 21:47:25,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 343 states have (on average 1.21865889212828) internal successors, (418), 348 states have internal predecessors, (418), 169 states have call successors, (169), 33 states have call predecessors, (169), 38 states have return successors, (231), 171 states have call predecessors, (231), 167 states have call successors, (231) [2021-11-16 21:47:25,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 818 transitions. [2021-11-16 21:47:25,652 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 818 transitions. Word has length 283 [2021-11-16 21:47:25,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:25,653 INFO L470 AbstractCegarLoop]: Abstraction has 552 states and 818 transitions. [2021-11-16 21:47:25,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-11-16 21:47:25,653 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 818 transitions. [2021-11-16 21:47:25,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2021-11-16 21:47:25,655 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:25,655 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-11-16 21:47:25,871 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:25,872 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:25,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:25,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1979994184, now seen corresponding path program 1 times [2021-11-16 21:47:25,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:47:25,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680818277] [2021-11-16 21:47:25,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:25,874 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:47:25,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:47:25,875 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:25,881 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:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:26,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 1861 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-16 21:47:26,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:47:27,766 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2021-11-16 21:47:27,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:47:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2021-11-16 21:47:28,488 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:47:28,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680818277] [2021-11-16 21:47:28,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680818277] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:47:28,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:47:28,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-11-16 21:47:28,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111402463] [2021-11-16 21:47:28,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:28,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 21:47:28,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:47:28,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 21:47:28,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:47:28,490 INFO L87 Difference]: Start difference. First operand 552 states and 818 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, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2021-11-16 21:47:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:28,661 INFO L93 Difference]: Finished difference Result 1051 states and 1615 transitions. [2021-11-16 21:47:28,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-16 21:47:28,662 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, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 291 [2021-11-16 21:47:28,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:28,667 INFO L225 Difference]: With dead ends: 1051 [2021-11-16 21:47:28,667 INFO L226 Difference]: Without dead ends: 557 [2021-11-16 21:47:28,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 576 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:28,670 INFO L933 BasicCegarLoop]: 616 mSDtfsCounter, 7 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1839 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:28,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 1839 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:28,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2021-11-16 21:47:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 553. [2021-11-16 21:47:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 344 states have (on average 1.2180232558139534) internal successors, (419), 349 states have internal predecessors, (419), 169 states have call successors, (169), 33 states have call predecessors, (169), 38 states have return successors, (231), 171 states have call predecessors, (231), 167 states have call successors, (231) [2021-11-16 21:47:28,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 819 transitions. [2021-11-16 21:47:28,695 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 819 transitions. Word has length 291 [2021-11-16 21:47:28,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:28,695 INFO L470 AbstractCegarLoop]: Abstraction has 553 states and 819 transitions. [2021-11-16 21:47:28,695 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, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2021-11-16 21:47:28,695 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 819 transitions. [2021-11-16 21:47:28,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2021-11-16 21:47:28,698 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:28,699 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-11-16 21:47:28,911 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:28,912 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:28,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:28,912 INFO L85 PathProgramCache]: Analyzing trace with hash -545033999, now seen corresponding path program 1 times [2021-11-16 21:47:28,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:47:28,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911014721] [2021-11-16 21:47:28,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:28,914 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:47:28,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:47:28,915 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:28,915 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:47:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:47:29,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 1863 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-16 21:47:29,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:47:30,898 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2021-11-16 21:47:30,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:47:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2021-11-16 21:47:31,811 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-16 21:47:31,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911014721] [2021-11-16 21:47:31,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911014721] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 21:47:31,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:47:31,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 11 [2021-11-16 21:47:31,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889507834] [2021-11-16 21:47:31,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:47:31,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 21:47:31,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-16 21:47:31,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 21:47:31,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-16 21:47:31,813 INFO L87 Difference]: Start difference. First operand 553 states and 819 transitions. Second operand has 10 states, 9 states have (on average 13.777777777777779) internal successors, (124), 8 states have internal predecessors, (124), 3 states have call successors, (32), 2 states have call predecessors, (32), 5 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) [2021-11-16 21:47:33,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:47:33,090 INFO L93 Difference]: Finished difference Result 1059 states and 1616 transitions. [2021-11-16 21:47:33,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 21:47:33,091 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.777777777777779) internal successors, (124), 8 states have internal predecessors, (124), 3 states have call successors, (32), 2 states have call predecessors, (32), 5 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) Word has length 291 [2021-11-16 21:47:33,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:47:33,093 INFO L225 Difference]: With dead ends: 1059 [2021-11-16 21:47:33,093 INFO L226 Difference]: Without dead ends: 567 [2021-11-16 21:47:33,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 571 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:33,096 INFO L933 BasicCegarLoop]: 601 mSDtfsCounter, 4 mSDsluCounter, 4711 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5312 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:47:33,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 5312 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-16 21:47:33,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-11-16 21:47:33,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 560. [2021-11-16 21:47:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 349 states have (on average 1.2148997134670487) internal successors, (424), 355 states have internal predecessors, (424), 169 states have call successors, (169), 33 states have call predecessors, (169), 40 states have return successors, (250), 172 states have call predecessors, (250), 167 states have call successors, (250) [2021-11-16 21:47:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 843 transitions. [2021-11-16 21:47:33,117 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 843 transitions. Word has length 291 [2021-11-16 21:47:33,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:47:33,118 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 843 transitions. [2021-11-16 21:47:33,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.777777777777779) internal successors, (124), 8 states have internal predecessors, (124), 3 states have call successors, (32), 2 states have call predecessors, (32), 5 states have return successors, (30), 4 states have call predecessors, (30), 3 states have call successors, (30) [2021-11-16 21:47:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 843 transitions. [2021-11-16 21:47:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2021-11-16 21:47:33,120 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:47:33,120 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-11-16 21:47:33,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-16 21:47:33,334 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [my_abortErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:47:33,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:47:33,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1636995336, now seen corresponding path program 1 times [2021-11-16 21:47:33,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-16 21:47:33,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544667292] [2021-11-16 21:47:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:47:33,336 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-16 21:47:33,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-16 21:47:33,337 INFO L229 MonitoredProcess]: Starting monitored process 22 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,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-11-16 21:48:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:48:19,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 1848 conjuncts, 104 conjunts are in the unsatisfiable core [2021-11-16 21:48:19,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:48:19,219 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:19,775 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:19,782 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:27,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:48:27,396 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:27,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:48:27,429 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:27,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:48:27,768 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:27,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:48:27,796 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:28,282 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-16 21:48:28,283 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 40 treesize of output 32 [2021-11-16 21:48:28,292 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-16 21:48:28,293 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 26 treesize of output 18 [2021-11-16 21:49:37,740 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:24,056 INFO L354 Elim1Store]: treesize reduction 561, result has 0.2 percent of original size [2021-11-16 21:51:24,057 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 199 treesize of output 1 [2021-11-16 21:51:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 274 proven. 22 refuted. 0 times theorem prover too weak. 203 trivial. 3 not checked. [2021-11-16 21:51:24,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:51:34,172 WARN L227 SmtUtils]: Spent 5.31s on a formula simplification. DAG size of input: 160 DAG size of output: 150 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-16 21:51:43,076 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_aws_mul_size_checked_~r#1.base_488| (_ BitVec 64)) (|v___CPROVER_overflow_mult_~#c~1.base_664| (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ BitVec 64))) (let ((.cse2 (store |c_#valid| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ bv1 1)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|)))) (and (forall ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ BitVec 64)) (v_DerPreprocessor_8 (_ BitVec 64)) (v_DerPreprocessor_7 (_ BitVec 64)) (v_DerPreprocessor_6 (_ BitVec 64)) (v_DerPreprocessor_5 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ BitVec 64))) (= (_ bv0 64) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (store (store (select |c_#memory_$Pointer$.base| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| v_DerPreprocessor_5) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ bv4 64)) v_DerPreprocessor_6)))) (store .cse0 |v_aws_mul_size_checked_~r#1.base_488| (store (store (select .cse0 |v_aws_mul_size_checked_~r#1.base_488|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| v_DerPreprocessor_7) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ bv4 64)) v_DerPreprocessor_8))) |c_ULTIMATE.start_aws_priority_queue_pop_harness_~#queue~0#1.base|) (bvadd |c_ULTIMATE.start_aws_priority_queue_pop_harness_~#queue~0#1.offset| (_ bv80 64))))) (forall ((v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ BitVec 64)) (v_DerPreprocessor_9 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (= (_ bv0 64) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (store (store (select |c_#memory_$Pointer$.offset| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| v_DerPreprocessor_11) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ bv4 64)) v_DerPreprocessor_12)))) (store .cse1 |v_aws_mul_size_checked_~r#1.base_488| (store (store (select .cse1 |v_aws_mul_size_checked_~r#1.base_488|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| v_DerPreprocessor_9) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ bv4 64)) v_DerPreprocessor_10))) |c_ULTIMATE.start_aws_priority_queue_pop_harness_~#queue~0#1.base|) (bvadd |c_ULTIMATE.start_aws_priority_queue_pop_harness_~#queue~0#1.offset| (_ bv80 64)))))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select (store (store .cse2 |v___CPROVER_overflow_mult_~#c~1.base_664| (_ bv0 1)) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ bv0 1)) |v_aws_mul_size_checked_~r#1.base_488|))))))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select .cse2 |v___CPROVER_overflow_mult_~#c~1.base_664|))))))))) is different from false [2021-11-16 21:51:45,874 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_aws_mul_size_checked_~r#1.base_488| (_ BitVec 64)) (|v___CPROVER_overflow_mult_~#c~1.base_664| (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ BitVec 64))) (let ((.cse2 (store |c_old(#valid)| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ bv1 1)))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|))) (or (exists ((v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ BitVec 64)) (v_DerPreprocessor_9 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (not (= (_ bv0 64) (select (select (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| v_DerPreprocessor_11) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ bv4 64)) v_DerPreprocessor_12)))) (store .cse0 |v_aws_mul_size_checked_~r#1.base_488| (store (store (select .cse0 |v_aws_mul_size_checked_~r#1.base_488|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| v_DerPreprocessor_9) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ bv4 64)) v_DerPreprocessor_10))) |c_aws_priority_queue_is_valid_#in~queue#1.base|) (bvadd |c_aws_priority_queue_is_valid_#in~queue#1.offset| (_ bv80 64)))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ BitVec 64)) (v_DerPreprocessor_8 (_ BitVec 64)) (v_DerPreprocessor_7 (_ BitVec 64)) (v_DerPreprocessor_6 (_ BitVec 64)) (v_DerPreprocessor_5 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ BitVec 64))) (not (= (select (select (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (store (store (select |c_old(#memory_$Pointer$.base)| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| v_DerPreprocessor_5) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ bv4 64)) v_DerPreprocessor_6)))) (store .cse1 |v_aws_mul_size_checked_~r#1.base_488| (store (store (select .cse1 |v_aws_mul_size_checked_~r#1.base_488|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| v_DerPreprocessor_7) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ bv4 64)) v_DerPreprocessor_8))) |c_aws_priority_queue_is_valid_#in~queue#1.base|) (bvadd |c_aws_priority_queue_is_valid_#in~queue#1.offset| (_ bv80 64))) (_ bv0 64))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select .cse2 |v___CPROVER_overflow_mult_~#c~1.base_664|))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select (store (store .cse2 |v___CPROVER_overflow_mult_~#c~1.base_664| (_ bv0 1)) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ bv0 1)) |v_aws_mul_size_checked_~r#1.base_488|))))))))) is different from true [2021-11-16 21:53:50,769 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_mul_size_checked_~r#1.base_488| (_ BitVec 64)) (|v___CPROVER_overflow_mult_~#c~1.base_664| (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ BitVec 64))) (let ((.cse2 (store |c_old(#valid)| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ bv1 1)))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|))) (or (exists ((v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ BitVec 64)) (v_DerPreprocessor_9 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (not (= (_ bv0 64) (select (select (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| v_DerPreprocessor_11) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ bv4 64)) v_DerPreprocessor_12)))) (store .cse0 |v_aws_mul_size_checked_~r#1.base_488| (store (store (select .cse0 |v_aws_mul_size_checked_~r#1.base_488|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| v_DerPreprocessor_9) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ bv4 64)) v_DerPreprocessor_10))) |c_aws_priority_queue_is_valid_#in~queue#1.base|) (bvadd |c_aws_priority_queue_is_valid_#in~queue#1.offset| (_ bv80 64)))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ BitVec 64)) (v_DerPreprocessor_8 (_ BitVec 64)) (v_DerPreprocessor_7 (_ BitVec 64)) (v_DerPreprocessor_6 (_ BitVec 64)) (v_DerPreprocessor_5 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ BitVec 64))) (not (= (select (select (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (store (store (select |c_old(#memory_$Pointer$.base)| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| v_DerPreprocessor_5) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ bv4 64)) v_DerPreprocessor_6)))) (store .cse1 |v_aws_mul_size_checked_~r#1.base_488| (store (store (select .cse1 |v_aws_mul_size_checked_~r#1.base_488|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| v_DerPreprocessor_7) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ bv4 64)) v_DerPreprocessor_8))) |c_aws_priority_queue_is_valid_#in~queue#1.base|) (bvadd |c_aws_priority_queue_is_valid_#in~queue#1.offset| (_ bv80 64))) (_ bv0 64))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select .cse2 |v___CPROVER_overflow_mult_~#c~1.base_664|))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select (store (store .cse2 |v___CPROVER_overflow_mult_~#c~1.base_664| (_ bv0 1)) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ bv0 1)) |v_aws_mul_size_checked_~r#1.base_488|))))))))) (forall ((|v_aws_mul_size_checked_~r#1.base_494| (_ BitVec 64))) (or (and (forall ((v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ BitVec 64))) (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| |v_aws_mul_size_checked_~r#1.base_494| (store (store (select |c_#memory_$Pointer$.base| |v_aws_mul_size_checked_~r#1.base_494|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| v_DerPreprocessor_15) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ bv4 64)) v_DerPreprocessor_16)) |c_aws_priority_queue_is_valid_aws_priority_queue_backpointers_valid_~queue#1.base|) (bvadd |c_aws_priority_queue_is_valid_aws_priority_queue_backpointers_valid_~queue#1.offset| (_ bv80 64))))) (forall ((v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ BitVec 64))) (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.offset| |v_aws_mul_size_checked_~r#1.base_494| (store (store (select |c_#memory_$Pointer$.offset| |v_aws_mul_size_checked_~r#1.base_494|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| v_DerPreprocessor_13) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ bv4 64)) v_DerPreprocessor_14)) |c_aws_priority_queue_is_valid_aws_priority_queue_backpointers_valid_~queue#1.base|) (bvadd |c_aws_priority_queue_is_valid_aws_priority_queue_backpointers_valid_~queue#1.offset| (_ bv80 64)))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_aws_mul_size_checked_~r#1.base_494|))))))) is different from true [2021-11-16 21:53:53,639 WARN L860 $PredicateComparison]: unable to prove that (or (= |c_aws_array_list_is_valid_#res| (_ bv0 8)) (forall ((|v_aws_priority_queue_is_valid_#in~queue#1.offset_BEFORE_CALL_9| (_ BitVec 64)) (|v_old(#memory_$Pointer$.base)_BEFORE_CALL_9| (Array (_ BitVec 64) (Array (_ BitVec 64) (_ BitVec 64)))) (|v_old(#valid)_BEFORE_CALL_10| (Array (_ BitVec 64) (_ BitVec 1))) (|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_9| (Array (_ BitVec 64) (Array (_ BitVec 64) (_ BitVec 64)))) (|v_aws_priority_queue_is_valid_#in~queue#1.base_BEFORE_CALL_23| (_ BitVec 64))) (exists ((|v_aws_mul_size_checked_~r#1.base_488| (_ BitVec 64)) (|v___CPROVER_overflow_mult_~#c~1.base_664| (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ BitVec 64))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_10| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ bv1 1)))) (and (or (exists ((v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ BitVec 64)) (v_DerPreprocessor_9 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (not (= (_ bv0 64) (select (select (let ((.cse0 (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_9| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_9| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| v_DerPreprocessor_11) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ bv4 64)) v_DerPreprocessor_12)))) (store .cse0 |v_aws_mul_size_checked_~r#1.base_488| (store (store (select .cse0 |v_aws_mul_size_checked_~r#1.base_488|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| v_DerPreprocessor_9) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ bv4 64)) v_DerPreprocessor_10))) |v_aws_priority_queue_is_valid_#in~queue#1.base_BEFORE_CALL_23|) (bvadd (_ bv80 64) |v_aws_priority_queue_is_valid_#in~queue#1.offset_BEFORE_CALL_9|))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ BitVec 64)) (v_DerPreprocessor_8 (_ BitVec 64)) (v_DerPreprocessor_7 (_ BitVec 64)) (v_DerPreprocessor_6 (_ BitVec 64)) (v_DerPreprocessor_5 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ BitVec 64))) (not (= (select (select (let ((.cse1 (store |v_old(#memory_$Pointer$.base)_BEFORE_CALL_9| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (store (store (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_9| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| v_DerPreprocessor_5) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ bv4 64)) v_DerPreprocessor_6)))) (store .cse1 |v_aws_mul_size_checked_~r#1.base_488| (store (store (select .cse1 |v_aws_mul_size_checked_~r#1.base_488|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| v_DerPreprocessor_7) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ bv4 64)) v_DerPreprocessor_8))) |v_aws_priority_queue_is_valid_#in~queue#1.base_BEFORE_CALL_23|) (bvadd (_ bv80 64) |v_aws_priority_queue_is_valid_#in~queue#1.offset_BEFORE_CALL_9|)) (_ bv0 64))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select .cse2 |v___CPROVER_overflow_mult_~#c~1.base_664|)))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select (store (store .cse2 |v___CPROVER_overflow_mult_~#c~1.base_664| (_ bv0 1)) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ bv0 1)) |v_aws_mul_size_checked_~r#1.base_488|)))))) (= (_ bv0 1) (bvneg (bvneg (select |v_old(#valid)_BEFORE_CALL_10| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|)))))))) (exists ((|v_aws_mul_size_checked_~r#1.base_494| (_ BitVec 64))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_aws_mul_size_checked_~r#1.base_494|))))) (or (exists ((v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ BitVec 64))) (not (= (_ bv0 64) (select (select (store |c_old(#memory_$Pointer$.base)| |v_aws_mul_size_checked_~r#1.base_494| (store (store (select |c_old(#memory_$Pointer$.base)| |v_aws_mul_size_checked_~r#1.base_494|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| v_DerPreprocessor_15) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ bv4 64)) v_DerPreprocessor_16)) |c_aws_array_list_is_valid_#in~list.base|) (bvadd |c_aws_array_list_is_valid_#in~list.offset| (_ bv32 64)))))) (exists ((v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ BitVec 64))) (not (= (_ bv0 64) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_aws_mul_size_checked_~r#1.base_494| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_aws_mul_size_checked_~r#1.base_494|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| v_DerPreprocessor_13) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ bv4 64)) v_DerPreprocessor_14)) |c_aws_array_list_is_valid_#in~list.base|) (bvadd |c_aws_array_list_is_valid_#in~list.offset| (_ bv32 64)))))))))) is different from true [2021-11-16 21:53:57,370 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_aws_priority_queue_is_valid_#in~queue#1.offset_BEFORE_CALL_9| (_ BitVec 64)) (|v_old(#memory_$Pointer$.base)_BEFORE_CALL_9| (Array (_ BitVec 64) (Array (_ BitVec 64) (_ BitVec 64)))) (|v_old(#valid)_BEFORE_CALL_10| (Array (_ BitVec 64) (_ BitVec 1))) (|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_9| (Array (_ BitVec 64) (Array (_ BitVec 64) (_ BitVec 64)))) (|v_aws_priority_queue_is_valid_#in~queue#1.base_BEFORE_CALL_23| (_ BitVec 64))) (exists ((|v_aws_mul_size_checked_~r#1.base_488| (_ BitVec 64)) (|v___CPROVER_overflow_mult_~#c~1.base_664| (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ BitVec 64))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_10| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ bv1 1)))) (and (or (exists ((v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ BitVec 64)) (v_DerPreprocessor_9 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (not (= (_ bv0 64) (select (select (let ((.cse0 (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_9| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_9| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| v_DerPreprocessor_11) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ bv4 64)) v_DerPreprocessor_12)))) (store .cse0 |v_aws_mul_size_checked_~r#1.base_488| (store (store (select .cse0 |v_aws_mul_size_checked_~r#1.base_488|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| v_DerPreprocessor_9) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ bv4 64)) v_DerPreprocessor_10))) |v_aws_priority_queue_is_valid_#in~queue#1.base_BEFORE_CALL_23|) (bvadd (_ bv80 64) |v_aws_priority_queue_is_valid_#in~queue#1.offset_BEFORE_CALL_9|))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ BitVec 64)) (v_DerPreprocessor_8 (_ BitVec 64)) (v_DerPreprocessor_7 (_ BitVec 64)) (v_DerPreprocessor_6 (_ BitVec 64)) (v_DerPreprocessor_5 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ BitVec 64))) (not (= (select (select (let ((.cse1 (store |v_old(#memory_$Pointer$.base)_BEFORE_CALL_9| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (store (store (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_9| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| v_DerPreprocessor_5) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ bv4 64)) v_DerPreprocessor_6)))) (store .cse1 |v_aws_mul_size_checked_~r#1.base_488| (store (store (select .cse1 |v_aws_mul_size_checked_~r#1.base_488|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| v_DerPreprocessor_7) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ bv4 64)) v_DerPreprocessor_8))) |v_aws_priority_queue_is_valid_#in~queue#1.base_BEFORE_CALL_23|) (bvadd (_ bv80 64) |v_aws_priority_queue_is_valid_#in~queue#1.offset_BEFORE_CALL_9|)) (_ bv0 64))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select .cse2 |v___CPROVER_overflow_mult_~#c~1.base_664|)))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select (store (store .cse2 |v___CPROVER_overflow_mult_~#c~1.base_664| (_ bv0 1)) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ bv0 1)) |v_aws_mul_size_checked_~r#1.base_488|)))))) (= (_ bv0 1) (bvneg (bvneg (select |v_old(#valid)_BEFORE_CALL_10| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|)))))))) (not |c_aws_array_list_is_valid_#t~short92|) (exists ((|v_aws_mul_size_checked_~r#1.base_494| (_ BitVec 64))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_aws_mul_size_checked_~r#1.base_494|))))) (or (exists ((v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ BitVec 64))) (not (= (_ bv0 64) (select (select (store |c_old(#memory_$Pointer$.base)| |v_aws_mul_size_checked_~r#1.base_494| (store (store (select |c_old(#memory_$Pointer$.base)| |v_aws_mul_size_checked_~r#1.base_494|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| v_DerPreprocessor_15) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ bv4 64)) v_DerPreprocessor_16)) |c_aws_array_list_is_valid_#in~list.base|) (bvadd |c_aws_array_list_is_valid_#in~list.offset| (_ bv32 64)))))) (exists ((v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ BitVec 64))) (not (= (_ bv0 64) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_aws_mul_size_checked_~r#1.base_494| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_aws_mul_size_checked_~r#1.base_494|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| v_DerPreprocessor_13) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ bv4 64)) v_DerPreprocessor_14)) |c_aws_array_list_is_valid_#in~list.base|) (bvadd |c_aws_array_list_is_valid_#in~list.offset| (_ bv32 64)))))))))) is different from true [2021-11-16 21:54:00,393 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_aws_priority_queue_is_valid_#in~queue#1.offset_BEFORE_CALL_9| (_ BitVec 64)) (|v_old(#memory_$Pointer$.base)_BEFORE_CALL_9| (Array (_ BitVec 64) (Array (_ BitVec 64) (_ BitVec 64)))) (|v_old(#valid)_BEFORE_CALL_10| (Array (_ BitVec 64) (_ BitVec 1))) (|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_9| (Array (_ BitVec 64) (Array (_ BitVec 64) (_ BitVec 64)))) (|v_aws_priority_queue_is_valid_#in~queue#1.base_BEFORE_CALL_23| (_ BitVec 64))) (exists ((|v_aws_mul_size_checked_~r#1.base_488| (_ BitVec 64)) (|v___CPROVER_overflow_mult_~#c~1.base_664| (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ BitVec 64))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_10| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ bv1 1)))) (and (or (exists ((v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ BitVec 64)) (v_DerPreprocessor_9 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (not (= (_ bv0 64) (select (select (let ((.cse0 (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_9| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_9| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| v_DerPreprocessor_11) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ bv4 64)) v_DerPreprocessor_12)))) (store .cse0 |v_aws_mul_size_checked_~r#1.base_488| (store (store (select .cse0 |v_aws_mul_size_checked_~r#1.base_488|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| v_DerPreprocessor_9) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ bv4 64)) v_DerPreprocessor_10))) |v_aws_priority_queue_is_valid_#in~queue#1.base_BEFORE_CALL_23|) (bvadd (_ bv80 64) |v_aws_priority_queue_is_valid_#in~queue#1.offset_BEFORE_CALL_9|))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ BitVec 64)) (v_DerPreprocessor_8 (_ BitVec 64)) (v_DerPreprocessor_7 (_ BitVec 64)) (v_DerPreprocessor_6 (_ BitVec 64)) (v_DerPreprocessor_5 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ BitVec 64))) (not (= (select (select (let ((.cse1 (store |v_old(#memory_$Pointer$.base)_BEFORE_CALL_9| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (store (store (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_9| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| v_DerPreprocessor_5) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ bv4 64)) v_DerPreprocessor_6)))) (store .cse1 |v_aws_mul_size_checked_~r#1.base_488| (store (store (select .cse1 |v_aws_mul_size_checked_~r#1.base_488|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| v_DerPreprocessor_7) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ bv4 64)) v_DerPreprocessor_8))) |v_aws_priority_queue_is_valid_#in~queue#1.base_BEFORE_CALL_23|) (bvadd (_ bv80 64) |v_aws_priority_queue_is_valid_#in~queue#1.offset_BEFORE_CALL_9|)) (_ bv0 64))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select .cse2 |v___CPROVER_overflow_mult_~#c~1.base_664|)))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select (store (store .cse2 |v___CPROVER_overflow_mult_~#c~1.base_664| (_ bv0 1)) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ bv0 1)) |v_aws_mul_size_checked_~r#1.base_488|)))))) (= (_ bv0 1) (bvneg (bvneg (select |v_old(#valid)_BEFORE_CALL_10| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|)))))))) (exists ((|v_aws_mul_size_checked_~r#1.base_494| (_ BitVec 64))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_aws_mul_size_checked_~r#1.base_494|))))) (or (exists ((v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ BitVec 64))) (not (= (_ bv0 64) (select (select (store |c_old(#memory_$Pointer$.base)| |v_aws_mul_size_checked_~r#1.base_494| (store (store (select |c_old(#memory_$Pointer$.base)| |v_aws_mul_size_checked_~r#1.base_494|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| v_DerPreprocessor_15) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ bv4 64)) v_DerPreprocessor_16)) |c_aws_array_list_is_valid_#in~list.base|) (bvadd |c_aws_array_list_is_valid_#in~list.offset| (_ bv32 64)))))) (exists ((v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ BitVec 64))) (not (= (_ bv0 64) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_aws_mul_size_checked_~r#1.base_494| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_aws_mul_size_checked_~r#1.base_494|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| v_DerPreprocessor_13) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ bv4 64)) v_DerPreprocessor_14)) |c_aws_array_list_is_valid_#in~list.base|) (bvadd |c_aws_array_list_is_valid_#in~list.offset| (_ bv32 64))))))))) (not |c_aws_array_list_is_valid_#t~short91|)) is different from true [2021-11-16 21:54:03,361 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_aws_priority_queue_is_valid_#in~queue#1.offset_BEFORE_CALL_9| (_ BitVec 64)) (|v_old(#memory_$Pointer$.base)_BEFORE_CALL_9| (Array (_ BitVec 64) (Array (_ BitVec 64) (_ BitVec 64)))) (|v_old(#valid)_BEFORE_CALL_10| (Array (_ BitVec 64) (_ BitVec 1))) (|v_old(#memory_$Pointer$.offset)_BEFORE_CALL_9| (Array (_ BitVec 64) (Array (_ BitVec 64) (_ BitVec 64)))) (|v_aws_priority_queue_is_valid_#in~queue#1.base_BEFORE_CALL_23| (_ BitVec 64))) (exists ((|v_aws_mul_size_checked_~r#1.base_488| (_ BitVec 64)) (|v___CPROVER_overflow_mult_~#c~1.base_664| (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ BitVec 64))) (let ((.cse2 (store |v_old(#valid)_BEFORE_CALL_10| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ bv1 1)))) (and (or (exists ((v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ BitVec 64)) (v_DerPreprocessor_9 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (not (= (_ bv0 64) (select (select (let ((.cse0 (store |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_9| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (store (store (select |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_9| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| v_DerPreprocessor_11) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ bv4 64)) v_DerPreprocessor_12)))) (store .cse0 |v_aws_mul_size_checked_~r#1.base_488| (store (store (select .cse0 |v_aws_mul_size_checked_~r#1.base_488|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| v_DerPreprocessor_9) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ bv4 64)) v_DerPreprocessor_10))) |v_aws_priority_queue_is_valid_#in~queue#1.base_BEFORE_CALL_23|) (bvadd (_ bv80 64) |v_aws_priority_queue_is_valid_#in~queue#1.offset_BEFORE_CALL_9|))))) (exists ((|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ BitVec 64)) (v_DerPreprocessor_8 (_ BitVec 64)) (v_DerPreprocessor_7 (_ BitVec 64)) (v_DerPreprocessor_6 (_ BitVec 64)) (v_DerPreprocessor_5 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ BitVec 64))) (not (= (select (select (let ((.cse1 (store |v_old(#memory_$Pointer$.base)_BEFORE_CALL_9| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (store (store (select |v_old(#memory_$Pointer$.base)_BEFORE_CALL_9| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| v_DerPreprocessor_5) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_495| (_ bv4 64)) v_DerPreprocessor_6)))) (store .cse1 |v_aws_mul_size_checked_~r#1.base_488| (store (store (select .cse1 |v_aws_mul_size_checked_~r#1.base_488|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| v_DerPreprocessor_7) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_496| (_ bv4 64)) v_DerPreprocessor_8))) |v_aws_priority_queue_is_valid_#in~queue#1.base_BEFORE_CALL_23|) (bvadd (_ bv80 64) |v_aws_priority_queue_is_valid_#in~queue#1.offset_BEFORE_CALL_9|)) (_ bv0 64))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select .cse2 |v___CPROVER_overflow_mult_~#c~1.base_664|)))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select (store (store .cse2 |v___CPROVER_overflow_mult_~#c~1.base_664| (_ bv0 1)) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490| (_ bv0 1)) |v_aws_mul_size_checked_~r#1.base_488|)))))) (= (_ bv0 1) (bvneg (bvneg (select |v_old(#valid)_BEFORE_CALL_10| |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.base_490|)))))))) (let ((.cse3 (bvadd (_ bv32 64) c_aws_array_list_is_valid_~list.offset))) (and (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| c_aws_array_list_is_valid_~list.base) .cse3)) (= (select (select |c_#memory_$Pointer$.offset| c_aws_array_list_is_valid_~list.base) .cse3) (_ bv0 64)))) (exists ((|v_aws_mul_size_checked_~r#1.base_494| (_ BitVec 64))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_aws_mul_size_checked_~r#1.base_494|))))) (or (exists ((v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ BitVec 64))) (not (= (_ bv0 64) (select (select (store |c_old(#memory_$Pointer$.base)| |v_aws_mul_size_checked_~r#1.base_494| (store (store (select |c_old(#memory_$Pointer$.base)| |v_aws_mul_size_checked_~r#1.base_494|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| v_DerPreprocessor_15) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ bv4 64)) v_DerPreprocessor_16)) |c_aws_array_list_is_valid_#in~list.base|) (bvadd |c_aws_array_list_is_valid_#in~list.offset| (_ bv32 64)))))) (exists ((v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (|v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ BitVec 64))) (not (= (_ bv0 64) (select (select (store |c_old(#memory_$Pointer$.offset)| |v_aws_mul_size_checked_~r#1.base_494| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_aws_mul_size_checked_~r#1.base_494|) |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| v_DerPreprocessor_13) (bvadd |v_aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset_502| (_ bv4 64)) v_DerPreprocessor_14)) |c_aws_array_list_is_valid_#in~list.base|) (bvadd |c_aws_array_list_is_valid_#in~list.offset| (_ bv32 64)))))))))) is different from true Killed by 15