./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 eb692b52 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-?-eb692b5 [2022-07-19 22:08:00,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:08:00,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:08:00,930 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:08:00,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:08:00,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:08:00,935 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:08:00,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:08:00,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:08:00,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:08:00,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:08:00,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:08:00,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:08:00,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:08:00,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:08:00,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:08:00,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:08:00,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:08:00,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:08:00,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:08:00,959 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:08:00,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:08:00,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:08:00,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:08:00,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:08:00,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:08:00,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:08:00,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:08:00,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:08:00,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:08:00,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:08:00,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:08:00,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:08:00,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:08:00,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:08:00,972 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:08:00,972 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:08:00,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:08:00,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:08:00,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:08:00,974 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:08:00,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:08:00,976 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 22:08:00,997 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:08:00,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:08:00,997 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:08:00,998 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:08:00,998 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:08:00,998 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:08:00,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:08:00,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:08:00,999 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:08:01,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:08:01,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 22:08:01,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:08:01,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:08:01,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:08:01,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:08:01,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:08:01,001 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:08:01,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:08:01,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:08:01,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:08:01,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:08:01,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:08:01,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:08:01,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:08:01,002 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:08:01,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 22:08:01,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 22:08:01,003 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:08:01,003 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:08:01,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:08:01,003 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-19 22:08:01,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:08:01,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:08:01,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:08:01,227 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:08:01,227 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:08:01,229 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-19 22:08:01,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf2fbced/a55a8c20b4814d7eb1490d1aac665187/FLAG4a92c85a1 [2022-07-19 22:08:01,837 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:08:01,837 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-19 22:08:01,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf2fbced/a55a8c20b4814d7eb1490d1aac665187/FLAG4a92c85a1 [2022-07-19 22:08:02,306 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf2fbced/a55a8c20b4814d7eb1490d1aac665187 [2022-07-19 22:08:02,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:08:02,309 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:08:02,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:08:02,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:08:02,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:08:02,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:08:02" (1/1) ... [2022-07-19 22:08:02,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5588814a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:08:02, skipping insertion in model container [2022-07-19 22:08:02,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:08:02" (1/1) ... [2022-07-19 22:08:02,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:08:02,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:08:02,650 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-19 22:08:02,656 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-19 22:08:03,296 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:03,296 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:03,297 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:03,297 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:03,298 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:03,304 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:03,305 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:03,306 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:03,306 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:03,552 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:08:03,553 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:08:03,554 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:08:03,555 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:08:03,556 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:08:03,556 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:08:03,557 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:08:03,557 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:08:03,557 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:08:03,558 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:08:03,709 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:08:03,773 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:03,774 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:03,951 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:03,952 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:03,979 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:03,980 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:03,987 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:03,987 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,003 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,003 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,004 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,004 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,005 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,006 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,006 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:08:04,082 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 22:08:04,099 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-19 22:08:04,099 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-19 22:08:04,153 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,153 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,153 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,154 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,154 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,156 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,157 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,157 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,157 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,175 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:08:04,175 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:08:04,176 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:08:04,176 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:08:04,177 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:08:04,177 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:08:04,177 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:08:04,177 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:08:04,178 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:08:04,178 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:08:04,189 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:08:04,225 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,226 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,268 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,269 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,277 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,277 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,280 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,281 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,306 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,306 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,307 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,307 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,307 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,308 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,308 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:04,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:08:04,484 INFO L208 MainTranslator]: Completed translation [2022-07-19 22:08:04,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:08:04 WrapperNode [2022-07-19 22:08:04,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 22:08:04,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 22:08:04,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 22:08:04,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 22:08:04,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:08:04" (1/1) ... [2022-07-19 22:08:04,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:08:04" (1/1) ... [2022-07-19 22:08:04,627 INFO L137 Inliner]: procedures = 768, calls = 3253, calls flagged for inlining = 78, calls inlined = 5, statements flattened = 337 [2022-07-19 22:08:04,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 22:08:04,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 22:08:04,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 22:08:04,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 22:08:04,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:08:04" (1/1) ... [2022-07-19 22:08:04,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:08:04" (1/1) ... [2022-07-19 22:08:04,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:08:04" (1/1) ... [2022-07-19 22:08:04,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:08:04" (1/1) ... [2022-07-19 22:08:04,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:08:04" (1/1) ... [2022-07-19 22:08:04,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:08:04" (1/1) ... [2022-07-19 22:08:04,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:08:04" (1/1) ... [2022-07-19 22:08:04,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 22:08:04,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 22:08:04,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 22:08:04,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 22:08:04,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:08:04" (1/1) ... [2022-07-19 22:08:04,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:08:04,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:08:04,728 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-19 22:08:04,749 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-19 22:08:04,753 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-19 22:08:04,754 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-19 22:08:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 22:08:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 22:08:04,754 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 22:08:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 22:08:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 22:08:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 22:08:04,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 22:08:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-19 22:08:04,755 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-19 22:08:04,755 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 22:08:04,755 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 22:08:04,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 22:08:04,756 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-19 22:08:04,756 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-19 22:08:04,756 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2022-07-19 22:08:04,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2022-07-19 22:08:04,756 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2022-07-19 22:08:04,756 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2022-07-19 22:08:04,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 22:08:05,006 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 22:08:05,012 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 22:08:05,223 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2022-07-19 22:08:05,230 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 22:08:05,247 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 22:08:05,247 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 22:08:05,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:08:05 BoogieIcfgContainer [2022-07-19 22:08:05,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 22:08:05,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 22:08:05,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 22:08:05,254 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 22:08:05,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:08:02" (1/3) ... [2022-07-19 22:08:05,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb3621f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:08:05, skipping insertion in model container [2022-07-19 22:08:05,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:08:04" (2/3) ... [2022-07-19 22:08:05,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb3621f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:08:05, skipping insertion in model container [2022-07-19 22:08:05,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:08:05" (3/3) ... [2022-07-19 22:08:05,256 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2022-07-19 22:08:05,267 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 22:08:05,267 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 22:08:05,315 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 22:08:05,324 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@4f98bf94, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1c9a2b84 [2022-07-19 22:08:05,324 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 22:08:05,327 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-19 22:08:05,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-19 22:08:05,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:08:05,336 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-19 22:08:05,338 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:08:05,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:08:05,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1163022186, now seen corresponding path program 1 times [2022-07-19 22:08:05,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:08:05,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034842020] [2022-07-19 22:08:05,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:08:05,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:08:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:05,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:08:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:05,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:08:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:05,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:08:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:05,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:08:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:05,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:08:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:05,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:08:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:05,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:08:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:05,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:08:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:05,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:08:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:05,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:08:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:05,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:08:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:05,822 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-19 22:08:05,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:08:05,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034842020] [2022-07-19 22:08:05,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034842020] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:08:05,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:08:05,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 22:08:05,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90513155] [2022-07-19 22:08:05,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:08:05,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 22:08:05,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:08:05,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 22:08:05,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:08:05,852 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-19 22:08:05,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:08:05,970 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2022-07-19 22:08:05,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 22:08:05,972 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-19 22:08:05,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:08:05,977 INFO L225 Difference]: With dead ends: 139 [2022-07-19 22:08:05,982 INFO L226 Difference]: Without dead ends: 65 [2022-07-19 22:08:05,985 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-19 22:08:05,990 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-19 22:08:05,992 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-19 22:08:06,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-19 22:08:06,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-07-19 22:08:06,036 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-19 22:08:06,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-07-19 22:08:06,041 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2022-07-19 22:08:06,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:08:06,042 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-07-19 22:08:06,043 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-19 22:08:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-07-19 22:08:06,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-19 22:08:06,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:08:06,045 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-19 22:08:06,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 22:08:06,045 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:08:06,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:08:06,046 INFO L85 PathProgramCache]: Analyzing trace with hash -447828983, now seen corresponding path program 1 times [2022-07-19 22:08:06,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:08:06,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351469555] [2022-07-19 22:08:06,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:08:06,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:08:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:06,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:08:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:06,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:08:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:06,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:08:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:06,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:08:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:06,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:08:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:06,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:08:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:06,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:08:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:06,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:08:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:06,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:08:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:06,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:08:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:06,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:08:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:06,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:08:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:06,542 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-19 22:08:06,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:08:06,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351469555] [2022-07-19 22:08:06,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351469555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:08:06,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:08:06,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-19 22:08:06,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705173638] [2022-07-19 22:08:06,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:08:06,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 22:08:06,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:08:06,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 22:08:06,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:08:06,545 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-19 22:08:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:08:06,840 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2022-07-19 22:08:06,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 22:08:06,840 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-19 22:08:06,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:08:06,842 INFO L225 Difference]: With dead ends: 89 [2022-07-19 22:08:06,842 INFO L226 Difference]: Without dead ends: 65 [2022-07-19 22:08:06,843 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-19 22:08:06,846 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.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:08:06,846 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.2s Time] [2022-07-19 22:08:06,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-19 22:08:06,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-07-19 22:08:06,859 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-19 22:08:06,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2022-07-19 22:08:06,863 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 70 [2022-07-19 22:08:06,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:08:06,866 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2022-07-19 22:08:06,866 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-19 22:08:06,866 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2022-07-19 22:08:06,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-19 22:08:06,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:08:06,871 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-19 22:08:06,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 22:08:06,872 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:08:06,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:08:06,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1505925942, now seen corresponding path program 1 times [2022-07-19 22:08:06,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:08:06,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250367953] [2022-07-19 22:08:06,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:08:06,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:08:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:07,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:08:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:07,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:08:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:07,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:08:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:07,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:08:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:07,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:08:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:07,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:08:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:07,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:08:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:07,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:08:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:07,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:08:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:07,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:08:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:07,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:08:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:07,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:08:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:07,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 22:08:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:07,232 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-19 22:08:07,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:08:07,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250367953] [2022-07-19 22:08:07,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250367953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:08:07,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:08:07,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-19 22:08:07,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302202002] [2022-07-19 22:08:07,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:08:07,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 22:08:07,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:08:07,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 22:08:07,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2022-07-19 22:08:07,235 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-19 22:08:07,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:08:07,684 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-07-19 22:08:07,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 22:08:07,684 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-19 22:08:07,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:08:07,687 INFO L225 Difference]: With dead ends: 94 [2022-07-19 22:08:07,688 INFO L226 Difference]: Without dead ends: 92 [2022-07-19 22:08:07,688 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-19 22:08:07,690 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.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:08:07,691 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.3s Time] [2022-07-19 22:08:07,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-19 22:08:07,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2022-07-19 22:08:07,707 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-19 22:08:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2022-07-19 22:08:07,709 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 75 [2022-07-19 22:08:07,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:08:07,710 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2022-07-19 22:08:07,710 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-19 22:08:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2022-07-19 22:08:07,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-19 22:08:07,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:08:07,712 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-19 22:08:07,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 22:08:07,713 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:08:07,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:08:07,713 INFO L85 PathProgramCache]: Analyzing trace with hash -892933696, now seen corresponding path program 1 times [2022-07-19 22:08:07,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:08:07,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865592091] [2022-07-19 22:08:07,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:08:07,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:08:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:07,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:08:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:08:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:08:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:08:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:08:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:08:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:08:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:08:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:08:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:08:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:08:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:08:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 22:08:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:08:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,113 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-19 22:08:08,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:08:08,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865592091] [2022-07-19 22:08:08,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865592091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:08:08,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:08:08,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 22:08:08,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478322384] [2022-07-19 22:08:08,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:08:08,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 22:08:08,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:08:08,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 22:08:08,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:08:08,116 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-19 22:08:08,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:08:08,497 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2022-07-19 22:08:08,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 22:08:08,497 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-19 22:08:08,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:08:08,498 INFO L225 Difference]: With dead ends: 98 [2022-07-19 22:08:08,498 INFO L226 Difference]: Without dead ends: 96 [2022-07-19 22:08:08,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:08:08,499 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 59 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-19 22:08:08,499 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-19 22:08:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-19 22:08:08,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-07-19 22:08:08,505 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-19 22:08:08,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2022-07-19 22:08:08,506 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 83 [2022-07-19 22:08:08,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:08:08,506 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2022-07-19 22:08:08,506 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-19 22:08:08,506 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2022-07-19 22:08:08,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-19 22:08:08,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:08:08,511 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-19 22:08:08,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 22:08:08,512 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:08:08,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:08:08,512 INFO L85 PathProgramCache]: Analyzing trace with hash 829878033, now seen corresponding path program 1 times [2022-07-19 22:08:08,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:08:08,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631449137] [2022-07-19 22:08:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:08:08,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:08:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:08:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:08:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:08:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:08:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:08:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:08:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:08:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 22:08:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:08:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:08:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:08:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:08:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:08:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 22:08:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 22:08:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:08:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 22:08:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:08:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 22:08:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:08,855 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-19 22:08:08,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:08:08,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631449137] [2022-07-19 22:08:08,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631449137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:08:08,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:08:08,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-19 22:08:08,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561982714] [2022-07-19 22:08:08,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:08:08,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 22:08:08,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:08:08,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 22:08:08,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:08:08,858 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-19 22:08:09,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:08:09,255 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2022-07-19 22:08:09,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 22:08:09,256 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-19 22:08:09,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:08:09,259 INFO L225 Difference]: With dead ends: 102 [2022-07-19 22:08:09,259 INFO L226 Difference]: Without dead ends: 100 [2022-07-19 22:08:09,260 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-19 22:08:09,261 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 31 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:08:09,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 817 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 22:08:09,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-19 22:08:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2022-07-19 22:08:09,282 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-19 22:08:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2022-07-19 22:08:09,284 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 107 [2022-07-19 22:08:09,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:08:09,285 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2022-07-19 22:08:09,286 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-19 22:08:09,286 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2022-07-19 22:08:09,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-19 22:08:09,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:08:09,287 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-19 22:08:09,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 22:08:09,288 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:08:09,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:08:09,288 INFO L85 PathProgramCache]: Analyzing trace with hash 265370887, now seen corresponding path program 1 times [2022-07-19 22:08:09,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:08:09,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026221350] [2022-07-19 22:08:09,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:08:09,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:08:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:08:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:08:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:08:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:08:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:08:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:08:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:08:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 22:08:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:08:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:08:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:08:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:08:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:08:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 22:08:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 22:08:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:08:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 22:08:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:08:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 22:08:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 22:08:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:09,712 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-19 22:08:09,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:08:09,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026221350] [2022-07-19 22:08:09,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026221350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:08:09,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:08:09,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-19 22:08:09,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259814729] [2022-07-19 22:08:09,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:08:09,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 22:08:09,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:08:09,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 22:08:09,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:08:09,715 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-19 22:08:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:08:10,011 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2022-07-19 22:08:10,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 22:08:10,011 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-19 22:08:10,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:08:10,013 INFO L225 Difference]: With dead ends: 100 [2022-07-19 22:08:10,013 INFO L226 Difference]: Without dead ends: 96 [2022-07-19 22:08:10,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-07-19 22:08:10,013 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.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:08:10,014 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.2s Time] [2022-07-19 22:08:10,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-19 22:08:10,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-07-19 22:08:10,018 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-19 22:08:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-07-19 22:08:10,018 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 115 [2022-07-19 22:08:10,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:08:10,019 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-07-19 22:08:10,019 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-19 22:08:10,019 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-07-19 22:08:10,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-19 22:08:10,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:08:10,020 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-19 22:08:10,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 22:08:10,020 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:08:10,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:08:10,021 INFO L85 PathProgramCache]: Analyzing trace with hash -565706850, now seen corresponding path program 1 times [2022-07-19 22:08:10,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:08:10,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302285359] [2022-07-19 22:08:10,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:08:10,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:08:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:10,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:08:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:10,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:08:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:10,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:08:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:10,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:08:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:10,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:08:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:10,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:08:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:10,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:08:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:10,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:08:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:10,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:08:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:10,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:08:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:10,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:08:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:10,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:08:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:10,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 22:08:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:10,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:08:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:10,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 22:08:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:10,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:08:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:10,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 22:08:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:08:10,436 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-19 22:08:10,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:08:10,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302285359] [2022-07-19 22:08:10,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302285359] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:08:10,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:08:10,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-19 22:08:10,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712259255] [2022-07-19 22:08:10,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:08:10,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 22:08:10,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:08:10,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 22:08:10,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:08:10,439 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-19 22:08:10,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:08:10,814 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2022-07-19 22:08:10,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 22:08:10,814 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-19 22:08:10,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:08:10,815 INFO L225 Difference]: With dead ends: 102 [2022-07-19 22:08:10,815 INFO L226 Difference]: Without dead ends: 71 [2022-07-19 22:08:10,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-07-19 22:08:10,816 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.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:08:10,816 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.3s Time] [2022-07-19 22:08:10,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-19 22:08:10,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-07-19 22:08:10,820 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-19 22:08:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-07-19 22:08:10,821 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 100 [2022-07-19 22:08:10,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:08:10,821 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-07-19 22:08:10,821 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-19 22:08:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-07-19 22:08:10,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-19 22:08:10,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:08:10,822 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-19 22:08:10,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 22:08:10,822 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:08:10,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:08:10,823 INFO L85 PathProgramCache]: Analyzing trace with hash -549207241, now seen corresponding path program 1 times [2022-07-19 22:08:10,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:08:10,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480595160] [2022-07-19 22:08:10,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:08:10,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:08:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 22:08:10,953 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 22:08:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 22:08:11,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 22:08:11,118 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 22:08:11,119 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 22:08:11,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 22:08:11,122 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:08:11,125 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 22:08:11,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:08:11 BoogieIcfgContainer [2022-07-19 22:08:11,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 22:08:11,191 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 22:08:11,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 22:08:11,192 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 22:08:11,192 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:08:05" (3/4) ... [2022-07-19 22:08:11,194 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 22:08:11,194 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 22:08:11,194 INFO L158 Benchmark]: Toolchain (without parser) took 8885.54ms. Allocated memory was 94.4MB in the beginning and 276.8MB in the end (delta: 182.5MB). Free memory was 52.7MB in the beginning and 195.7MB in the end (delta: -143.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-07-19 22:08:11,195 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory was 51.5MB in the beginning and 51.4MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 22:08:11,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2173.74ms. Allocated memory was 94.4MB in the beginning and 182.5MB in the end (delta: 88.1MB). Free memory was 52.5MB in the beginning and 87.5MB in the end (delta: -35.0MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. [2022-07-19 22:08:11,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 144.77ms. Allocated memory is still 182.5MB. Free memory was 87.5MB in the beginning and 76.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 22:08:11,196 INFO L158 Benchmark]: Boogie Preprocessor took 63.92ms. Allocated memory is still 182.5MB. Free memory was 76.1MB in the beginning and 71.7MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 22:08:11,196 INFO L158 Benchmark]: RCFGBuilder took 553.71ms. Allocated memory is still 182.5MB. Free memory was 71.7MB in the beginning and 92.4MB in the end (delta: -20.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 22:08:11,196 INFO L158 Benchmark]: TraceAbstraction took 5939.82ms. Allocated memory was 182.5MB in the beginning and 276.8MB in the end (delta: 94.4MB). Free memory was 91.4MB in the beginning and 195.7MB in the end (delta: -104.4MB). Peak memory consumption was 141.0MB. Max. memory is 16.1GB. [2022-07-19 22:08:11,196 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 276.8MB. Free memory is still 195.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 22:08:11,198 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 94.4MB. Free memory was 51.5MB in the beginning and 51.4MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2173.74ms. Allocated memory was 94.4MB in the beginning and 182.5MB in the end (delta: 88.1MB). Free memory was 52.5MB in the beginning and 87.5MB in the end (delta: -35.0MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 144.77ms. Allocated memory is still 182.5MB. Free memory was 87.5MB in the beginning and 76.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.92ms. Allocated memory is still 182.5MB. Free memory was 76.1MB in the beginning and 71.7MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 553.71ms. Allocated memory is still 182.5MB. Free memory was 71.7MB in the beginning and 92.4MB in the end (delta: -20.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5939.82ms. Allocated memory was 182.5MB in the beginning and 276.8MB in the end (delta: 94.4MB). Free memory was 91.4MB in the beginning and 195.7MB in the end (delta: -104.4MB). Peak memory consumption was 141.0MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 276.8MB. Free memory is still 195.7MB. 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: 5.8s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 368 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 311 mSDsluCounter, 3216 SdHoareTripleChecker+Invalid, 1.4s 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, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s 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-19 22:08:11,240 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-?-eb692b5 [2022-07-19 22:08:12,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:08:12,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:08:12,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:08:12,831 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:08:12,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:08:12,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:08:12,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:08:12,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:08:12,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:08:12,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:08:12,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:08:12,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:08:12,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:08:12,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:08:12,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:08:12,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:08:12,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:08:12,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:08:12,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:08:12,858 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:08:12,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:08:12,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:08:12,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:08:12,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:08:12,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:08:12,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:08:12,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:08:12,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:08:12,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:08:12,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:08:12,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:08:12,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:08:12,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:08:12,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:08:12,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:08:12,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:08:12,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:08:12,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:08:12,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:08:12,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:08:12,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:08:12,878 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-19 22:08:12,912 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:08:12,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:08:12,913 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:08:12,913 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:08:12,913 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:08:12,914 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:08:12,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:08:12,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:08:12,914 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:08:12,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:08:12,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:08:12,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:08:12,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:08:12,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:08:12,916 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 22:08:12,916 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 22:08:12,916 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 22:08:12,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:08:12,916 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:08:12,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:08:12,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:08:12,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:08:12,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:08:12,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:08:12,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:08:12,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:08:12,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:08:12,918 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 22:08:12,918 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 22:08:12,918 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:08:12,918 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:08:12,918 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:08:12,918 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 22:08:12,919 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-19 22:08:13,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:08:13,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:08:13,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:08:13,179 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:08:13,179 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:08:13,180 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-19 22:08:13,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e46e4e84e/c8dd8c30d2b446d8bfd56ad6806c4590/FLAG1baf9d080 [2022-07-19 22:08:13,828 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:08:13,829 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-19 22:08:13,861 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e46e4e84e/c8dd8c30d2b446d8bfd56ad6806c4590/FLAG1baf9d080 [2022-07-19 22:08:14,256 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e46e4e84e/c8dd8c30d2b446d8bfd56ad6806c4590 [2022-07-19 22:08:14,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:08:14,259 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:08:14,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:08:14,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:08:14,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:08:14,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:08:14" (1/1) ... [2022-07-19 22:08:14,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795866f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:08:14, skipping insertion in model container [2022-07-19 22:08:14,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:08:14" (1/1) ... [2022-07-19 22:08:14,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:08:14,355 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:08:14,567 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-19 22:08:14,573 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-19 22:08:15,248 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:15,248 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:15,250 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:15,251 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:15,252 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:15,271 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:15,272 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:15,273 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:15,273 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:08:15,519 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:08:15,520 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:08:15,521 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:08:15,521 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:08:15,522 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:08:15,523 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:08:15,523 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:08:15,523 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:08:15,524 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:08:15,524 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:08:15,630 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:08:15,640 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-19 22:08:15,647 INFO L158 Benchmark]: Toolchain (without parser) took 1387.22ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 25.8MB in the beginning and 30.9MB in the end (delta: -5.0MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2022-07-19 22:08:15,648 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.7MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 22:08:15,649 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1373.06ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 39.9MB in the beginning and 30.9MB in the end (delta: 9.1MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2022-07-19 22:08:15,650 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.7MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1373.06ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 39.9MB in the beginning and 30.9MB in the end (delta: 9.1MB). Peak memory consumption was 24.2MB. 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