./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_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 e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 17:04:37,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 17:04:37,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 17:04:37,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 17:04:37,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 17:04:37,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 17:04:37,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 17:04:37,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 17:04:37,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 17:04:37,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 17:04:37,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 17:04:37,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 17:04:37,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 17:04:37,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 17:04:37,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 17:04:37,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 17:04:37,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 17:04:37,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 17:04:37,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 17:04:37,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 17:04:37,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 17:04:37,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 17:04:37,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 17:04:37,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 17:04:37,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 17:04:37,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 17:04:37,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 17:04:37,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 17:04:37,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 17:04:37,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 17:04:37,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 17:04:37,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 17:04:37,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 17:04:37,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 17:04:37,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 17:04:37,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 17:04:37,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 17:04:37,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 17:04:37,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 17:04:37,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 17:04:37,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 17:04:37,606 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-14 17:04:37,631 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 17:04:37,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 17:04:37,631 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 17:04:37,631 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 17:04:37,632 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 17:04:37,632 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 17:04:37,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 17:04:37,633 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 17:04:37,633 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 17:04:37,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 17:04:37,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 17:04:37,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 17:04:37,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 17:04:37,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 17:04:37,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 17:04:37,634 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 17:04:37,635 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 17:04:37,635 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 17:04:37,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 17:04:37,635 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 17:04:37,635 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 17:04:37,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 17:04:37,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 17:04:37,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 17:04:37,636 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 17:04:37,636 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 17:04:37,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 17:04:37,636 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 17:04:37,636 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 17:04:37,636 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 17:04:37,637 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 17:04:37,637 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 -> e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 [2021-12-14 17:04:37,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 17:04:37,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 17:04:37,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 17:04:37,852 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 17:04:37,854 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 17:04:37,859 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2021-12-14 17:04:37,920 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2d2d3c82/eb6a645dbbfe4409a83a5bed8afd8641/FLAG241fb13fd [2021-12-14 17:04:38,541 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 17:04:38,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2021-12-14 17:04:38,572 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2d2d3c82/eb6a645dbbfe4409a83a5bed8afd8641/FLAG241fb13fd [2021-12-14 17:04:38,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2d2d3c82/eb6a645dbbfe4409a83a5bed8afd8641 [2021-12-14 17:04:38,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 17:04:38,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 17:04:38,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 17:04:38,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 17:04:38,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 17:04:38,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:04:38" (1/1) ... [2021-12-14 17:04:38,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc0d05c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:38, skipping insertion in model container [2021-12-14 17:04:38,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:04:38" (1/1) ... [2021-12-14 17:04:38,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 17:04:39,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 17:04:39,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-14 17:04:39,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-14 17:04:39,859 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:39,860 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:39,860 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:39,861 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:39,861 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:39,868 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:39,869 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:39,870 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:39,870 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,123 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-14 17:04:40,124 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-14 17:04:40,124 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-14 17:04:40,125 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-14 17:04:40,126 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-14 17:04:40,126 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-14 17:04:40,127 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-14 17:04:40,127 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-14 17:04:40,127 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-14 17:04:40,128 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-14 17:04:40,232 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-14 17:04:40,328 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,328 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,520 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,521 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,538 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,538 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,544 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,545 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,557 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,558 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,558 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,559 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,559 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,560 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,560 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,596 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 17:04:40,630 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 17:04:40,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-14 17:04:40,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-14 17:04:40,685 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,686 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,688 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,688 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,688 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,691 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,691 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,692 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,692 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,716 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-14 17:04:40,716 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-14 17:04:40,717 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-14 17:04:40,717 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-14 17:04:40,718 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-14 17:04:40,718 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-14 17:04:40,718 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-14 17:04:40,719 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-14 17:04:40,719 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-14 17:04:40,719 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-14 17:04:40,731 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-14 17:04:40,760 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,762 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,812 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,813 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,818 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,818 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,821 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,821 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,826 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,826 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,826 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,827 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,827 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,827 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,827 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:40,852 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 17:04:41,097 INFO L208 MainTranslator]: Completed translation [2021-12-14 17:04:41,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:41 WrapperNode [2021-12-14 17:04:41,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 17:04:41,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 17:04:41,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 17:04:41,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 17:04:41,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:41" (1/1) ... [2021-12-14 17:04:41,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:41" (1/1) ... [2021-12-14 17:04:41,260 INFO L137 Inliner]: procedures = 768, calls = 3253, calls flagged for inlining = 78, calls inlined = 5, statements flattened = 337 [2021-12-14 17:04:41,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 17:04:41,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 17:04:41,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 17:04:41,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 17:04:41,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:41" (1/1) ... [2021-12-14 17:04:41,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:41" (1/1) ... [2021-12-14 17:04:41,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:41" (1/1) ... [2021-12-14 17:04:41,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:41" (1/1) ... [2021-12-14 17:04:41,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:41" (1/1) ... [2021-12-14 17:04:41,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:41" (1/1) ... [2021-12-14 17:04:41,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:41" (1/1) ... [2021-12-14 17:04:41,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 17:04:41,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 17:04:41,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 17:04:41,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 17:04:41,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:41" (1/1) ... [2021-12-14 17:04:41,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 17:04:41,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:04:41,353 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-12-14 17:04:41,369 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-12-14 17:04:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-14 17:04:41,395 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-14 17:04:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 17:04:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-14 17:04:41,395 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-14 17:04:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 17:04:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 17:04:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 17:04:41,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 17:04:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-14 17:04:41,396 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-14 17:04:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-14 17:04:41,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-14 17:04:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 17:04:41,397 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-14 17:04:41,397 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-14 17:04:41,397 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2021-12-14 17:04:41,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2021-12-14 17:04:41,397 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2021-12-14 17:04:41,397 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2021-12-14 17:04:41,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 17:04:41,603 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 17:04:41,604 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 17:04:41,795 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2021-12-14 17:04:41,803 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 17:04:41,807 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 17:04:41,808 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 17:04:41,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:04:41 BoogieIcfgContainer [2021-12-14 17:04:41,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 17:04:41,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 17:04:41,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 17:04:41,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 17:04:41,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 05:04:38" (1/3) ... [2021-12-14 17:04:41,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae188ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:04:41, skipping insertion in model container [2021-12-14 17:04:41,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:41" (2/3) ... [2021-12-14 17:04:41,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae188ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:04:41, skipping insertion in model container [2021-12-14 17:04:41,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:04:41" (3/3) ... [2021-12-14 17:04:41,816 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2021-12-14 17:04:41,820 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 17:04:41,821 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 17:04:41,869 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 17:04:41,880 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-12-14 17:04:41,881 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 17:04:41,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-14 17:04:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-14 17:04:41,904 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:04:41,905 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2021-12-14 17:04:41,908 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:04:41,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:04:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1163022186, now seen corresponding path program 1 times [2021-12-14 17:04:41,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:04:41,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634647362] [2021-12-14 17:04:41,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:04:41,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:04:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:04:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:04:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:04:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 17:04:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:04:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 17:04:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-14 17:04:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-14 17:04:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 17:04:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 17:04:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 17:04:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-14 17:04:42,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:04:42,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634647362] [2021-12-14 17:04:42,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634647362] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:04:42,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:04:42,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 17:04:42,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945559357] [2021-12-14 17:04:42,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:04:42,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 17:04:42,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:04:42,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 17:04:42,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 17:04:42,437 INFO L87 Difference]: Start difference. First operand has 71 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-14 17:04:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:04:42,519 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2021-12-14 17:04:42,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 17:04:42,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 67 [2021-12-14 17:04:42,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:04:42,527 INFO L225 Difference]: With dead ends: 139 [2021-12-14 17:04:42,527 INFO L226 Difference]: Without dead ends: 65 [2021-12-14 17:04:42,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 17:04:42,531 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 17 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 17:04:42,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 113 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 17:04:42,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-14 17:04:42,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-14 17:04:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-14 17:04:42,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2021-12-14 17:04:42,559 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2021-12-14 17:04:42,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:04:42,560 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2021-12-14 17:04:42,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-14 17:04:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2021-12-14 17:04:42,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 17:04:42,562 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:04:42,562 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:04:42,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 17:04:42,562 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:04:42,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:04:42,563 INFO L85 PathProgramCache]: Analyzing trace with hash -447828983, now seen corresponding path program 1 times [2021-12-14 17:04:42,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:04:42,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346619687] [2021-12-14 17:04:42,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:04:42,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:04:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:04:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:04:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:04:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 17:04:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:04:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 17:04:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-14 17:04:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-14 17:04:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:42,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 17:04:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:43,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 17:04:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:43,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 17:04:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:43,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 17:04:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-14 17:04:43,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:04:43,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346619687] [2021-12-14 17:04:43,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346619687] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:04:43,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:04:43,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-14 17:04:43,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436627265] [2021-12-14 17:04:43,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:04:43,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 17:04:43,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:04:43,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 17:04:43,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-12-14 17:04:43,102 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-14 17:04:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:04:43,414 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2021-12-14 17:04:43,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 17:04:43,415 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) Word has length 70 [2021-12-14 17:04:43,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:04:43,416 INFO L225 Difference]: With dead ends: 89 [2021-12-14 17:04:43,416 INFO L226 Difference]: Without dead ends: 65 [2021-12-14 17:04:43,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-12-14 17:04:43,418 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 46 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:04:43,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 497 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 17:04:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-14 17:04:43,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-14 17:04:43,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 39 states have internal predecessors, (40), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-14 17:04:43,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2021-12-14 17:04:43,428 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 70 [2021-12-14 17:04:43,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:04:43,429 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2021-12-14 17:04:43,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-14 17:04:43,429 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2021-12-14 17:04:43,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-14 17:04:43,431 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:04:43,432 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:04:43,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 17:04:43,432 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:04:43,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:04:43,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1505925942, now seen corresponding path program 1 times [2021-12-14 17:04:43,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:04:43,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486181284] [2021-12-14 17:04:43,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:04:43,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:04:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:43,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:04:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:43,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:04:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:43,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:04:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:43,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 17:04:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:43,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:04:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:43,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 17:04:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:43,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-14 17:04:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:43,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-14 17:04:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:43,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 17:04:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:43,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 17:04:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:43,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 17:04:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:43,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 17:04:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:43,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 17:04:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-14 17:04:43,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:04:43,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486181284] [2021-12-14 17:04:43,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486181284] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:04:43,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:04:43,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-14 17:04:43,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712550890] [2021-12-14 17:04:43,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:04:43,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 17:04:43,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:04:43,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 17:04:43,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2021-12-14 17:04:43,830 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2021-12-14 17:04:44,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:04:44,250 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2021-12-14 17:04:44,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 17:04:44,251 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2021-12-14 17:04:44,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:04:44,252 INFO L225 Difference]: With dead ends: 94 [2021-12-14 17:04:44,252 INFO L226 Difference]: Without dead ends: 92 [2021-12-14 17:04:44,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2021-12-14 17:04:44,253 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 58 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 17:04:44,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 721 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 17:04:44,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-14 17:04:44,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2021-12-14 17:04:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-14 17:04:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2021-12-14 17:04:44,262 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 75 [2021-12-14 17:04:44,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:04:44,262 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2021-12-14 17:04:44,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2021-12-14 17:04:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2021-12-14 17:04:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-14 17:04:44,264 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:04:44,264 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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] [2021-12-14 17:04:44,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 17:04:44,265 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:04:44,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:04:44,265 INFO L85 PathProgramCache]: Analyzing trace with hash -892933696, now seen corresponding path program 1 times [2021-12-14 17:04:44,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:04:44,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006561575] [2021-12-14 17:04:44,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:04:44,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:04:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:44,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:04:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:44,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:04:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:44,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:04:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:44,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 17:04:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:44,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:04:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:44,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 17:04:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:44,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-14 17:04:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:44,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-14 17:04:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:44,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 17:04:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:44,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 17:04:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:44,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 17:04:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:44,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 17:04:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:44,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 17:04:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:44,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 17:04:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:44,671 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-14 17:04:44,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:04:44,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006561575] [2021-12-14 17:04:44,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006561575] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:04:44,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:04:44,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-14 17:04:44,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832897819] [2021-12-14 17:04:44,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:04:44,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 17:04:44,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:04:44,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 17:04:44,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-14 17:04:44,675 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-14 17:04:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:04:45,026 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2021-12-14 17:04:45,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 17:04:45,030 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) Word has length 83 [2021-12-14 17:04:45,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:04:45,032 INFO L225 Difference]: With dead ends: 98 [2021-12-14 17:04:45,032 INFO L226 Difference]: Without dead ends: 96 [2021-12-14 17:04:45,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-12-14 17:04:45,033 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 59 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:04:45,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 631 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 17:04:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-14 17:04:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2021-12-14 17:04:45,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 55 states have internal predecessors, (55), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-14 17:04:45,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2021-12-14 17:04:45,044 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 83 [2021-12-14 17:04:45,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:04:45,044 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2021-12-14 17:04:45,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-14 17:04:45,045 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2021-12-14 17:04:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-14 17:04:45,046 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:04:45,046 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 4, 4, 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] [2021-12-14 17:04:45,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 17:04:45,047 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:04:45,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:04:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash 829878033, now seen corresponding path program 1 times [2021-12-14 17:04:45,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:04:45,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972970348] [2021-12-14 17:04:45,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:04:45,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:04:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:04:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:04:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:04:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 17:04:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:04:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 17:04:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-14 17:04:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 17:04:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:04:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:04:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 17:04:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:04:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 17:04:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 17:04:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-14 17:04:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-14 17:04:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 17:04:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 17:04:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 17:04:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-12-14 17:04:45,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:04:45,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972970348] [2021-12-14 17:04:45,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972970348] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:04:45,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:04:45,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-14 17:04:45,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325910989] [2021-12-14 17:04:45,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:04:45,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 17:04:45,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:04:45,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 17:04:45,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-12-14 17:04:45,475 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-14 17:04:45,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:04:45,772 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2021-12-14 17:04:45,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 17:04:45,773 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) Word has length 107 [2021-12-14 17:04:45,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:04:45,774 INFO L225 Difference]: With dead ends: 102 [2021-12-14 17:04:45,774 INFO L226 Difference]: Without dead ends: 100 [2021-12-14 17:04:45,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2021-12-14 17:04:45,775 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 31 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:04:45,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 1006 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 17:04:45,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-14 17:04:45,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2021-12-14 17:04:45,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 58 states have internal predecessors, (58), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-14 17:04:45,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2021-12-14 17:04:45,792 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 107 [2021-12-14 17:04:45,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:04:45,792 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2021-12-14 17:04:45,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-14 17:04:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2021-12-14 17:04:45,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-14 17:04:45,795 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:04:45,795 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 4, 4, 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] [2021-12-14 17:04:45,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 17:04:45,796 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:04:45,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:04:45,796 INFO L85 PathProgramCache]: Analyzing trace with hash 265370887, now seen corresponding path program 1 times [2021-12-14 17:04:45,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:04:45,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420591797] [2021-12-14 17:04:45,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:04:45,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:04:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:04:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:04:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:04:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 17:04:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:04:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 17:04:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-14 17:04:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 17:04:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:04:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:04:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 17:04:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:04:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 17:04:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 17:04:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-14 17:04:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-14 17:04:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 17:04:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 17:04:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 17:04:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-14 17:04:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-14 17:04:46,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:04:46,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420591797] [2021-12-14 17:04:46,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420591797] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:04:46,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:04:46,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-14 17:04:46,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107456945] [2021-12-14 17:04:46,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:04:46,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 17:04:46,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:04:46,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 17:04:46,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-12-14 17:04:46,293 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-14 17:04:46,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:04:46,554 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2021-12-14 17:04:46,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 17:04:46,555 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2021-12-14 17:04:46,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:04:46,557 INFO L225 Difference]: With dead ends: 100 [2021-12-14 17:04:46,557 INFO L226 Difference]: Without dead ends: 96 [2021-12-14 17:04:46,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-12-14 17:04:46,558 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 45 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:04:46,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 504 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 17:04:46,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-14 17:04:46,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2021-12-14 17:04:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-14 17:04:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2021-12-14 17:04:46,564 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 115 [2021-12-14 17:04:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:04:46,564 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2021-12-14 17:04:46,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-14 17:04:46,565 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2021-12-14 17:04:46,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-14 17:04:46,566 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:04:46,566 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:04:46,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 17:04:46,566 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:04:46,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:04:46,567 INFO L85 PathProgramCache]: Analyzing trace with hash -565706850, now seen corresponding path program 1 times [2021-12-14 17:04:46,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:04:46,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406462894] [2021-12-14 17:04:46,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:04:46,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:04:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:04:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:04:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:04:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 17:04:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:04:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 17:04:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-14 17:04:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-14 17:04:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 17:04:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-14 17:04:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 17:04:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 17:04:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 17:04:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:46,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 17:04:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:47,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-14 17:04:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:47,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 17:04:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:47,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 17:04:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-12-14 17:04:47,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:04:47,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406462894] [2021-12-14 17:04:47,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406462894] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:04:47,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:04:47,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-14 17:04:47,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390784470] [2021-12-14 17:04:47,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:04:47,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 17:04:47,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:04:47,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 17:04:47,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-12-14 17:04:47,019 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) [2021-12-14 17:04:47,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:04:47,310 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2021-12-14 17:04:47,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 17:04:47,310 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) Word has length 100 [2021-12-14 17:04:47,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:04:47,311 INFO L225 Difference]: With dead ends: 102 [2021-12-14 17:04:47,311 INFO L226 Difference]: Without dead ends: 71 [2021-12-14 17:04:47,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2021-12-14 17:04:47,312 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 55 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:04:47,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 695 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 17:04:47,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-14 17:04:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-14 17:04:47,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0) internal successors, (43), 43 states have internal predecessors, (43), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-14 17:04:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2021-12-14 17:04:47,317 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 100 [2021-12-14 17:04:47,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:04:47,318 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2021-12-14 17:04:47,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) [2021-12-14 17:04:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2021-12-14 17:04:47,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-14 17:04:47,319 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:04:47,319 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 3, 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] [2021-12-14 17:04:47,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 17:04:47,319 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:04:47,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:04:47,320 INFO L85 PathProgramCache]: Analyzing trace with hash -549207241, now seen corresponding path program 1 times [2021-12-14 17:04:47,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:04:47,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292325189] [2021-12-14 17:04:47,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:04:47,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:04:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 17:04:47,444 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 17:04:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 17:04:47,589 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 17:04:47,590 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 17:04:47,590 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 17:04:47,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 17:04:47,593 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:04:47,595 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 17:04:47,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 05:04:47 BoogieIcfgContainer [2021-12-14 17:04:47,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 17:04:47,636 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 17:04:47,637 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 17:04:47,637 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 17:04:47,637 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:04:41" (3/4) ... [2021-12-14 17:04:47,639 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 17:04:47,639 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 17:04:47,639 INFO L158 Benchmark]: Toolchain (without parser) took 8700.43ms. Allocated memory was 92.3MB in the beginning and 270.5MB in the end (delta: 178.3MB). Free memory was 50.4MB in the beginning and 93.0MB in the end (delta: -42.5MB). Peak memory consumption was 139.0MB. Max. memory is 16.1GB. [2021-12-14 17:04:47,639 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 75.5MB. Free memory was 47.8MB in the beginning and 47.8MB in the end (delta: 25.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 17:04:47,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2159.04ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 50.4MB in the beginning and 65.6MB in the end (delta: -15.1MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2021-12-14 17:04:47,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 161.51ms. Allocated memory is still 142.6MB. Free memory was 65.6MB in the beginning and 55.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 17:04:47,640 INFO L158 Benchmark]: Boogie Preprocessor took 69.60ms. Allocated memory is still 142.6MB. Free memory was 55.1MB in the beginning and 81.9MB in the end (delta: -26.8MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2021-12-14 17:04:47,640 INFO L158 Benchmark]: RCFGBuilder took 477.66ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 52.6MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-12-14 17:04:47,640 INFO L158 Benchmark]: TraceAbstraction took 5826.46ms. Allocated memory was 142.6MB in the beginning and 270.5MB in the end (delta: 127.9MB). Free memory was 52.6MB in the beginning and 93.0MB in the end (delta: -40.4MB). Peak memory consumption was 88.2MB. Max. memory is 16.1GB. [2021-12-14 17:04:47,640 INFO L158 Benchmark]: Witness Printer took 2.26ms. Allocated memory is still 270.5MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 17:04:47,641 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.20ms. Allocated memory is still 75.5MB. Free memory was 47.8MB in the beginning and 47.8MB in the end (delta: 25.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2159.04ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 50.4MB in the beginning and 65.6MB in the end (delta: -15.1MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 161.51ms. Allocated memory is still 142.6MB. Free memory was 65.6MB in the beginning and 55.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.60ms. Allocated memory is still 142.6MB. Free memory was 55.1MB in the beginning and 81.9MB in the end (delta: -26.8MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * RCFGBuilder took 477.66ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 52.6MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5826.46ms. Allocated memory was 142.6MB in the beginning and 270.5MB in the end (delta: 127.9MB). Free memory was 52.6MB in the beginning and 93.0MB in the end (delta: -40.4MB). Peak memory consumption was 88.2MB. Max. memory is 16.1GB. * Witness Printer took 2.26ms. Allocated memory is still 270.5MB. Free memory is still 93.0MB. 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: overapproximation of strcmp at line 10798, overapproximation of strlen at line 11324. Possible FailurePath: [L6879-L6884] 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, }; [L7634-L7646] static const uint8_t s_tolower_table[256] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 91, 92, 93, 94, 95, 96, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255}; VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L11328] CALL aws_hash_callback_c_str_eq_harness() [L11318] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=-36893488147419103231, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, size=1] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={-2:0}, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={-2:0}, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}] [L11318] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={-2:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L11318] const char *str1 = ensure_c_str_is_allocated(64); [L11319] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L261] return __VERIFIER_nondet_bool(); [L11319] RET, EXPR nondet_bool() VAL [nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={-2:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={-2:0}] [L11319] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=-18446744073709551615, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, size=1] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={-3:0}, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={-3:0}, cap=1, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}] [L11319] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={-3:0}, nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={-2:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={-3:0}, nondet_bool()=0, nondet_bool() ? str1 : ensure_c_str_is_allocated(64)={-3:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={-2:0}] [L11319] const char *str2 = nondet_bool() ? str1 : ensure_c_str_is_allocated(64); [L11322] CALL, EXPR aws_hash_callback_c_str_eq(str1, str2) [L10794] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}, str={-2:0}] [L10794] RET, EXPR aws_c_string_is_valid(a) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10794] CALL assume_abort_if_not((aws_c_string_is_valid(a))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10794] RET assume_abort_if_not((aws_c_string_is_valid(a))) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}, str={-3:0}] [L10795] RET, EXPR aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] CALL assume_abort_if_not((aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] RET assume_abort_if_not((aws_c_string_is_valid(b))) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10797-L10798] _Bool rval = !strcmp(a, b); [L10799] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}, str={-2:0}] [L10799] RET, EXPR aws_c_string_is_valid(a) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}, str={-3:0}] [L10799] RET, EXPR aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] CALL __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] RET __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] return rval; VAL [\result=1, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L11322] RET, EXPR aws_hash_callback_c_str_eq(str1, str2) [L11321-L11322] _Bool rval = aws_hash_callback_c_str_eq(str1, str2); [L11323] COND TRUE \read(rval) [L11324] size_t len = strlen(str1); [L11325] CALL assert_bytes_match(str1, str2, len) [L7113] CALL __VERIFIER_assert(!a == !b) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7113] RET __VERIFIER_assert(!a == !b) VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=36028797018963966, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7114-L7117] COND TRUE len > 0 && a != ((void *)0) && b != ((void *)0) VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=36028797018963966, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7119] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L7119] RET, EXPR nondet_uint64_t() VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=36028797018963966, nondet_uint64_t()=-18410715276690587651, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7119] size_t i = nondet_uint64_t(); [L7120-L7122] CALL assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7120-L7122] RET assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, i=36028797018963965, len=36028797018963966, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7123] EXPR a[i] [L7123] EXPR b[i] VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, a[i]=-4, b={-3:0}, b={-3:0}, b[i]=0, i=36028797018963965, len=36028797018963966, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7123] CALL __VERIFIER_assert(a[i] == b[i]) VAL [\old(cond)=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 368 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 311 mSDsluCounter, 4167 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3652 mSDsCounter, 259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2413 IncrementalHoareTripleChecker+Invalid, 2672 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 259 mSolverCounterUnsat, 515 mSDtfsCounter, 2413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 1728 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 597/597 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-12-14 17:04:47,666 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_hash_callback_c_str_eq_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 e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 17:04:49,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 17:04:49,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 17:04:49,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 17:04:49,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 17:04:49,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 17:04:49,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 17:04:49,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 17:04:49,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 17:04:49,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 17:04:49,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 17:04:49,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 17:04:49,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 17:04:49,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 17:04:49,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 17:04:49,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 17:04:49,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 17:04:49,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 17:04:49,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 17:04:49,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 17:04:49,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 17:04:49,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 17:04:49,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 17:04:49,392 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 17:04:49,397 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 17:04:49,397 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 17:04:49,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 17:04:49,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 17:04:49,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 17:04:49,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 17:04:49,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 17:04:49,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 17:04:49,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 17:04:49,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 17:04:49,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 17:04:49,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 17:04:49,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 17:04:49,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 17:04:49,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 17:04:49,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 17:04:49,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 17:04:49,412 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-12-14 17:04:49,441 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 17:04:49,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 17:04:49,442 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 17:04:49,442 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 17:04:49,443 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 17:04:49,443 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 17:04:49,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 17:04:49,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 17:04:49,444 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 17:04:49,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 17:04:49,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 17:04:49,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 17:04:49,446 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 17:04:49,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 17:04:49,446 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 17:04:49,446 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-14 17:04:49,446 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-14 17:04:49,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 17:04:49,447 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 17:04:49,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 17:04:49,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 17:04:49,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 17:04:49,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 17:04:49,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 17:04:49,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 17:04:49,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 17:04:49,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 17:04:49,448 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-14 17:04:49,448 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-14 17:04:49,449 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 17:04:49,449 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 17:04:49,449 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 17:04:49,449 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 17:04:49,449 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-14 17:04:49,450 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 -> e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 [2021-12-14 17:04:49,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 17:04:49,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 17:04:49,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 17:04:49,717 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 17:04:49,718 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 17:04:49,719 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2021-12-14 17:04:49,778 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76ceab07e/976ac69ae73c4b539ab9d8a44adcc09c/FLAGa7eba8b78 [2021-12-14 17:04:50,371 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 17:04:50,371 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2021-12-14 17:04:50,404 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76ceab07e/976ac69ae73c4b539ab9d8a44adcc09c/FLAGa7eba8b78 [2021-12-14 17:04:50,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76ceab07e/976ac69ae73c4b539ab9d8a44adcc09c [2021-12-14 17:04:50,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 17:04:50,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 17:04:50,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 17:04:50,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 17:04:50,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 17:04:50,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:04:50" (1/1) ... [2021-12-14 17:04:50,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@757e3019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:50, skipping insertion in model container [2021-12-14 17:04:50,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:04:50" (1/1) ... [2021-12-14 17:04:50,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 17:04:50,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 17:04:50,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-14 17:04:50,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-14 17:04:51,732 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:51,733 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:51,737 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:51,737 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:51,738 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:51,745 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:51,747 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:51,752 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:51,753 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,034 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-14 17:04:52,040 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-14 17:04:52,041 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-14 17:04:52,042 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-14 17:04:52,046 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-14 17:04:52,049 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-14 17:04:52,050 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-14 17:04:52,051 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-14 17:04:52,053 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-14 17:04:52,053 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-14 17:04:52,188 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-14 17:04:52,258 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,258 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,495 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,495 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,523 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,525 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,533 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,534 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,557 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,560 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,560 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,561 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,561 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,562 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,562 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,606 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 17:04:52,652 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-14 17:04:52,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 17:04:52,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-14 17:04:52,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-14 17:04:52,766 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,766 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,767 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,767 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,767 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,772 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,772 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,773 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,773 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,799 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-14 17:04:52,800 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-14 17:04:52,800 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-14 17:04:52,800 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-14 17:04:52,801 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-14 17:04:52,801 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-14 17:04:52,802 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-14 17:04:52,802 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-14 17:04:52,802 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-14 17:04:52,802 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-14 17:04:52,821 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-14 17:04:52,865 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,867 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,916 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,916 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,932 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,933 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,934 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,935 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,940 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,941 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,941 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,942 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,942 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,943 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,943 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:52,971 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 17:04:52,992 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 17:04:53,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-14 17:04:53,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-14 17:04:53,029 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,029 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,029 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,030 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,030 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,033 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,033 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,034 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,034 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,062 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-14 17:04:53,062 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-14 17:04:53,063 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-14 17:04:53,064 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-14 17:04:53,064 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-14 17:04:53,064 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-14 17:04:53,065 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-14 17:04:53,065 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-14 17:04:53,065 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-14 17:04:53,066 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-14 17:04:53,079 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-14 17:04:53,111 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,111 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,166 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,167 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,171 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,171 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,173 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,173 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,180 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,180 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,181 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,181 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,182 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,182 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,182 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:04:53,200 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 17:04:53,417 INFO L208 MainTranslator]: Completed translation [2021-12-14 17:04:53,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:53 WrapperNode [2021-12-14 17:04:53,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 17:04:53,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 17:04:53,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 17:04:53,419 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 17:04:53,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:53" (1/1) ... [2021-12-14 17:04:53,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:53" (1/1) ... [2021-12-14 17:04:53,595 INFO L137 Inliner]: procedures = 788, calls = 3253, calls flagged for inlining = 80, calls inlined = 5, statements flattened = 338 [2021-12-14 17:04:53,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 17:04:53,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 17:04:53,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 17:04:53,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 17:04:53,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:53" (1/1) ... [2021-12-14 17:04:53,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:53" (1/1) ... [2021-12-14 17:04:53,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:53" (1/1) ... [2021-12-14 17:04:53,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:53" (1/1) ... [2021-12-14 17:04:53,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:53" (1/1) ... [2021-12-14 17:04:53,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:53" (1/1) ... [2021-12-14 17:04:53,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:53" (1/1) ... [2021-12-14 17:04:53,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 17:04:53,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 17:04:53,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 17:04:53,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 17:04:53,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:53" (1/1) ... [2021-12-14 17:04:53,681 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 17:04:53,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:04:53,698 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-12-14 17:04:53,706 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-12-14 17:04:53,724 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-14 17:04:53,724 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-14 17:04:53,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-14 17:04:53,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-14 17:04:53,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 17:04:53,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 17:04:53,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 17:04:53,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 17:04:53,725 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-14 17:04:53,725 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-14 17:04:53,725 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-14 17:04:53,726 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-14 17:04:53,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 17:04:53,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-14 17:04:53,726 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-14 17:04:53,726 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-14 17:04:53,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 17:04:53,726 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2021-12-14 17:04:53,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2021-12-14 17:04:53,726 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2021-12-14 17:04:53,727 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2021-12-14 17:04:53,947 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 17:04:53,948 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 17:04:54,234 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2021-12-14 17:04:54,246 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 17:04:54,253 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 17:04:54,254 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 17:04:54,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:04:54 BoogieIcfgContainer [2021-12-14 17:04:54,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 17:04:54,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 17:04:54,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 17:04:54,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 17:04:54,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 05:04:50" (1/3) ... [2021-12-14 17:04:54,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a18b60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:04:54, skipping insertion in model container [2021-12-14 17:04:54,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:04:53" (2/3) ... [2021-12-14 17:04:54,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a18b60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:04:54, skipping insertion in model container [2021-12-14 17:04:54,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:04:54" (3/3) ... [2021-12-14 17:04:54,261 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2021-12-14 17:04:54,265 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 17:04:54,265 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 17:04:54,304 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 17:04:54,308 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-12-14 17:04:54,308 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 17:04:54,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-14 17:04:54,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-14 17:04:54,326 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:04:54,326 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2021-12-14 17:04:54,327 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:04:54,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:04:54,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1163022186, now seen corresponding path program 1 times [2021-12-14 17:04:54,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 17:04:54,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745421051] [2021-12-14 17:04:54,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:04:54,345 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 17:04:54,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 17:04:54,347 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-12-14 17:04:54,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-14 17:04:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:54,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-14 17:04:54,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:04:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-14 17:04:54,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:04:54,745 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 17:04:54,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745421051] [2021-12-14 17:04:54,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745421051] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:04:54,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:04:54,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 17:04:54,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873219488] [2021-12-14 17:04:54,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:04:54,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 17:04:54,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 17:04:54,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 17:04:54,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 17:04:54,769 INFO L87 Difference]: Start difference. First operand has 71 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-14 17:04:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:04:54,786 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2021-12-14 17:04:54,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 17:04:54,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 67 [2021-12-14 17:04:54,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:04:54,795 INFO L225 Difference]: With dead ends: 139 [2021-12-14 17:04:54,795 INFO L226 Difference]: Without dead ends: 65 [2021-12-14 17:04:54,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 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-12-14 17:04:54,800 INFO L933 BasicCegarLoop]: 86 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, 86 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-12-14 17:04:54,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 17:04:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-14 17:04:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-14 17:04:54,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-14 17:04:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2021-12-14 17:04:54,829 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2021-12-14 17:04:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:04:54,830 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2021-12-14 17:04:54,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-14 17:04:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2021-12-14 17:04:54,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 17:04:54,832 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:04:54,832 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:04:54,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-14 17:04:55,045 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-12-14 17:04:55,045 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:04:55,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:04:55,046 INFO L85 PathProgramCache]: Analyzing trace with hash -447828983, now seen corresponding path program 1 times [2021-12-14 17:04:55,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 17:04:55,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279445125] [2021-12-14 17:04:55,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:04:55,047 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 17:04:55,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 17:04:55,064 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-12-14 17:04:55,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-14 17:04:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:55,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-14 17:04:55,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:04:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-14 17:04:55,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:04:55,558 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 17:04:55,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279445125] [2021-12-14 17:04:55,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279445125] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:04:55,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:04:55,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-14 17:04:55,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783332142] [2021-12-14 17:04:55,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:04:55,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 17:04:55,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 17:04:55,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 17:04:55,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-12-14 17:04:55,562 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-14 17:04:55,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:04:55,746 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2021-12-14 17:04:55,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 17:04:55,747 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) Word has length 70 [2021-12-14 17:04:55,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:04:55,748 INFO L225 Difference]: With dead ends: 89 [2021-12-14 17:04:55,748 INFO L226 Difference]: Without dead ends: 65 [2021-12-14 17:04:55,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-12-14 17:04:55,749 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 29 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 17:04:55,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 663 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 17:04:55,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-14 17:04:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-14 17:04:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 39 states have internal predecessors, (40), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-14 17:04:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2021-12-14 17:04:55,758 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 70 [2021-12-14 17:04:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:04:55,759 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2021-12-14 17:04:55,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-14 17:04:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2021-12-14 17:04:55,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-14 17:04:55,761 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:04:55,761 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:04:55,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-14 17:04:55,971 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-12-14 17:04:55,972 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:04:55,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:04:55,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1505925942, now seen corresponding path program 1 times [2021-12-14 17:04:55,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 17:04:55,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392918563] [2021-12-14 17:04:55,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:04:55,974 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 17:04:55,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 17:04:55,974 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-12-14 17:04:55,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-14 17:04:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:56,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-14 17:04:56,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:04:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-14 17:04:56,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:04:56,441 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 17:04:56,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392918563] [2021-12-14 17:04:56,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392918563] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:04:56,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:04:56,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-14 17:04:56,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984005243] [2021-12-14 17:04:56,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:04:56,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 17:04:56,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 17:04:56,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 17:04:56,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-12-14 17:04:56,443 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2021-12-14 17:04:56,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:04:56,737 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2021-12-14 17:04:56,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 17:04:56,739 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2021-12-14 17:04:56,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:04:56,741 INFO L225 Difference]: With dead ends: 94 [2021-12-14 17:04:56,741 INFO L226 Difference]: Without dead ends: 92 [2021-12-14 17:04:56,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-12-14 17:04:56,742 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 38 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:04:56,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 914 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 17:04:56,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-14 17:04:56,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2021-12-14 17:04:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-14 17:04:56,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2021-12-14 17:04:56,750 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 75 [2021-12-14 17:04:56,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:04:56,750 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2021-12-14 17:04:56,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2021-12-14 17:04:56,751 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2021-12-14 17:04:56,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-14 17:04:56,752 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:04:56,752 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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] [2021-12-14 17:04:56,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-14 17:04:56,963 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-12-14 17:04:56,964 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:04:56,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:04:56,964 INFO L85 PathProgramCache]: Analyzing trace with hash -892933696, now seen corresponding path program 1 times [2021-12-14 17:04:56,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 17:04:56,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687528948] [2021-12-14 17:04:56,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:04:56,965 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 17:04:56,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 17:04:56,966 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-12-14 17:04:56,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-14 17:04:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:57,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 17:04:57,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:04:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-14 17:04:57,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:04:57,440 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 17:04:57,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687528948] [2021-12-14 17:04:57,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687528948] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:04:57,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:04:57,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-14 17:04:57,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444752301] [2021-12-14 17:04:57,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:04:57,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 17:04:57,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 17:04:57,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 17:04:57,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-14 17:04:57,442 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-14 17:04:57,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:04:57,644 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2021-12-14 17:04:57,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 17:04:57,646 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) Word has length 83 [2021-12-14 17:04:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:04:57,647 INFO L225 Difference]: With dead ends: 98 [2021-12-14 17:04:57,647 INFO L226 Difference]: Without dead ends: 96 [2021-12-14 17:04:57,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-12-14 17:04:57,648 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 36 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:04:57,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 854 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 17:04:57,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-14 17:04:57,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2021-12-14 17:04:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 55 states have internal predecessors, (55), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-14 17:04:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2021-12-14 17:04:57,656 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 83 [2021-12-14 17:04:57,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:04:57,656 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2021-12-14 17:04:57,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-14 17:04:57,656 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2021-12-14 17:04:57,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-14 17:04:57,658 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:04:57,658 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 4, 4, 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] [2021-12-14 17:04:57,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-14 17:04:57,871 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-12-14 17:04:57,871 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:04:57,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:04:57,872 INFO L85 PathProgramCache]: Analyzing trace with hash 829878033, now seen corresponding path program 1 times [2021-12-14 17:04:57,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 17:04:57,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526207608] [2021-12-14 17:04:57,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:04:57,873 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 17:04:57,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 17:04:57,874 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-12-14 17:04:57,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-14 17:04:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:58,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 17:04:58,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:04:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-12-14 17:04:58,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:04:58,361 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 17:04:58,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526207608] [2021-12-14 17:04:58,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526207608] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:04:58,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:04:58,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-14 17:04:58,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334811611] [2021-12-14 17:04:58,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:04:58,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 17:04:58,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 17:04:58,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 17:04:58,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2021-12-14 17:04:58,363 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-14 17:04:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:04:58,602 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2021-12-14 17:04:58,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 17:04:58,602 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) Word has length 107 [2021-12-14 17:04:58,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:04:58,604 INFO L225 Difference]: With dead ends: 102 [2021-12-14 17:04:58,604 INFO L226 Difference]: Without dead ends: 100 [2021-12-14 17:04:58,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-12-14 17:04:58,605 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 14 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:04:58,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 1199 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 17:04:58,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-14 17:04:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2021-12-14 17:04:58,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 58 states have internal predecessors, (58), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-14 17:04:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2021-12-14 17:04:58,612 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 107 [2021-12-14 17:04:58,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:04:58,612 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2021-12-14 17:04:58,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-14 17:04:58,613 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2021-12-14 17:04:58,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-14 17:04:58,614 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:04:58,614 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 4, 4, 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] [2021-12-14 17:04:58,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-14 17:04:58,814 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-12-14 17:04:58,815 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:04:58,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:04:58,815 INFO L85 PathProgramCache]: Analyzing trace with hash 265370887, now seen corresponding path program 1 times [2021-12-14 17:04:58,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 17:04:58,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476690273] [2021-12-14 17:04:58,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:04:58,816 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 17:04:58,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 17:04:58,818 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-12-14 17:04:58,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-14 17:04:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:04:59,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-14 17:04:59,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:04:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-14 17:04:59,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:04:59,404 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 17:04:59,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476690273] [2021-12-14 17:04:59,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476690273] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:04:59,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:04:59,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-14 17:04:59,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858335020] [2021-12-14 17:04:59,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:04:59,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 17:04:59,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 17:04:59,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 17:04:59,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-12-14 17:04:59,406 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-14 17:04:59,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:04:59,639 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2021-12-14 17:04:59,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 17:04:59,640 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2021-12-14 17:04:59,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:04:59,642 INFO L225 Difference]: With dead ends: 100 [2021-12-14 17:04:59,642 INFO L226 Difference]: Without dead ends: 96 [2021-12-14 17:04:59,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-12-14 17:04:59,643 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 26 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:04:59,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 752 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 17:04:59,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-14 17:04:59,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2021-12-14 17:04:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-14 17:04:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2021-12-14 17:04:59,650 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 115 [2021-12-14 17:04:59,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:04:59,650 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2021-12-14 17:04:59,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-14 17:04:59,651 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2021-12-14 17:04:59,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-14 17:04:59,652 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:04:59,652 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:04:59,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-14 17:04:59,863 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-12-14 17:04:59,863 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:04:59,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:04:59,864 INFO L85 PathProgramCache]: Analyzing trace with hash -565706850, now seen corresponding path program 1 times [2021-12-14 17:04:59,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 17:04:59,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060086278] [2021-12-14 17:04:59,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:04:59,865 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 17:04:59,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 17:04:59,865 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-12-14 17:04:59,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-14 17:05:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:05:00,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-14 17:05:00,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:05:00,338 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 19 treesize of output 7 [2021-12-14 17:05:00,368 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-12-14 17:05:00,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:05:00,369 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 17:05:00,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060086278] [2021-12-14 17:05:00,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060086278] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:05:00,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:05:00,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 17:05:00,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139720963] [2021-12-14 17:05:00,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:05:00,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 17:05:00,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 17:05:00,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 17:05:00,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 17:05:00,370 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-12-14 17:05:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:05:00,526 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2021-12-14 17:05:00,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 17:05:00,526 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 100 [2021-12-14 17:05:00,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:05:00,527 INFO L225 Difference]: With dead ends: 102 [2021-12-14 17:05:00,527 INFO L226 Difference]: Without dead ends: 71 [2021-12-14 17:05:00,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-14 17:05:00,528 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 10 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 17:05:00,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 547 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 17:05:00,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-14 17:05:00,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-14 17:05:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0) internal successors, (43), 43 states have internal predecessors, (43), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-14 17:05:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2021-12-14 17:05:00,533 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 100 [2021-12-14 17:05:00,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:05:00,534 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2021-12-14 17:05:00,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-12-14 17:05:00,534 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2021-12-14 17:05:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-14 17:05:00,535 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:05:00,535 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 3, 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] [2021-12-14 17:05:00,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-14 17:05:00,747 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-12-14 17:05:00,747 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:05:00,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:05:00,748 INFO L85 PathProgramCache]: Analyzing trace with hash -549207241, now seen corresponding path program 1 times [2021-12-14 17:05:00,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 17:05:00,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116307913] [2021-12-14 17:05:00,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:05:00,749 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 17:05:00,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 17:05:00,750 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-12-14 17:05:00,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-14 17:05:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 17:05:01,312 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 17:05:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 17:05:02,060 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-14 17:05:02,060 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 17:05:02,061 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 17:05:02,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-14 17:05:02,262 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-12-14 17:05:02,265 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:05:02,267 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 17:05:02,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 05:05:02 BoogieIcfgContainer [2021-12-14 17:05:02,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 17:05:02,331 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 17:05:02,332 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 17:05:02,332 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 17:05:02,332 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:04:54" (3/4) ... [2021-12-14 17:05:02,341 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 17:05:02,341 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 17:05:02,341 INFO L158 Benchmark]: Toolchain (without parser) took 11791.99ms. Allocated memory was 62.9MB in the beginning and 333.4MB in the end (delta: 270.5MB). Free memory was 38.0MB in the beginning and 188.9MB in the end (delta: -150.9MB). Peak memory consumption was 120.6MB. Max. memory is 16.1GB. [2021-12-14 17:05:02,341 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 52.4MB. Free memory was 34.2MB in the beginning and 34.1MB in the end (delta: 34.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 17:05:02,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2866.00ms. Allocated memory was 62.9MB in the beginning and 203.4MB in the end (delta: 140.5MB). Free memory was 37.9MB in the beginning and 142.7MB in the end (delta: -104.8MB). Peak memory consumption was 85.5MB. Max. memory is 16.1GB. [2021-12-14 17:05:02,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 177.48ms. Allocated memory is still 203.4MB. Free memory was 142.7MB in the beginning and 132.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 17:05:02,342 INFO L158 Benchmark]: Boogie Preprocessor took 77.85ms. Allocated memory is still 203.4MB. Free memory was 132.2MB in the beginning and 126.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-14 17:05:02,342 INFO L158 Benchmark]: RCFGBuilder took 580.84ms. Allocated memory is still 203.4MB. Free memory was 126.9MB in the beginning and 92.3MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2021-12-14 17:05:02,343 INFO L158 Benchmark]: TraceAbstraction took 8074.20ms. Allocated memory was 203.4MB in the beginning and 333.4MB in the end (delta: 130.0MB). Free memory was 91.3MB in the beginning and 188.9MB in the end (delta: -97.6MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2021-12-14 17:05:02,343 INFO L158 Benchmark]: Witness Printer took 9.42ms. Allocated memory is still 333.4MB. Free memory was 188.9MB in the beginning and 188.9MB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 17:05:02,344 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.14ms. Allocated memory is still 52.4MB. Free memory was 34.2MB in the beginning and 34.1MB in the end (delta: 34.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2866.00ms. Allocated memory was 62.9MB in the beginning and 203.4MB in the end (delta: 140.5MB). Free memory was 37.9MB in the beginning and 142.7MB in the end (delta: -104.8MB). Peak memory consumption was 85.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 177.48ms. Allocated memory is still 203.4MB. Free memory was 142.7MB in the beginning and 132.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.85ms. Allocated memory is still 203.4MB. Free memory was 132.2MB in the beginning and 126.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 580.84ms. Allocated memory is still 203.4MB. Free memory was 126.9MB in the beginning and 92.3MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8074.20ms. Allocated memory was 203.4MB in the beginning and 333.4MB in the end (delta: 130.0MB). Free memory was 91.3MB in the beginning and 188.9MB in the end (delta: -97.6MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. * Witness Printer took 9.42ms. Allocated memory is still 333.4MB. Free memory was 188.9MB in the beginning and 188.9MB in the end (delta: 2.7kB). 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: overapproximation of strcmp at line 10798, overapproximation of strlen at line 11324. Possible FailurePath: [L6879-L6884] 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, }; [L7634-L7646] static const uint8_t s_tolower_table[256] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 91, 92, 93, 94, 95, 96, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255}; VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L11328] CALL aws_hash_callback_c_str_eq_harness() [L11318] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, size=64] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={14:0}, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={14:0}, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}] [L11318] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={14:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L11318] const char *str1 = ensure_c_str_is_allocated(64); [L11319] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L261] return __VERIFIER_nondet_bool(); [L11319] RET, EXPR nondet_bool() VAL [nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={14:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={14:0}] [L11319] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, size=64] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={9:0}, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={9:0}, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}] [L11319] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={9:0}, nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={14:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={9:0}, nondet_bool()=0, nondet_bool() ? str1 : ensure_c_str_is_allocated(64)={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={14:0}] [L11319] const char *str2 = nondet_bool() ? str1 : ensure_c_str_is_allocated(64); [L11322] CALL, EXPR aws_hash_callback_c_str_eq(str1, str2) [L10794] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}, str={14:0}] [L10794] RET, EXPR aws_c_string_is_valid(a) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, b={9:0}, b={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10794] CALL assume_abort_if_not((aws_c_string_is_valid(a))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10794] RET assume_abort_if_not((aws_c_string_is_valid(a))) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, b={9:0}, b={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}, str={9:0}] [L10795] RET, EXPR aws_c_string_is_valid(b) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] CALL assume_abort_if_not((aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] RET assume_abort_if_not((aws_c_string_is_valid(b))) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10797-L10798] _Bool rval = !strcmp(a, b); [L10799] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}, str={14:0}] [L10799] RET, EXPR aws_c_string_is_valid(a) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}, str={9:0}] [L10799] RET, EXPR aws_c_string_is_valid(b) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] CALL __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] RET __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] return rval; VAL [\result=1, a={14:0}, a={14:0}, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L11322] RET, EXPR aws_hash_callback_c_str_eq(str1, str2) [L11321-L11322] _Bool rval = aws_hash_callback_c_str_eq(str1, str2); [L11323] COND TRUE \read(rval) [L11324] size_t len = strlen(str1); [L11325] CALL assert_bytes_match(str1, str2, len) [L7113] CALL __VERIFIER_assert(!a == !b) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7113] RET __VERIFIER_assert(!a == !b) VAL [\old(len)=1073741824, a={14:0}, a={14:0}, b={9:0}, b={9:0}, len=1073741824, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7114-L7117] COND TRUE len > 0 && a != ((void *)0) && b != ((void *)0) VAL [\old(len)=1073741824, a={14:0}, a={14:0}, b={9:0}, b={9:0}, len=1073741824, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7119] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L7119] RET, EXPR nondet_uint64_t() VAL [\old(len)=1073741824, a={14:0}, a={14:0}, b={9:0}, b={9:0}, len=1073741824, nondet_uint64_t()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7119] size_t i = nondet_uint64_t(); [L7120-L7122] CALL assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7120-L7122] RET assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(len)=1073741824, a={14:0}, a={14:0}, b={9:0}, b={9:0}, i=0, len=1073741824, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7123] EXPR a[i] [L7123] EXPR b[i] VAL [\old(len)=1073741824, a={14:0}, a={14:0}, a[i]=48, b={9:0}, b={9:0}, b[i]=-80, i=0, len=1073741824, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7123] CALL __VERIFIER_assert(a[i] == b[i]) VAL [\old(cond)=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 5015 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4468 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 958 IncrementalHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 547 mSDtfsCounter, 958 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 636 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 1351 SizeOfPredicates, 55 NumberOfNonLiveVariables, 3221 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 597/597 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-12-14 17:05:02,374 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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample