./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 6c24879c 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-?-6c24879 [2022-07-12 11:05:04,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:05:04,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:05:04,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:05:04,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:05:04,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:05:04,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:05:04,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:05:04,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:05:04,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:05:04,988 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:05:04,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:05:04,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:05:04,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:05:04,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:05:04,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:05:04,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:05:04,997 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:05:04,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:05:05,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:05:05,005 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:05:05,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:05:05,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:05:05,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:05:05,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:05:05,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:05:05,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:05:05,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:05:05,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:05:05,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:05:05,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:05:05,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:05:05,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:05:05,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:05:05,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:05:05,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:05:05,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:05:05,022 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:05:05,022 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:05:05,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:05:05,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:05:05,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:05:05,026 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:05:05,055 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:05:05,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:05:05,056 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:05:05,056 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:05:05,057 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:05:05,057 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:05:05,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:05:05,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:05:05,058 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:05:05,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:05:05,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:05:05,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:05:05,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:05:05,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:05:05,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:05:05,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:05:05,060 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:05:05,060 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:05:05,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:05:05,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:05:05,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:05:05,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:05:05,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:05:05,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:05:05,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:05:05,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:05:05,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:05:05,062 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:05:05,063 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:05:05,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:05:05,063 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-12 11:05:05,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:05:05,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:05:05,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:05:05,288 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:05:05,288 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:05:05,289 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-12 11:05:05,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d832b59b6/9239a4b12fb64778bba05443b75e79f9/FLAG694b30aae [2022-07-12 11:05:06,148 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:05:06,149 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-12 11:05:06,178 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d832b59b6/9239a4b12fb64778bba05443b75e79f9/FLAG694b30aae [2022-07-12 11:05:06,320 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d832b59b6/9239a4b12fb64778bba05443b75e79f9 [2022-07-12 11:05:06,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:05:06,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:05:06,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:05:06,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:05:06,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:05:06,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:05:06" (1/1) ... [2022-07-12 11:05:06,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52bc24b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:06, skipping insertion in model container [2022-07-12 11:05:06,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:05:06" (1/1) ... [2022-07-12 11:05:06,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:05:06,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:05:06,715 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-12 11:05:06,722 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-12 11:05:07,484 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:07,489 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:07,489 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:07,490 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:07,490 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:07,500 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:07,506 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:07,507 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:07,509 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:07,830 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:05:07,832 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:05:07,832 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:05:07,834 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:05:07,837 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:05:07,842 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:05:07,842 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:05:07,843 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:05:07,845 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:05:07,846 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:05:08,017 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:05:08,112 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,112 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,322 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,323 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,337 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,338 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,343 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,344 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,359 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,360 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,361 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,361 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,362 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,362 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,363 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:05:08,458 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:05:08,479 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-12 11:05:08,480 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-12 11:05:08,523 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,523 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,524 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,524 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,524 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,529 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,529 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,530 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,530 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,555 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:05:08,556 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:05:08,557 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:05:08,557 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:05:08,558 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:05:08,558 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:05:08,558 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:05:08,559 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:05:08,559 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:05:08,559 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:05:08,573 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:05:08,628 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,630 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,688 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,688 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,694 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,695 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,698 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,698 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,705 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,705 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,706 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,706 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,706 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,707 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,707 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:08,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:05:08,975 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:05:08,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:08 WrapperNode [2022-07-12 11:05:08,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:05:08,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:05:08,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:05:08,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:05:08,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:08" (1/1) ... [2022-07-12 11:05:09,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:08" (1/1) ... [2022-07-12 11:05:09,216 INFO L137 Inliner]: procedures = 768, calls = 3253, calls flagged for inlining = 78, calls inlined = 5, statements flattened = 337 [2022-07-12 11:05:09,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:05:09,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:05:09,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:05:09,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:05:09,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:08" (1/1) ... [2022-07-12 11:05:09,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:08" (1/1) ... [2022-07-12 11:05:09,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:08" (1/1) ... [2022-07-12 11:05:09,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:08" (1/1) ... [2022-07-12 11:05:09,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:08" (1/1) ... [2022-07-12 11:05:09,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:08" (1/1) ... [2022-07-12 11:05:09,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:08" (1/1) ... [2022-07-12 11:05:09,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:05:09,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:05:09,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:05:09,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:05:09,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:08" (1/1) ... [2022-07-12 11:05:09,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:05:09,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:05:09,317 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-12 11:05:09,340 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-12 11:05:09,355 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 11:05:09,355 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 11:05:09,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:05:09,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 11:05:09,356 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 11:05:09,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:05:09,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:05:09,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:05:09,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:05:09,357 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 11:05:09,357 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 11:05:09,357 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 11:05:09,357 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 11:05:09,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:05:09,357 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 11:05:09,358 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 11:05:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2022-07-12 11:05:09,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2022-07-12 11:05:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2022-07-12 11:05:09,358 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2022-07-12 11:05:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:05:09,623 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:05:09,624 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:05:09,913 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2022-07-12 11:05:09,929 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:05:09,935 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:05:09,935 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 11:05:09,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:05:09 BoogieIcfgContainer [2022-07-12 11:05:09,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:05:09,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:05:09,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:05:09,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:05:09,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:05:06" (1/3) ... [2022-07-12 11:05:09,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60958c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:05:09, skipping insertion in model container [2022-07-12 11:05:09,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:08" (2/3) ... [2022-07-12 11:05:09,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60958c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:05:09, skipping insertion in model container [2022-07-12 11:05:09,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:05:09" (3/3) ... [2022-07-12 11:05:09,943 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2022-07-12 11:05:09,954 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:05:09,955 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:05:09,997 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:05:10,002 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@2294e431, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4adad0f7 [2022-07-12 11:05:10,002 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:05:10,008 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-12 11:05:10,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-12 11:05:10,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:10,017 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-12 11:05:10,018 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:10,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:10,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1163022186, now seen corresponding path program 1 times [2022-07-12 11:05:10,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:10,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643314950] [2022-07-12 11:05:10,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:10,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:10,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:10,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:10,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:10,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:05:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:10,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:10,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:05:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:10,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:05:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:10,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:05:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:10,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:05:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:10,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:05:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:10,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:05:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:10,625 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-12 11:05:10,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:10,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643314950] [2022-07-12 11:05:10,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643314950] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:05:10,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:05:10,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 11:05:10,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624280017] [2022-07-12 11:05:10,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:05:10,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:05:10,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:10,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:05:10,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:05:10,662 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-12 11:05:10,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:10,811 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2022-07-12 11:05:10,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:05:10,813 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-12 11:05:10,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:10,819 INFO L225 Difference]: With dead ends: 139 [2022-07-12 11:05:10,820 INFO L226 Difference]: Without dead ends: 65 [2022-07-12 11:05:10,823 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-12 11:05:10,825 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-12 11:05:10,826 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-12 11:05:10,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-12 11:05:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-07-12 11:05:10,857 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-12 11:05:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-07-12 11:05:10,860 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2022-07-12 11:05:10,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:10,861 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-07-12 11:05:10,861 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-12 11:05:10,862 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-07-12 11:05:10,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-12 11:05:10,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:10,864 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-12 11:05:10,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:05:10,865 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:10,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:10,865 INFO L85 PathProgramCache]: Analyzing trace with hash -447828983, now seen corresponding path program 1 times [2022-07-12 11:05:10,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:10,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407053941] [2022-07-12 11:05:10,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:10,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:11,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:11,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:11,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:11,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:05:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:11,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:11,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:05:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:11,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:05:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:11,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:05:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:11,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:05:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:11,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:05:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:11,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:05:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:11,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:05:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:11,380 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-12 11:05:11,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:11,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407053941] [2022-07-12 11:05:11,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407053941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:05:11,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:05:11,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 11:05:11,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353037680] [2022-07-12 11:05:11,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:05:11,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 11:05:11,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:11,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 11:05:11,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:05:11,384 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-12 11:05:11,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:11,753 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2022-07-12 11:05:11,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 11:05:11,754 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-12 11:05:11,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:11,757 INFO L225 Difference]: With dead ends: 89 [2022-07-12 11:05:11,758 INFO L226 Difference]: Without dead ends: 65 [2022-07-12 11:05:11,759 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-12 11:05:11,764 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-12 11:05:11,764 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-12 11:05:11,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-12 11:05:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-07-12 11:05:11,781 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-12 11:05:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2022-07-12 11:05:11,784 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 70 [2022-07-12 11:05:11,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:11,785 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2022-07-12 11:05:11,788 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-12 11:05:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2022-07-12 11:05:11,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-12 11:05:11,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:11,798 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-12 11:05:11,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 11:05:11,799 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:11,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:11,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1505925942, now seen corresponding path program 1 times [2022-07-12 11:05:11,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:11,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100287215] [2022-07-12 11:05:11,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:11,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:11,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:12,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:12,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:12,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:05:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:12,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:12,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:05:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:12,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:05:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:12,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:05:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:12,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:05:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:12,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:05:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:12,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:05:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:12,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:05:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:12,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 11:05:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:12,223 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-12 11:05:12,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:12,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100287215] [2022-07-12 11:05:12,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100287215] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:05:12,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:05:12,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-12 11:05:12,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289676913] [2022-07-12 11:05:12,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:05:12,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 11:05:12,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:12,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 11:05:12,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:05:12,226 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-12 11:05:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:12,767 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-07-12 11:05:12,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 11:05:12,768 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-12 11:05:12,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:12,769 INFO L225 Difference]: With dead ends: 94 [2022-07-12 11:05:12,769 INFO L226 Difference]: Without dead ends: 92 [2022-07-12 11:05:12,770 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-12 11:05:12,770 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-12 11:05:12,771 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-12 11:05:12,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-12 11:05:12,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2022-07-12 11:05:12,780 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-12 11:05:12,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2022-07-12 11:05:12,781 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 75 [2022-07-12 11:05:12,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:12,782 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2022-07-12 11:05:12,782 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-12 11:05:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2022-07-12 11:05:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-12 11:05:12,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:12,783 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-12 11:05:12,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 11:05:12,784 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:12,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:12,784 INFO L85 PathProgramCache]: Analyzing trace with hash -892933696, now seen corresponding path program 1 times [2022-07-12 11:05:12,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:12,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912023876] [2022-07-12 11:05:12,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:12,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:05:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:05:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:05:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:05:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:05:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:05:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:05:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:05:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 11:05:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:05:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,263 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-12 11:05:13,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:13,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912023876] [2022-07-12 11:05:13,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912023876] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:05:13,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:05:13,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 11:05:13,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201520990] [2022-07-12 11:05:13,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:05:13,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 11:05:13,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:13,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 11:05:13,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:05:13,277 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-12 11:05:13,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:13,731 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2022-07-12 11:05:13,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 11:05:13,732 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-12 11:05:13,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:13,733 INFO L225 Difference]: With dead ends: 98 [2022-07-12 11:05:13,733 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 11:05:13,733 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-12 11:05:13,734 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:05:13,734 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.3s Time] [2022-07-12 11:05:13,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 11:05:13,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-07-12 11:05:13,742 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-12 11:05:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2022-07-12 11:05:13,761 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 83 [2022-07-12 11:05:13,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:13,762 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2022-07-12 11:05:13,762 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-12 11:05:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2022-07-12 11:05:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 11:05:13,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:13,764 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-12 11:05:13,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 11:05:13,764 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:13,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:13,765 INFO L85 PathProgramCache]: Analyzing trace with hash 829878033, now seen corresponding path program 1 times [2022-07-12 11:05:13,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:13,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820952162] [2022-07-12 11:05:13,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:13,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:05:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:13,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:05:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:14,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:05:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:14,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 11:05:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:14,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:14,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:14,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:05:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:14,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:14,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:05:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:14,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:05:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:14,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:05:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:14,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:05:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:14,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:05:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:14,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:05:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:14,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 11:05:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:14,206 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-12 11:05:14,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:14,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820952162] [2022-07-12 11:05:14,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820952162] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:05:14,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:05:14,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 11:05:14,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72334264] [2022-07-12 11:05:14,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:05:14,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 11:05:14,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:14,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 11:05:14,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:05:14,209 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-12 11:05:14,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:14,676 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2022-07-12 11:05:14,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 11:05:14,676 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-12 11:05:14,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:14,678 INFO L225 Difference]: With dead ends: 102 [2022-07-12 11:05:14,678 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 11:05:14,678 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-12 11:05:14,679 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.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:05:14,679 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.4s Time] [2022-07-12 11:05:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 11:05:14,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2022-07-12 11:05:14,687 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-12 11:05:14,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2022-07-12 11:05:14,692 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 107 [2022-07-12 11:05:14,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:14,694 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2022-07-12 11:05:14,694 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-12 11:05:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2022-07-12 11:05:14,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 11:05:14,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:14,696 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-12 11:05:14,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 11:05:14,697 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:14,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:14,697 INFO L85 PathProgramCache]: Analyzing trace with hash 265370887, now seen corresponding path program 1 times [2022-07-12 11:05:14,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:14,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487560416] [2022-07-12 11:05:14,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:14,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:14,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:05:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:05:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:05:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 11:05:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:05:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:05:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:05:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:05:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:05:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:05:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:05:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 11:05:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 11:05:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,282 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-12 11:05:15,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:15,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487560416] [2022-07-12 11:05:15,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487560416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:05:15,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:05:15,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 11:05:15,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378517819] [2022-07-12 11:05:15,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:05:15,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 11:05:15,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:15,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 11:05:15,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:05:15,284 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-12 11:05:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:15,625 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2022-07-12 11:05:15,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 11:05:15,626 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-12 11:05:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:15,628 INFO L225 Difference]: With dead ends: 100 [2022-07-12 11:05:15,628 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 11:05:15,629 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-12 11:05:15,629 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-12 11:05:15,629 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-12 11:05:15,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 11:05:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-07-12 11:05:15,636 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-12 11:05:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-07-12 11:05:15,637 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 115 [2022-07-12 11:05:15,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:15,638 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-07-12 11:05:15,638 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-12 11:05:15,638 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-07-12 11:05:15,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 11:05:15,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:15,639 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-12 11:05:15,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 11:05:15,640 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:15,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:15,640 INFO L85 PathProgramCache]: Analyzing trace with hash -565706850, now seen corresponding path program 1 times [2022-07-12 11:05:15,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:15,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065078000] [2022-07-12 11:05:15,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:15,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:15,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:16,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:16,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:16,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:05:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:16,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:16,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:05:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:16,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:05:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:16,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:05:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:16,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:05:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:16,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:05:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:16,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:05:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:16,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:05:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:16,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 11:05:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:16,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:05:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:16,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:05:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:16,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:05:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:16,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:05:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:16,221 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-12 11:05:16,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:16,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065078000] [2022-07-12 11:05:16,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065078000] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:05:16,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:05:16,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 11:05:16,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899688091] [2022-07-12 11:05:16,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:05:16,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 11:05:16,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:16,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 11:05:16,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:05:16,224 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-12 11:05:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:16,662 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2022-07-12 11:05:16,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 11:05:16,662 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-12 11:05:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:16,664 INFO L225 Difference]: With dead ends: 102 [2022-07-12 11:05:16,664 INFO L226 Difference]: Without dead ends: 71 [2022-07-12 11:05:16,664 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-12 11:05:16,665 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-12 11:05:16,665 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-12 11:05:16,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-12 11:05:16,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-07-12 11:05:16,674 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-12 11:05:16,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-07-12 11:05:16,675 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 100 [2022-07-12 11:05:16,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:16,675 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-07-12 11:05:16,676 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-12 11:05:16,676 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-07-12 11:05:16,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-12 11:05:16,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:16,678 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-12 11:05:16,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 11:05:16,678 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:16,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:16,679 INFO L85 PathProgramCache]: Analyzing trace with hash -549207241, now seen corresponding path program 1 times [2022-07-12 11:05:16,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:16,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932226431] [2022-07-12 11:05:16,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:16,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 11:05:16,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 11:05:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 11:05:17,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 11:05:17,105 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 11:05:17,106 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 11:05:17,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 11:05:17,110 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:05:17,113 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 11:05:17,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 11:05:17 BoogieIcfgContainer [2022-07-12 11:05:17,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 11:05:17,169 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 11:05:17,169 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 11:05:17,169 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 11:05:17,170 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:05:09" (3/4) ... [2022-07-12 11:05:17,172 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 11:05:17,172 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 11:05:17,173 INFO L158 Benchmark]: Toolchain (without parser) took 10849.10ms. Allocated memory was 111.1MB in the beginning and 295.7MB in the end (delta: 184.5MB). Free memory was 82.2MB in the beginning and 112.0MB in the end (delta: -29.8MB). Peak memory consumption was 154.6MB. Max. memory is 16.1GB. [2022-07-12 11:05:17,173 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory was 44.7MB in the beginning and 44.6MB in the end (delta: 39.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:05:17,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2651.71ms. Allocated memory was 111.1MB in the beginning and 192.9MB in the end (delta: 81.8MB). Free memory was 82.2MB in the beginning and 122.6MB in the end (delta: -40.4MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. [2022-07-12 11:05:17,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 239.56ms. Allocated memory is still 192.9MB. Free memory was 122.6MB in the beginning and 111.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 11:05:17,174 INFO L158 Benchmark]: Boogie Preprocessor took 68.07ms. Allocated memory is still 192.9MB. Free memory was 111.1MB in the beginning and 106.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 11:05:17,174 INFO L158 Benchmark]: RCFGBuilder took 647.83ms. Allocated memory is still 192.9MB. Free memory was 106.9MB in the beginning and 123.4MB in the end (delta: -16.5MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2022-07-12 11:05:17,175 INFO L158 Benchmark]: TraceAbstraction took 7230.38ms. Allocated memory was 192.9MB in the beginning and 295.7MB in the end (delta: 102.8MB). Free memory was 122.4MB in the beginning and 113.1MB in the end (delta: 9.3MB). Peak memory consumption was 114.1MB. Max. memory is 16.1GB. [2022-07-12 11:05:17,175 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 295.7MB. Free memory was 113.1MB in the beginning and 112.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:05:17,177 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory was 44.7MB in the beginning and 44.6MB in the end (delta: 39.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2651.71ms. Allocated memory was 111.1MB in the beginning and 192.9MB in the end (delta: 81.8MB). Free memory was 82.2MB in the beginning and 122.6MB in the end (delta: -40.4MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 239.56ms. Allocated memory is still 192.9MB. Free memory was 122.6MB in the beginning and 111.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.07ms. Allocated memory is still 192.9MB. Free memory was 111.1MB in the beginning and 106.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 647.83ms. Allocated memory is still 192.9MB. Free memory was 106.9MB in the beginning and 123.4MB in the end (delta: -16.5MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7230.38ms. Allocated memory was 192.9MB in the beginning and 295.7MB in the end (delta: 102.8MB). Free memory was 122.4MB in the beginning and 113.1MB in the end (delta: 9.3MB). Peak memory consumption was 114.1MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 295.7MB. Free memory was 113.1MB in the beginning and 112.0MB 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.1s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, 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.0s 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.7s SatisfiabilityAnalysisTime, 2.9s 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-12 11:05:17,215 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-?-6c24879 [2022-07-12 11:05:19,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:05:19,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:05:19,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:05:19,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:05:19,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:05:19,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:05:19,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:05:19,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:05:19,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:05:19,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:05:19,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:05:19,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:05:19,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:05:19,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:05:19,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:05:19,094 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:05:19,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:05:19,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:05:19,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:05:19,099 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:05:19,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:05:19,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:05:19,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:05:19,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:05:19,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:05:19,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:05:19,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:05:19,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:05:19,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:05:19,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:05:19,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:05:19,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:05:19,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:05:19,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:05:19,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:05:19,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:05:19,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:05:19,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:05:19,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:05:19,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:05:19,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:05:19,122 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-12 11:05:19,141 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:05:19,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:05:19,142 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:05:19,142 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:05:19,143 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:05:19,143 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:05:19,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:05:19,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:05:19,144 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:05:19,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:05:19,144 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:05:19,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:05:19,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:05:19,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:05:19,145 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 11:05:19,146 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 11:05:19,146 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 11:05:19,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:05:19,146 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:05:19,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:05:19,147 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:05:19,147 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:05:19,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:05:19,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:05:19,148 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:05:19,148 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:05:19,148 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:05:19,148 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 11:05:19,149 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 11:05:19,149 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:05:19,149 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:05:19,149 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:05:19,150 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 11:05:19,150 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-12 11:05:19,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:05:19,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:05:19,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:05:19,435 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:05:19,436 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:05:19,437 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-12 11:05:19,489 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a07039c9/674f1557393c42b2af66a8caabd3b021/FLAG049a2b6a4 [2022-07-12 11:05:20,260 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:05:20,261 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-12 11:05:20,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a07039c9/674f1557393c42b2af66a8caabd3b021/FLAG049a2b6a4 [2022-07-12 11:05:20,547 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a07039c9/674f1557393c42b2af66a8caabd3b021 [2022-07-12 11:05:20,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:05:20,551 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:05:20,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:05:20,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:05:20,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:05:20,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:05:20" (1/1) ... [2022-07-12 11:05:20,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d172e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:20, skipping insertion in model container [2022-07-12 11:05:20,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:05:20" (1/1) ... [2022-07-12 11:05:20,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:05:20,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:05:20,990 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-12 11:05:20,998 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-12 11:05:21,768 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:21,768 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:21,769 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:21,769 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:21,770 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:21,790 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:21,791 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:21,793 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:21,793 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:22,140 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:05:22,142 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:05:22,143 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:05:22,146 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:05:22,149 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:05:22,152 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:05:22,153 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:05:22,154 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:05:22,156 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:05:22,158 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:05:22,295 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:05:22,306 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-12 11:05:22,311 INFO L158 Benchmark]: Toolchain (without parser) took 1758.71ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 39.7MB in the beginning and 32.3MB in the end (delta: 7.5MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2022-07-12 11:05:22,311 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 60.8MB. Free memory was 41.4MB in the beginning and 41.3MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:05:22,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1756.68ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 39.6MB in the beginning and 32.3MB in the end (delta: 7.3MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2022-07-12 11:05:22,314 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.18ms. Allocated memory is still 60.8MB. Free memory was 41.4MB in the beginning and 41.3MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1756.68ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 39.6MB in the beginning and 32.3MB in the end (delta: 7.3MB). Peak memory consumption was 24.4MB. 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