./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 791161d1 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-?-791161d [2022-07-22 22:22:08,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 22:22:08,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 22:22:08,555 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 22:22:08,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 22:22:08,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 22:22:08,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 22:22:08,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 22:22:08,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 22:22:08,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 22:22:08,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 22:22:08,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 22:22:08,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 22:22:08,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 22:22:08,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 22:22:08,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 22:22:08,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 22:22:08,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 22:22:08,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 22:22:08,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 22:22:08,574 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 22:22:08,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 22:22:08,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 22:22:08,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 22:22:08,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 22:22:08,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 22:22:08,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 22:22:08,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 22:22:08,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 22:22:08,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 22:22:08,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 22:22:08,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 22:22:08,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 22:22:08,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 22:22:08,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 22:22:08,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 22:22:08,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 22:22:08,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 22:22:08,601 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 22:22:08,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 22:22:08,603 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 22:22:08,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 22:22:08,607 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-22 22:22:08,631 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 22:22:08,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 22:22:08,632 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 22:22:08,632 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 22:22:08,633 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 22:22:08,633 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 22:22:08,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 22:22:08,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 22:22:08,634 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 22:22:08,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 22:22:08,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 22:22:08,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 22:22:08,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 22:22:08,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 22:22:08,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 22:22:08,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 22:22:08,637 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 22:22:08,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 22:22:08,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 22:22:08,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 22:22:08,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 22:22:08,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:22:08,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 22:22:08,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 22:22:08,639 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 22:22:08,640 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 22:22:08,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 22:22:08,640 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 22:22:08,640 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 22:22:08,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 22:22:08,641 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 [2022-07-22 22:22:08,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 22:22:08,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 22:22:08,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 22:22:08,871 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 22:22:08,872 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 22:22:08,873 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 [2022-07-22 22:22:08,951 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f70e2b9b6/2dd604d7660b48b5bcac7b86ece63840/FLAG876e56220 [2022-07-22 22:22:09,630 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 22:22:09,631 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2022-07-22 22:22:09,665 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f70e2b9b6/2dd604d7660b48b5bcac7b86ece63840/FLAG876e56220 [2022-07-22 22:22:09,738 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f70e2b9b6/2dd604d7660b48b5bcac7b86ece63840 [2022-07-22 22:22:09,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 22:22:09,743 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 22:22:09,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 22:22:09,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 22:22:09,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 22:22:09,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:22:09" (1/1) ... [2022-07-22 22:22:09,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b05a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:22:09, skipping insertion in model container [2022-07-22 22:22:09,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:22:09" (1/1) ... [2022-07-22 22:22:09,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 22:22:09,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 22:22:10,123 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] [2022-07-22 22:22:10,131 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] [2022-07-22 22:22:11,030 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:11,030 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:11,034 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:11,035 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:11,036 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:11,047 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:11,048 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:11,049 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:11,049 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:11,468 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:22:11,469 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:22:11,470 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:22:11,471 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:22:11,475 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:22:11,479 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:22:11,482 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:22:11,483 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:22:11,484 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:22:11,486 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:22:11,618 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:22:11,686 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:11,687 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,015 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,015 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,037 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,039 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,047 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,048 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,064 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,066 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,066 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,067 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,068 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,068 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,068 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:22:12,180 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 22:22:12,204 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] [2022-07-22 22:22:12,204 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] [2022-07-22 22:22:12,249 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,249 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,252 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,252 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,253 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,259 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,259 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,260 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,260 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,285 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:22:12,286 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:22:12,286 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:22:12,287 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:22:12,287 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:22:12,288 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:22:12,289 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:22:12,289 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:22:12,289 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:22:12,290 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:22:12,305 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:22:12,371 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,373 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,434 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,435 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,441 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,442 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,446 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,447 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,453 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,454 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,455 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,455 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,456 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,456 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,456 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:12,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:22:12,694 INFO L208 MainTranslator]: Completed translation [2022-07-22 22:22:12,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:22:12 WrapperNode [2022-07-22 22:22:12,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 22:22:12,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 22:22:12,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 22:22:12,696 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 22:22:12,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:22:12" (1/1) ... [2022-07-22 22:22:12,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:22:12" (1/1) ... [2022-07-22 22:22:12,856 INFO L137 Inliner]: procedures = 768, calls = 3253, calls flagged for inlining = 78, calls inlined = 5, statements flattened = 337 [2022-07-22 22:22:12,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 22:22:12,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 22:22:12,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 22:22:12,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 22:22:12,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:22:12" (1/1) ... [2022-07-22 22:22:12,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:22:12" (1/1) ... [2022-07-22 22:22:12,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:22:12" (1/1) ... [2022-07-22 22:22:12,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:22:12" (1/1) ... [2022-07-22 22:22:12,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:22:12" (1/1) ... [2022-07-22 22:22:12,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:22:12" (1/1) ... [2022-07-22 22:22:12,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:22:12" (1/1) ... [2022-07-22 22:22:12,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 22:22:12,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 22:22:12,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 22:22:12,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 22:22:12,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:22:12" (1/1) ... [2022-07-22 22:22:12,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:22:12,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:22:12,985 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 22:22:13,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 22:22:13,026 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-22 22:22:13,026 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-22 22:22:13,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 22:22:13,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 22:22:13,027 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 22:22:13,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 22:22:13,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 22:22:13,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 22:22:13,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 22:22:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-22 22:22:13,028 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-22 22:22:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 22:22:13,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 22:22:13,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 22:22:13,029 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-22 22:22:13,029 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-22 22:22:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2022-07-22 22:22:13,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2022-07-22 22:22:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2022-07-22 22:22:13,030 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2022-07-22 22:22:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 22:22:13,288 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 22:22:13,290 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 22:22:13,631 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2022-07-22 22:22:13,641 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 22:22:13,647 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 22:22:13,647 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 22:22:13,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:22:13 BoogieIcfgContainer [2022-07-22 22:22:13,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 22:22:13,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 22:22:13,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 22:22:13,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 22:22:13,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:22:09" (1/3) ... [2022-07-22 22:22:13,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edffbfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:22:13, skipping insertion in model container [2022-07-22 22:22:13,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:22:12" (2/3) ... [2022-07-22 22:22:13,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edffbfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:22:13, skipping insertion in model container [2022-07-22 22:22:13,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:22:13" (3/3) ... [2022-07-22 22:22:13,656 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2022-07-22 22:22:13,689 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 22:22:13,689 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 22:22:13,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 22:22:13,761 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3a3c4787, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@53cf4150 [2022-07-22 22:22:13,761 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 22:22:13,766 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) [2022-07-22 22:22:13,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-22 22:22:13,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:22:13,777 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:22:13,779 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:22:13,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:22:13,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1163022186, now seen corresponding path program 1 times [2022-07-22 22:22:13,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:22:13,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205458846] [2022-07-22 22:22:13,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:22:13,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:22:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:14,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:22:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:14,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:14,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:22:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:14,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:22:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:14,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:14,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:22:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:14,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 22:22:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:14,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:22:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:14,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:22:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:14,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:22:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:14,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:22:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-22 22:22:14,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:22:14,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205458846] [2022-07-22 22:22:14,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205458846] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:22:14,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:22:14,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 22:22:14,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467143505] [2022-07-22 22:22:14,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:22:14,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 22:22:14,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:22:14,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 22:22:14,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:22:14,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) [2022-07-22 22:22:14,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:22:14,539 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2022-07-22 22:22:14,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 22:22:14,542 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 [2022-07-22 22:22:14,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:22:14,548 INFO L225 Difference]: With dead ends: 139 [2022-07-22 22:22:14,549 INFO L226 Difference]: Without dead ends: 65 [2022-07-22 22:22:14,552 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:22:14,555 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 17 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 [2022-07-22 22:22:14,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 113 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:22:14,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-22 22:22:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-07-22 22:22:14,589 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) [2022-07-22 22:22:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-07-22 22:22:14,593 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2022-07-22 22:22:14,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:22:14,594 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-07-22 22:22:14,594 INFO L496 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) [2022-07-22 22:22:14,595 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-07-22 22:22:14,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-22 22:22:14,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:22:14,597 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:22:14,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 22:22:14,598 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:22:14,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:22:14,599 INFO L85 PathProgramCache]: Analyzing trace with hash -447828983, now seen corresponding path program 1 times [2022-07-22 22:22:14,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:22:14,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169393039] [2022-07-22 22:22:14,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:22:14,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:22:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:14,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:22:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:14,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:14,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:22:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:14,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:22:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:14,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:14,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:22:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:14,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 22:22:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:22:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:22:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:22:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:22:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:22:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,088 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-22 22:22:15,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:22:15,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169393039] [2022-07-22 22:22:15,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169393039] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:22:15,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:22:15,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-22 22:22:15,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768318723] [2022-07-22 22:22:15,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:22:15,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 22:22:15,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:22:15,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 22:22:15,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:22:15,092 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) [2022-07-22 22:22:15,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:22:15,492 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2022-07-22 22:22:15,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 22:22:15,493 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 [2022-07-22 22:22:15,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:22:15,497 INFO L225 Difference]: With dead ends: 89 [2022-07-22 22:22:15,497 INFO L226 Difference]: Without dead ends: 65 [2022-07-22 22:22:15,498 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:22:15,502 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 46 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:22:15,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 410 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:22:15,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-22 22:22:15,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-07-22 22:22:15,530 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) [2022-07-22 22:22:15,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2022-07-22 22:22:15,531 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 70 [2022-07-22 22:22:15,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:22:15,532 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2022-07-22 22:22:15,532 INFO L496 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) [2022-07-22 22:22:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2022-07-22 22:22:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-22 22:22:15,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:22:15,534 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:22:15,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 22:22:15,534 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:22:15,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:22:15,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1505925942, now seen corresponding path program 1 times [2022-07-22 22:22:15,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:22:15,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004586286] [2022-07-22 22:22:15,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:22:15,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:22:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:22:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:22:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:22:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:22:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 22:22:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:22:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:22:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:22:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:22:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:22:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-22 22:22:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:15,987 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-22 22:22:15,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:22:15,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004586286] [2022-07-22 22:22:15,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004586286] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:22:15,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:22:15,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-22 22:22:15,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49033740] [2022-07-22 22:22:15,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:22:15,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-22 22:22:15,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:22:15,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 22:22:15,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2022-07-22 22:22:15,991 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) [2022-07-22 22:22:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:22:16,574 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-07-22 22:22:16,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 22:22:16,575 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 [2022-07-22 22:22:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:22:16,580 INFO L225 Difference]: With dead ends: 94 [2022-07-22 22:22:16,580 INFO L226 Difference]: Without dead ends: 92 [2022-07-22 22:22:16,580 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:22:16,595 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 58 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:22:16,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 531 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:22:16,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-22 22:22:16,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2022-07-22 22:22:16,606 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) [2022-07-22 22:22:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2022-07-22 22:22:16,608 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 75 [2022-07-22 22:22:16,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:22:16,608 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2022-07-22 22:22:16,609 INFO L496 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) [2022-07-22 22:22:16,609 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2022-07-22 22:22:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-22 22:22:16,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:22:16,611 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:22:16,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 22:22:16,611 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:22:16,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:22:16,611 INFO L85 PathProgramCache]: Analyzing trace with hash -892933696, now seen corresponding path program 1 times [2022-07-22 22:22:16,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:22:16,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974822962] [2022-07-22 22:22:16,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:22:16,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:22:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:16,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:22:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:16,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:16,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:22:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:16,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:22:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:22:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 22:22:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:22:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:22:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:22:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:22:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:22:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-22 22:22:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 22:22:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-22 22:22:17,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:22:17,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974822962] [2022-07-22 22:22:17,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974822962] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:22:17,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:22:17,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-22 22:22:17,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902235178] [2022-07-22 22:22:17,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:22:17,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 22:22:17,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:22:17,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 22:22:17,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:22:17,150 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) [2022-07-22 22:22:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:22:17,631 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2022-07-22 22:22:17,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 22:22:17,634 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 [2022-07-22 22:22:17,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:22:17,636 INFO L225 Difference]: With dead ends: 98 [2022-07-22 22:22:17,636 INFO L226 Difference]: Without dead ends: 96 [2022-07-22 22:22:17,636 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:22:17,637 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 59 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:22:17,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 454 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:22:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-22 22:22:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-07-22 22:22:17,646 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) [2022-07-22 22:22:17,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2022-07-22 22:22:17,655 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 83 [2022-07-22 22:22:17,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:22:17,656 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2022-07-22 22:22:17,656 INFO L496 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) [2022-07-22 22:22:17,657 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2022-07-22 22:22:17,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-22 22:22:17,661 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:22:17,662 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:22:17,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 22:22:17,662 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:22:17,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:22:17,663 INFO L85 PathProgramCache]: Analyzing trace with hash 829878033, now seen corresponding path program 1 times [2022-07-22 22:22:17,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:22:17,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188122143] [2022-07-22 22:22:17,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:22:17,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:22:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:22:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:22:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:22:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:22:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 22:22:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 22:22:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:17,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:18,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:22:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:18,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:22:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:18,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:18,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:22:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:18,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 22:22:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:18,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:22:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:18,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:22:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:18,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 22:22:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:18,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-22 22:22:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:18,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 22:22:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:18,149 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-22 22:22:18,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:22:18,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188122143] [2022-07-22 22:22:18,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188122143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:22:18,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:22:18,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-22 22:22:18,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142726584] [2022-07-22 22:22:18,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:22:18,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 22:22:18,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:22:18,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 22:22:18,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-07-22 22:22:18,152 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) [2022-07-22 22:22:18,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:22:18,610 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2022-07-22 22:22:18,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 22:22:18,610 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 [2022-07-22 22:22:18,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:22:18,612 INFO L225 Difference]: With dead ends: 102 [2022-07-22 22:22:18,612 INFO L226 Difference]: Without dead ends: 100 [2022-07-22 22:22:18,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-07-22 22:22:18,613 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 31 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:22:18,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 817 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:22:18,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-22 22:22:18,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2022-07-22 22:22:18,622 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) [2022-07-22 22:22:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2022-07-22 22:22:18,623 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 107 [2022-07-22 22:22:18,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:22:18,624 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2022-07-22 22:22:18,624 INFO L496 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) [2022-07-22 22:22:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2022-07-22 22:22:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-22 22:22:18,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:22:18,626 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:22:18,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 22:22:18,627 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:22:18,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:22:18,627 INFO L85 PathProgramCache]: Analyzing trace with hash 265370887, now seen corresponding path program 1 times [2022-07-22 22:22:18,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:22:18,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811246265] [2022-07-22 22:22:18,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:22:18,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:22:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:18,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:22:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:18,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:18,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:22:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:18,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:22:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:19,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:19,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:22:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:19,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 22:22:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:19,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 22:22:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:19,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:19,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:22:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:19,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:22:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:19,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:19,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:22:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:19,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 22:22:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:19,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 22:22:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:19,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:22:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:19,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 22:22:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:19,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-22 22:22:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:19,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 22:22:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:19,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-22 22:22:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:19,188 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-22 22:22:19,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:22:19,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811246265] [2022-07-22 22:22:19,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811246265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:22:19,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:22:19,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-22 22:22:19,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78581463] [2022-07-22 22:22:19,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:22:19,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 22:22:19,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:22:19,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 22:22:19,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-22 22:22:19,191 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) [2022-07-22 22:22:19,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:22:19,554 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2022-07-22 22:22:19,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 22:22:19,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 [2022-07-22 22:22:19,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:22:19,557 INFO L225 Difference]: With dead ends: 100 [2022-07-22 22:22:19,557 INFO L226 Difference]: Without dead ends: 96 [2022-07-22 22:22:19,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-07-22 22:22:19,558 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 45 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:22:19,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 407 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:22:19,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-22 22:22:19,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-07-22 22:22:19,565 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) [2022-07-22 22:22:19,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-07-22 22:22:19,565 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 115 [2022-07-22 22:22:19,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:22:19,566 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-07-22 22:22:19,566 INFO L496 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) [2022-07-22 22:22:19,566 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-07-22 22:22:19,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-22 22:22:19,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:22:19,567 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:22:19,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 22:22:19,568 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:22:19,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:22:19,568 INFO L85 PathProgramCache]: Analyzing trace with hash -565706850, now seen corresponding path program 1 times [2022-07-22 22:22:19,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:22:19,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977977094] [2022-07-22 22:22:19,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:22:19,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:22:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:19,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:22:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:20,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:20,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:22:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:20,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 22:22:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:20,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:22:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:20,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:22:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:20,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 22:22:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:20,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:22:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:20,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:22:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:20,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:22:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:20,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:22:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:20,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:22:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:20,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-22 22:22:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:20,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 22:22:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:20,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-22 22:22:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:20,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:22:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:20,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 22:22:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:22:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-22 22:22:20,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:22:20,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977977094] [2022-07-22 22:22:20,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977977094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:22:20,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:22:20,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-22 22:22:20,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829503789] [2022-07-22 22:22:20,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:22:20,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 22:22:20,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:22:20,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 22:22:20,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-22 22:22:20,251 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) [2022-07-22 22:22:20,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:22:20,719 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2022-07-22 22:22:20,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 22:22:20,720 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 [2022-07-22 22:22:20,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:22:20,721 INFO L225 Difference]: With dead ends: 102 [2022-07-22 22:22:20,721 INFO L226 Difference]: Without dead ends: 71 [2022-07-22 22:22:20,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-07-22 22:22:20,722 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 55 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:22:20,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 484 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 22:22:20,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-22 22:22:20,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-07-22 22:22:20,728 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) [2022-07-22 22:22:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-07-22 22:22:20,729 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 100 [2022-07-22 22:22:20,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:22:20,730 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-07-22 22:22:20,730 INFO L496 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) [2022-07-22 22:22:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-07-22 22:22:20,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-22 22:22:20,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:22:20,731 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:22:20,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 22:22:20,732 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:22:20,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:22:20,732 INFO L85 PathProgramCache]: Analyzing trace with hash -549207241, now seen corresponding path program 1 times [2022-07-22 22:22:20,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:22:20,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142352099] [2022-07-22 22:22:20,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:22:20,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:22:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 22:22:20,955 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 22:22:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 22:22:21,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 22:22:21,232 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 22:22:21,233 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 22:22:21,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 22:22:21,238 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:22:21,242 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 22:22:21,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 10:22:21 BoogieIcfgContainer [2022-07-22 22:22:21,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 22:22:21,334 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 22:22:21,334 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 22:22:21,335 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 22:22:21,335 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:22:13" (3/4) ... [2022-07-22 22:22:21,338 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 22:22:21,338 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 22:22:21,338 INFO L158 Benchmark]: Toolchain (without parser) took 11595.65ms. Allocated memory was 115.3MB in the beginning and 281.0MB in the end (delta: 165.7MB). Free memory was 87.5MB in the beginning and 192.1MB in the end (delta: -104.6MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. [2022-07-22 22:22:21,339 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 90.2MB. Free memory is still 44.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 22:22:21,339 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2950.18ms. Allocated memory was 115.3MB in the beginning and 153.1MB in the end (delta: 37.7MB). Free memory was 87.5MB in the beginning and 60.5MB in the end (delta: 26.9MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. [2022-07-22 22:22:21,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 161.28ms. Allocated memory is still 153.1MB. Free memory was 60.5MB in the beginning and 86.0MB in the end (delta: -25.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 22:22:21,340 INFO L158 Benchmark]: Boogie Preprocessor took 86.28ms. Allocated memory is still 153.1MB. Free memory was 86.0MB in the beginning and 81.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 22:22:21,340 INFO L158 Benchmark]: RCFGBuilder took 704.72ms. Allocated memory is still 153.1MB. Free memory was 81.8MB in the beginning and 51.7MB in the end (delta: 30.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-07-22 22:22:21,340 INFO L158 Benchmark]: TraceAbstraction took 7683.02ms. Allocated memory was 153.1MB in the beginning and 281.0MB in the end (delta: 127.9MB). Free memory was 51.7MB in the beginning and 193.1MB in the end (delta: -141.4MB). Peak memory consumption was 116.3MB. Max. memory is 16.1GB. [2022-07-22 22:22:21,341 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 281.0MB. Free memory was 193.1MB in the beginning and 192.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 22:22:21,343 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.21ms. Allocated memory is still 90.2MB. Free memory is still 44.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2950.18ms. Allocated memory was 115.3MB in the beginning and 153.1MB in the end (delta: 37.7MB). Free memory was 87.5MB in the beginning and 60.5MB in the end (delta: 26.9MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 161.28ms. Allocated memory is still 153.1MB. Free memory was 60.5MB in the beginning and 86.0MB in the end (delta: -25.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.28ms. Allocated memory is still 153.1MB. Free memory was 86.0MB in the beginning and 81.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 704.72ms. Allocated memory is still 153.1MB. Free memory was 81.8MB in the beginning and 51.7MB in the end (delta: 30.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7683.02ms. Allocated memory was 153.1MB in the beginning and 281.0MB in the end (delta: 127.9MB). Free memory was 51.7MB in the beginning and 193.1MB in the end (delta: -141.4MB). Peak memory consumption was 116.3MB. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 281.0MB. Free memory was 193.1MB in the beginning and 192.1MB in the end (delta: 1.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()=18482772870728515581, 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]=257, 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: 7.5s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 368 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 311 mSDsluCounter, 3216 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2701 mSDsCounter, 259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3364 IncrementalHoareTripleChecker+Invalid, 3623 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 259 mSolverCounterUnsat, 515 mSDtfsCounter, 3364 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.1s 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.8s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 1732 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 [2022-07-22 22:22:21,402 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-?-791161d [2022-07-22 22:22:23,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 22:22:23,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 22:22:23,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 22:22:23,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 22:22:23,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 22:22:23,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 22:22:23,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 22:22:23,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 22:22:23,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 22:22:23,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 22:22:23,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 22:22:23,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 22:22:23,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 22:22:23,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 22:22:23,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 22:22:23,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 22:22:23,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 22:22:23,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 22:22:23,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 22:22:23,739 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 22:22:23,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 22:22:23,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 22:22:23,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 22:22:23,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 22:22:23,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 22:22:23,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 22:22:23,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 22:22:23,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 22:22:23,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 22:22:23,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 22:22:23,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 22:22:23,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 22:22:23,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 22:22:23,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 22:22:23,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 22:22:23,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 22:22:23,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 22:22:23,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 22:22:23,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 22:22:23,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 22:22:23,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 22:22:23,768 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-22 22:22:23,801 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 22:22:23,802 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 22:22:23,802 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 22:22:23,802 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 22:22:23,803 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 22:22:23,803 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 22:22:23,804 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 22:22:23,804 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 22:22:23,804 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 22:22:23,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 22:22:23,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 22:22:23,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 22:22:23,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 22:22:23,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 22:22:23,806 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 22:22:23,812 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 22:22:23,812 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 22:22:23,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 22:22:23,812 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 22:22:23,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 22:22:23,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 22:22:23,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 22:22:23,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 22:22:23,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:22:23,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 22:22:23,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 22:22:23,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 22:22:23,814 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 22:22:23,814 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 22:22:23,814 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 22:22:23,815 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 22:22:23,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 22:22:23,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 22:22:23,815 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 [2022-07-22 22:22:24,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 22:22:24,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 22:22:24,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 22:22:24,134 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 22:22:24,136 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 22:22:24,137 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 [2022-07-22 22:22:24,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb9abf8c/71705f3207dc4fd584d87f610bf5ae5c/FLAG3c556c0ac [2022-07-22 22:22:24,914 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 22:22:24,915 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2022-07-22 22:22:24,956 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb9abf8c/71705f3207dc4fd584d87f610bf5ae5c/FLAG3c556c0ac [2022-07-22 22:22:25,015 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb9abf8c/71705f3207dc4fd584d87f610bf5ae5c [2022-07-22 22:22:25,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 22:22:25,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 22:22:25,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 22:22:25,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 22:22:25,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 22:22:25,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:22:25" (1/1) ... [2022-07-22 22:22:25,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2872dc3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:22:25, skipping insertion in model container [2022-07-22 22:22:25,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:22:25" (1/1) ... [2022-07-22 22:22:25,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 22:22:25,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 22:22:25,430 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] [2022-07-22 22:22:25,444 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] [2022-07-22 22:22:26,522 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:26,523 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:26,525 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:26,527 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:26,528 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:26,538 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:26,542 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:26,544 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:26,545 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:22:26,965 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:22:26,966 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:22:26,967 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:22:26,967 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:22:26,969 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:22:26,969 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:22:26,970 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:22:26,973 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:22:26,974 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:22:26,977 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:22:27,120 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:22:27,133 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.ArithmeticException: BigInteger out of int range at java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.checkIfNecessaryMemoryModelAdaption(CHandler.java:1009) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.result.ExpressionResultTransformer.transformDispatchDecaySwitchRexBoolToInt(ExpressionResultTransformer.java:177) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallGivenNameAndArguments(FunctionHandler.java:675) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallExpression(FunctionHandler.java:509) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1454) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1397) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 22:22:27,138 INFO L158 Benchmark]: Toolchain (without parser) took 2118.79ms. Allocated memory was 52.4MB in the beginning and 75.5MB in the end (delta: 23.1MB). Free memory was 28.8MB in the beginning and 43.1MB in the end (delta: -14.2MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2022-07-22 22:22:27,139 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 52.4MB. Free memory was 34.3MB in the beginning and 34.2MB in the end (delta: 38.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 22:22:27,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2115.52ms. Allocated memory was 52.4MB in the beginning and 75.5MB in the end (delta: 23.1MB). Free memory was 28.7MB in the beginning and 43.1MB in the end (delta: -14.4MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2022-07-22 22:22:27,141 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 52.4MB. Free memory was 34.3MB in the beginning and 34.2MB in the end (delta: 38.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2115.52ms. Allocated memory was 52.4MB in the beginning and 75.5MB in the end (delta: 23.1MB). Free memory was 28.7MB in the beginning and 43.1MB in the end (delta: -14.4MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: ArithmeticException: BigInteger out of int range: java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range