./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_new_from_string_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_string_new_from_string_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 618de5120235c3340e11b4958ef07a29ea7e443f67840fe760124caab804e862 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 22:20:28,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:20:28,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:20:28,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:20:28,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:20:28,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:20:28,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:20:28,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:20:28,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:20:28,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:20:28,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:20:28,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:20:28,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:20:28,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:20:28,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:20:28,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:20:28,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:20:28,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:20:28,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:20:28,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:20:28,708 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:20:28,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:20:28,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:20:28,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:20:28,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:20:28,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:20:28,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:20:28,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:20:28,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:20:28,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:20:28,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:20:28,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:20:28,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:20:28,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:20:28,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:20:28,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:20:28,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:20:28,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:20:28,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:20:28,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:20:28,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:20:28,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:20:28,729 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:20:28,755 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:20:28,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:20:28,756 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:20:28,756 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:20:28,757 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:20:28,757 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:20:28,758 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:20:28,758 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:20:28,758 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:20:28,759 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:20:28,759 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 22:20:28,760 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:20:28,760 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:20:28,760 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:20:28,760 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:20:28,760 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:20:28,761 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:20:28,761 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:20:28,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:20:28,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:20:28,761 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:20:28,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:20:28,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:20:28,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:20:28,762 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:20:28,763 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 22:20:28,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 22:20:28,763 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:20:28,763 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:20:28,764 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:20:28,764 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 -> 618de5120235c3340e11b4958ef07a29ea7e443f67840fe760124caab804e862 [2022-07-19 22:20:28,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:20:29,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:20:29,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:20:29,017 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:20:29,018 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:20:29,019 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_new_from_string_harness.i [2022-07-19 22:20:29,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c00faf8e2/fc541c71e48047bfadfbc19085c2b27b/FLAGe2b79cb5d [2022-07-19 22:20:29,812 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:20:29,812 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_new_from_string_harness.i [2022-07-19 22:20:29,855 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c00faf8e2/fc541c71e48047bfadfbc19085c2b27b/FLAGe2b79cb5d [2022-07-19 22:20:30,043 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c00faf8e2/fc541c71e48047bfadfbc19085c2b27b [2022-07-19 22:20:30,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:20:30,047 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:20:30,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:20:30,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:20:30,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:20:30,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:20:30" (1/1) ... [2022-07-19 22:20:30,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@282d6ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:30, skipping insertion in model container [2022-07-19 22:20:30,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:20:30" (1/1) ... [2022-07-19 22:20:30,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:20:30,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:20:30,378 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_string_new_from_string_harness.i[4500,4513] [2022-07-19 22:20:30,385 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_string_new_from_string_harness.i[4560,4573] [2022-07-19 22:20:31,059 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,062 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,063 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,064 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,066 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,079 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,080 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,083 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,084 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,328 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:20:31,329 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:20:31,330 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:20:31,330 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:20:31,332 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:20:31,332 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:20:31,333 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:20:31,333 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:20:31,334 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:20:31,334 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:20:31,433 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:20:31,570 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,582 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:20:31,714 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 22:20:31,735 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_string_new_from_string_harness.i[4500,4513] [2022-07-19 22:20:31,736 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_string_new_from_string_harness.i[4560,4573] [2022-07-19 22:20:31,774 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,780 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,781 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,781 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,782 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,790 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,791 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,792 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,792 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,830 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:20:31,831 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:20:31,832 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:20:31,832 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:20:31,833 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:20:31,833 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:20:31,834 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:20:31,834 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:20:31,834 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:20:31,835 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:20:31,848 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:20:31,920 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,921 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:20:31,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:20:32,115 INFO L208 MainTranslator]: Completed translation [2022-07-19 22:20:32,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:32 WrapperNode [2022-07-19 22:20:32,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 22:20:32,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 22:20:32,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 22:20:32,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 22:20:32,123 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:20:32" (1/1) ... [2022-07-19 22:20:32,226 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:20:32" (1/1) ... [2022-07-19 22:20:32,283 INFO L137 Inliner]: procedures = 690, calls = 2740, calls flagged for inlining = 59, calls inlined = 9, statements flattened = 831 [2022-07-19 22:20:32,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 22:20:32,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 22:20:32,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 22:20:32,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 22:20:32,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:32" (1/1) ... [2022-07-19 22:20:32,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:32" (1/1) ... [2022-07-19 22:20:32,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:32" (1/1) ... [2022-07-19 22:20:32,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:32" (1/1) ... [2022-07-19 22:20:32,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:32" (1/1) ... [2022-07-19 22:20:32,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:32" (1/1) ... [2022-07-19 22:20:32,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:32" (1/1) ... [2022-07-19 22:20:32,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 22:20:32,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 22:20:32,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 22:20:32,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 22:20:32,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:32" (1/1) ... [2022-07-19 22:20:32,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:20:32,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:20:32,412 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:20:32,439 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:20:32,450 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-19 22:20:32,450 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-19 22:20:32,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 22:20:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-19 22:20:32,451 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-19 22:20:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2022-07-19 22:20:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-07-19 22:20:32,452 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-07-19 22:20:32,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-19 22:20:32,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-19 22:20:32,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 22:20:32,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-19 22:20:32,453 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-19 22:20:32,454 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-19 22:20:32,454 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-19 22:20:32,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 22:20:32,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 22:20:32,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 22:20:32,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 22:20:32,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 22:20:32,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 22:20:32,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 22:20:32,455 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-19 22:20:32,455 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-19 22:20:32,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-19 22:20:32,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-19 22:20:32,456 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-07-19 22:20:32,456 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-07-19 22:20:32,456 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 22:20:32,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 22:20:32,457 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-07-19 22:20:32,458 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-07-19 22:20:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 22:20:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-19 22:20:32,458 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-19 22:20:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 22:20:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 22:20:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2022-07-19 22:20:32,459 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2022-07-19 22:20:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-19 22:20:32,459 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-19 22:20:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-19 22:20:32,459 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-19 22:20:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-19 22:20:32,460 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-19 22:20:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 22:20:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2022-07-19 22:20:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_string [2022-07-19 22:20:32,460 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_string [2022-07-19 22:20:32,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 22:20:32,774 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 22:20:32,776 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 22:20:32,983 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2022-07-19 22:20:33,892 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 22:20:33,899 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 22:20:33,899 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 22:20:33,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:20:33 BoogieIcfgContainer [2022-07-19 22:20:33,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 22:20:33,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 22:20:33,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 22:20:33,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 22:20:33,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:20:30" (1/3) ... [2022-07-19 22:20:33,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab2a38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:20:33, skipping insertion in model container [2022-07-19 22:20:33,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:32" (2/3) ... [2022-07-19 22:20:33,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab2a38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:20:33, skipping insertion in model container [2022-07-19 22:20:33,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:20:33" (3/3) ... [2022-07-19 22:20:33,908 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_string_harness.i [2022-07-19 22:20:33,919 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 22:20:33,920 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 22:20:33,958 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 22:20:33,963 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@58604437, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6482a02b [2022-07-19 22:20:33,964 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 22:20:33,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 97 states have (on average 1.175257731958763) internal successors, (114), 97 states have internal predecessors, (114), 39 states have call successors, (39), 16 states have call predecessors, (39), 16 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-07-19 22:20:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-19 22:20:33,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:33,976 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:33,977 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:33,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:33,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1670706302, now seen corresponding path program 1 times [2022-07-19 22:20:33,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:33,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626783673] [2022-07-19 22:20:33,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:33,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:20:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:20:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:20:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 22:20:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-19 22:20:34,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:34,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626783673] [2022-07-19 22:20:34,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626783673] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:20:34,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:20:34,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 22:20:34,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115246528] [2022-07-19 22:20:34,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:20:34,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:20:34,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:34,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:20:34,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 22:20:34,806 INFO L87 Difference]: Start difference. First operand has 153 states, 97 states have (on average 1.175257731958763) internal successors, (114), 97 states have internal predecessors, (114), 39 states have call successors, (39), 16 states have call predecessors, (39), 16 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-19 22:20:35,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:20:35,240 INFO L93 Difference]: Finished difference Result 317 states and 419 transitions. [2022-07-19 22:20:35,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 22:20:35,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2022-07-19 22:20:35,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:20:35,258 INFO L225 Difference]: With dead ends: 317 [2022-07-19 22:20:35,259 INFO L226 Difference]: Without dead ends: 164 [2022-07-19 22:20:35,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 22:20:35,272 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 60 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:20:35,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 264 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 22:20:35,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-19 22:20:35,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2022-07-19 22:20:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 91 states have (on average 1.164835164835165) internal successors, (106), 92 states have internal predecessors, (106), 39 states have call successors, (39), 16 states have call predecessors, (39), 16 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-07-19 22:20:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 183 transitions. [2022-07-19 22:20:35,329 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 183 transitions. Word has length 80 [2022-07-19 22:20:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:20:35,329 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 183 transitions. [2022-07-19 22:20:35,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-19 22:20:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 183 transitions. [2022-07-19 22:20:35,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-19 22:20:35,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:35,336 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:35,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 22:20:35,336 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:35,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2065694084, now seen corresponding path program 1 times [2022-07-19 22:20:35,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:35,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832713259] [2022-07-19 22:20:35,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:35,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:20:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:20:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:20:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 22:20:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-19 22:20:35,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:35,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832713259] [2022-07-19 22:20:35,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832713259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:20:35,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:20:35,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 22:20:35,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452688930] [2022-07-19 22:20:35,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:20:35,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 22:20:35,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:35,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 22:20:35,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:20:35,846 INFO L87 Difference]: Start difference. First operand 147 states and 183 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-19 22:20:36,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:20:36,988 INFO L93 Difference]: Finished difference Result 240 states and 305 transitions. [2022-07-19 22:20:36,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 22:20:36,990 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2022-07-19 22:20:36,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:20:36,992 INFO L225 Difference]: With dead ends: 240 [2022-07-19 22:20:36,992 INFO L226 Difference]: Without dead ends: 193 [2022-07-19 22:20:36,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:20:36,994 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 78 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:20:36,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 803 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-19 22:20:36,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-19 22:20:37,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 152. [2022-07-19 22:20:37,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 95 states have (on average 1.1578947368421053) internal successors, (110), 96 states have internal predecessors, (110), 39 states have call successors, (39), 16 states have call predecessors, (39), 17 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2022-07-19 22:20:37,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 188 transitions. [2022-07-19 22:20:37,035 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 188 transitions. Word has length 80 [2022-07-19 22:20:37,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:20:37,036 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 188 transitions. [2022-07-19 22:20:37,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-19 22:20:37,036 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2022-07-19 22:20:37,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-19 22:20:37,038 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:37,038 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:37,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 22:20:37,038 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:37,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:37,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1742615278, now seen corresponding path program 1 times [2022-07-19 22:20:37,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:37,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136381313] [2022-07-19 22:20:37,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:37,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:20:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:20:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:20:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 22:20:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-19 22:20:37,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:37,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136381313] [2022-07-19 22:20:37,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136381313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:20:37,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:20:37,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 22:20:37,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667806316] [2022-07-19 22:20:37,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:20:37,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 22:20:37,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:37,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 22:20:37,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:20:37,449 INFO L87 Difference]: Start difference. First operand 152 states and 188 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-19 22:20:38,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:20:38,469 INFO L93 Difference]: Finished difference Result 260 states and 338 transitions. [2022-07-19 22:20:38,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 22:20:38,472 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 86 [2022-07-19 22:20:38,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:20:38,474 INFO L225 Difference]: With dead ends: 260 [2022-07-19 22:20:38,474 INFO L226 Difference]: Without dead ends: 218 [2022-07-19 22:20:38,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:20:38,476 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 161 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 22:20:38,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 645 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 22:20:38,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-19 22:20:38,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 160. [2022-07-19 22:20:38,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.1515151515151516) internal successors, (114), 102 states have internal predecessors, (114), 42 states have call successors, (42), 16 states have call predecessors, (42), 18 states have return successors, (43), 41 states have call predecessors, (43), 41 states have call successors, (43) [2022-07-19 22:20:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 199 transitions. [2022-07-19 22:20:38,495 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 199 transitions. Word has length 86 [2022-07-19 22:20:38,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:20:38,495 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 199 transitions. [2022-07-19 22:20:38,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-19 22:20:38,496 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 199 transitions. [2022-07-19 22:20:38,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-19 22:20:38,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:38,497 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:38,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 22:20:38,498 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:38,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:38,498 INFO L85 PathProgramCache]: Analyzing trace with hash -305918410, now seen corresponding path program 1 times [2022-07-19 22:20:38,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:38,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867699000] [2022-07-19 22:20:38,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:38,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:20:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:20:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:20:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:20:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:20:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-19 22:20:38,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:38,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867699000] [2022-07-19 22:20:38,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867699000] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:20:38,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:20:38,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 22:20:38,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429518826] [2022-07-19 22:20:38,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:20:38,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 22:20:38,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:38,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 22:20:38,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:20:38,889 INFO L87 Difference]: Start difference. First operand 160 states and 199 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-19 22:20:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:20:39,814 INFO L93 Difference]: Finished difference Result 256 states and 325 transitions. [2022-07-19 22:20:39,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 22:20:39,815 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2022-07-19 22:20:39,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:20:39,817 INFO L225 Difference]: With dead ends: 256 [2022-07-19 22:20:39,817 INFO L226 Difference]: Without dead ends: 216 [2022-07-19 22:20:39,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:20:39,819 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 92 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 22:20:39,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 726 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 22:20:39,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-19 22:20:39,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 170. [2022-07-19 22:20:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 106 states have (on average 1.1415094339622642) internal successors, (121), 109 states have internal predecessors, (121), 42 states have call successors, (42), 16 states have call predecessors, (42), 21 states have return successors, (48), 44 states have call predecessors, (48), 41 states have call successors, (48) [2022-07-19 22:20:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 211 transitions. [2022-07-19 22:20:39,835 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 211 transitions. Word has length 95 [2022-07-19 22:20:39,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:20:39,836 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 211 transitions. [2022-07-19 22:20:39,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-19 22:20:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 211 transitions. [2022-07-19 22:20:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-19 22:20:39,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:39,838 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:20:39,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 22:20:39,838 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:39,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:39,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1965360267, now seen corresponding path program 1 times [2022-07-19 22:20:39,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:39,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63850182] [2022-07-19 22:20:39,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:39,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:20:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:20:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:20:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:20:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:20:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 22:20:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-19 22:20:40,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:40,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63850182] [2022-07-19 22:20:40,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63850182] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:20:40,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710714435] [2022-07-19 22:20:40,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:40,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:20:40,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:20:40,531 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:20:40,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 22:20:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:41,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 2690 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-19 22:20:41,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:20:41,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:20:43,676 INFO L356 Elim1Store]: treesize reduction 120, result has 21.6 percent of original size [2022-07-19 22:20:43,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 179 treesize of output 143 [2022-07-19 22:20:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-19 22:20:43,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:20:46,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710714435] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:20:46,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:20:46,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 30] total 42 [2022-07-19 22:20:46,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733100506] [2022-07-19 22:20:46,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:20:46,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-19 22:20:46,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:46,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-19 22:20:46,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2404, Unknown=0, NotChecked=0, Total=2550 [2022-07-19 22:20:46,488 INFO L87 Difference]: Start difference. First operand 170 states and 211 transitions. Second operand has 42 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 32 states have internal predecessors, (107), 13 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (29), 14 states have call predecessors, (29), 12 states have call successors, (29) [2022-07-19 22:20:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:20:52,207 INFO L93 Difference]: Finished difference Result 411 states and 527 transitions. [2022-07-19 22:20:52,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-19 22:20:52,207 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 32 states have internal predecessors, (107), 13 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (29), 14 states have call predecessors, (29), 12 states have call successors, (29) Word has length 103 [2022-07-19 22:20:52,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:20:52,212 INFO L225 Difference]: With dead ends: 411 [2022-07-19 22:20:52,212 INFO L226 Difference]: Without dead ends: 254 [2022-07-19 22:20:52,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1511 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=659, Invalid=7346, Unknown=5, NotChecked=0, Total=8010 [2022-07-19 22:20:52,216 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 485 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 4023 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 2236 SdHoareTripleChecker+Invalid, 5360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 4023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 934 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:20:52,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 2236 Invalid, 5360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 4023 Invalid, 0 Unknown, 934 Unchecked, 3.4s Time] [2022-07-19 22:20:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-07-19 22:20:52,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 200. [2022-07-19 22:20:52,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 128 states have (on average 1.1328125) internal successors, (145), 133 states have internal predecessors, (145), 46 states have call successors, (46), 17 states have call predecessors, (46), 25 states have return successors, (62), 49 states have call predecessors, (62), 45 states have call successors, (62) [2022-07-19 22:20:52,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 253 transitions. [2022-07-19 22:20:52,244 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 253 transitions. Word has length 103 [2022-07-19 22:20:52,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:20:52,244 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 253 transitions. [2022-07-19 22:20:52,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 32 states have internal predecessors, (107), 13 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (29), 14 states have call predecessors, (29), 12 states have call successors, (29) [2022-07-19 22:20:52,245 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 253 transitions. [2022-07-19 22:20:52,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 22:20:52,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:52,246 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:20:52,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 22:20:52,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:20:52,460 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:52,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:52,460 INFO L85 PathProgramCache]: Analyzing trace with hash 848771971, now seen corresponding path program 1 times [2022-07-19 22:20:52,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:52,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822678896] [2022-07-19 22:20:52,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:52,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:52,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:52,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:52,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:20:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:52,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:52,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:20:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:52,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:20:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:52,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:20:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:52,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:52,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:20:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:52,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:20:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:52,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:52,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:52,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:52,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:52,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:52,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:20:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-19 22:20:52,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:52,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822678896] [2022-07-19 22:20:52,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822678896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:20:52,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:20:52,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-19 22:20:52,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958311249] [2022-07-19 22:20:52,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:20:52,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 22:20:52,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:52,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 22:20:52,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-07-19 22:20:52,933 INFO L87 Difference]: Start difference. First operand 200 states and 253 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-19 22:20:54,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:20:54,569 INFO L93 Difference]: Finished difference Result 263 states and 343 transitions. [2022-07-19 22:20:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 22:20:54,569 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) Word has length 108 [2022-07-19 22:20:54,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:20:54,572 INFO L225 Difference]: With dead ends: 263 [2022-07-19 22:20:54,572 INFO L226 Difference]: Without dead ends: 251 [2022-07-19 22:20:54,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2022-07-19 22:20:54,573 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 302 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:20:54,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1076 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-19 22:20:54,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-19 22:20:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 205. [2022-07-19 22:20:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 132 states have (on average 1.128787878787879) internal successors, (149), 138 states have internal predecessors, (149), 46 states have call successors, (46), 17 states have call predecessors, (46), 26 states have return successors, (65), 49 states have call predecessors, (65), 45 states have call successors, (65) [2022-07-19 22:20:54,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 260 transitions. [2022-07-19 22:20:54,597 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 260 transitions. Word has length 108 [2022-07-19 22:20:54,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:20:54,597 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 260 transitions. [2022-07-19 22:20:54,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-19 22:20:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 260 transitions. [2022-07-19 22:20:54,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 22:20:54,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:54,599 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:20:54,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 22:20:54,600 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:54,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:54,600 INFO L85 PathProgramCache]: Analyzing trace with hash -675274041, now seen corresponding path program 2 times [2022-07-19 22:20:54,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:54,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702008043] [2022-07-19 22:20:54,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:54,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:54,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:54,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:54,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:20:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:54,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:54,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:20:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:54,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 22:20:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:54,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:20:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:54,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:54,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:20:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:54,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:20:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:55,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:55,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:55,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:55,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:55,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:55,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:20:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:55,070 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-19 22:20:55,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:55,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702008043] [2022-07-19 22:20:55,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702008043] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:20:55,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127364581] [2022-07-19 22:20:55,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 22:20:55,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:20:55,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:20:55,072 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:20:55,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 22:20:55,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 22:20:55,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:20:55,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 2696 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-19 22:20:55,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:20:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-19 22:20:56,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:20:56,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127364581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:20:56,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:20:56,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [18] total 31 [2022-07-19 22:20:56,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120268216] [2022-07-19 22:20:56,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:20:56,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 22:20:56,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:56,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 22:20:56,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=865, Unknown=0, NotChecked=0, Total=930 [2022-07-19 22:20:56,103 INFO L87 Difference]: Start difference. First operand 205 states and 260 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 6 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-19 22:20:56,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:20:56,493 INFO L93 Difference]: Finished difference Result 283 states and 360 transitions. [2022-07-19 22:20:56,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 22:20:56,494 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 6 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 108 [2022-07-19 22:20:56,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:20:56,495 INFO L225 Difference]: With dead ends: 283 [2022-07-19 22:20:56,495 INFO L226 Difference]: Without dead ends: 199 [2022-07-19 22:20:56,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=1367, Unknown=0, NotChecked=0, Total=1482 [2022-07-19 22:20:56,497 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 117 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:20:56,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 2016 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:20:56,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-19 22:20:56,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 189. [2022-07-19 22:20:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 120 states have (on average 1.1416666666666666) internal successors, (137), 125 states have internal predecessors, (137), 45 states have call successors, (45), 16 states have call predecessors, (45), 23 states have return successors, (54), 47 states have call predecessors, (54), 43 states have call successors, (54) [2022-07-19 22:20:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 236 transitions. [2022-07-19 22:20:56,519 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 236 transitions. Word has length 108 [2022-07-19 22:20:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:20:56,519 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 236 transitions. [2022-07-19 22:20:56,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 6 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-19 22:20:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 236 transitions. [2022-07-19 22:20:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-19 22:20:56,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:56,521 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:56,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 22:20:56,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-19 22:20:56,739 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:56,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:56,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1176778786, now seen corresponding path program 1 times [2022-07-19 22:20:56,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:56,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956818454] [2022-07-19 22:20:56,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:56,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:56,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:56,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:56,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:20:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:56,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:56,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:20:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:56,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:20:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:57,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:20:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:57,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:57,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 22:20:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:57,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:57,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:57,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:20:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:57,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:57,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:20:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:57,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 22:20:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-19 22:20:57,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:57,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956818454] [2022-07-19 22:20:57,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956818454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:20:57,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:20:57,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 22:20:57,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079676245] [2022-07-19 22:20:57,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:20:57,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 22:20:57,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:57,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 22:20:57,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:20:57,136 INFO L87 Difference]: Start difference. First operand 189 states and 236 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 8 states have internal predecessors, (56), 5 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-19 22:20:58,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:20:58,198 INFO L93 Difference]: Finished difference Result 305 states and 393 transitions. [2022-07-19 22:20:58,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 22:20:58,198 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 8 states have internal predecessors, (56), 5 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 99 [2022-07-19 22:20:58,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:20:58,200 INFO L225 Difference]: With dead ends: 305 [2022-07-19 22:20:58,200 INFO L226 Difference]: Without dead ends: 242 [2022-07-19 22:20:58,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2022-07-19 22:20:58,201 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 361 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 22:20:58,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 719 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 22:20:58,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-19 22:20:58,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 176. [2022-07-19 22:20:58,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 113 states have (on average 1.1327433628318584) internal successors, (128), 115 states have internal predecessors, (128), 42 states have call successors, (42), 16 states have call predecessors, (42), 20 states have return successors, (46), 44 states have call predecessors, (46), 40 states have call successors, (46) [2022-07-19 22:20:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 216 transitions. [2022-07-19 22:20:58,220 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 216 transitions. Word has length 99 [2022-07-19 22:20:58,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:20:58,220 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 216 transitions. [2022-07-19 22:20:58,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 8 states have internal predecessors, (56), 5 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-19 22:20:58,221 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 216 transitions. [2022-07-19 22:20:58,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-19 22:20:58,223 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:58,224 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:20:58,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 22:20:58,224 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:58,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:58,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1796968396, now seen corresponding path program 1 times [2022-07-19 22:20:58,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:58,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137366344] [2022-07-19 22:20:58,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:58,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:20:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:20:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:20:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:20:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 22:20:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:20:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:20:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:20:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 22:20:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:20:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:20:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:20:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 22:20:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 22:20:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-19 22:20:58,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:58,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137366344] [2022-07-19 22:20:58,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137366344] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:20:58,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:20:58,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 22:20:58,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417305286] [2022-07-19 22:20:58,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:20:58,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 22:20:58,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:58,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 22:20:58,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:20:58,594 INFO L87 Difference]: Start difference. First operand 176 states and 216 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (24), 6 states have call predecessors, (24), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-19 22:20:59,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:20:59,498 INFO L93 Difference]: Finished difference Result 269 states and 333 transitions. [2022-07-19 22:20:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 22:20:59,499 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (24), 6 states have call predecessors, (24), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 141 [2022-07-19 22:20:59,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:20:59,501 INFO L225 Difference]: With dead ends: 269 [2022-07-19 22:20:59,501 INFO L226 Difference]: Without dead ends: 193 [2022-07-19 22:20:59,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-07-19 22:20:59,502 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 179 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:20:59,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 583 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 22:20:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-19 22:20:59,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 181. [2022-07-19 22:20:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 117 states have (on average 1.1282051282051282) internal successors, (132), 119 states have internal predecessors, (132), 42 states have call successors, (42), 16 states have call predecessors, (42), 21 states have return successors, (47), 45 states have call predecessors, (47), 40 states have call successors, (47) [2022-07-19 22:20:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 221 transitions. [2022-07-19 22:20:59,520 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 221 transitions. Word has length 141 [2022-07-19 22:20:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:20:59,520 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 221 transitions. [2022-07-19 22:20:59,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (24), 6 states have call predecessors, (24), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-19 22:20:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 221 transitions. [2022-07-19 22:20:59,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-19 22:20:59,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:20:59,522 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:20:59,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 22:20:59,523 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:20:59,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:20:59,523 INFO L85 PathProgramCache]: Analyzing trace with hash -897660901, now seen corresponding path program 1 times [2022-07-19 22:20:59,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:20:59,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709063649] [2022-07-19 22:20:59,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:20:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:20:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:20:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:20:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:20:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:20:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:20:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:20:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 22:20:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 22:20:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:20:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:20:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 22:20:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:20:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:20:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:20:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:20:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:20:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-19 22:20:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 22:20:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:20:59,880 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-19 22:20:59,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:20:59,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709063649] [2022-07-19 22:20:59,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709063649] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:20:59,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:20:59,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 22:20:59,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866524350] [2022-07-19 22:20:59,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:20:59,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:20:59,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:20:59,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:20:59,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:20:59,883 INFO L87 Difference]: Start difference. First operand 181 states and 221 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (25), 7 states have call predecessors, (25), 2 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-19 22:21:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:00,959 INFO L93 Difference]: Finished difference Result 274 states and 341 transitions. [2022-07-19 22:21:00,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-19 22:21:00,959 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (25), 7 states have call predecessors, (25), 2 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) Word has length 147 [2022-07-19 22:21:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:00,961 INFO L225 Difference]: With dead ends: 274 [2022-07-19 22:21:00,961 INFO L226 Difference]: Without dead ends: 210 [2022-07-19 22:21:00,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2022-07-19 22:21:00,963 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 113 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:00,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 727 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 22:21:00,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-19 22:21:00,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 186. [2022-07-19 22:21:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 121 states have (on average 1.1239669421487604) internal successors, (136), 123 states have internal predecessors, (136), 42 states have call successors, (42), 16 states have call predecessors, (42), 22 states have return successors, (48), 46 states have call predecessors, (48), 40 states have call successors, (48) [2022-07-19 22:21:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 226 transitions. [2022-07-19 22:21:00,984 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 226 transitions. Word has length 147 [2022-07-19 22:21:00,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:00,984 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 226 transitions. [2022-07-19 22:21:00,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (25), 7 states have call predecessors, (25), 2 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-19 22:21:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 226 transitions. [2022-07-19 22:21:00,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-19 22:21:00,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:00,986 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:21:00,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 22:21:00,987 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:00,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:00,987 INFO L85 PathProgramCache]: Analyzing trace with hash -648190534, now seen corresponding path program 1 times [2022-07-19 22:21:00,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:00,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437322811] [2022-07-19 22:21:00,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:00,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:21:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:21:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 22:21:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:21:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 22:21:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 22:21:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:21:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:21:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 22:21:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:21:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:21:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:21:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:21:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:21:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:21:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:21:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 22:21:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-19 22:21:01,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:01,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437322811] [2022-07-19 22:21:01,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437322811] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:21:01,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652376517] [2022-07-19 22:21:01,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:01,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:21:01,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:21:01,532 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:21:01,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 22:21:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:02,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 2842 conjuncts, 132 conjunts are in the unsatisfiable core [2022-07-19 22:21:02,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:21:02,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:21:02,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:21:03,406 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_730 (Array Int Int))) (= (store |c_old(#memory_int)| |c_aws_add_size_checked_#in~r#1.base| v_ArrVal_730) |c_#memory_int|)) is different from true [2022-07-19 22:21:03,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:21:03,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:21:03,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2022-07-19 22:21:03,665 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 22:21:03,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 22:21:04,489 INFO L356 Elim1Store]: treesize reduction 120, result has 21.6 percent of original size [2022-07-19 22:21:04,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 223 treesize of output 163 [2022-07-19 22:21:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 21 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-19 22:21:04,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:21:06,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652376517] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:21:06,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:21:06,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 37] total 48 [2022-07-19 22:21:06,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856804895] [2022-07-19 22:21:06,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:21:06,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-19 22:21:06,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:06,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-19 22:21:06,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2794, Unknown=14, NotChecked=106, Total=3080 [2022-07-19 22:21:06,210 INFO L87 Difference]: Start difference. First operand 186 states and 226 transitions. Second operand has 48 states, 41 states have (on average 3.2439024390243905) internal successors, (133), 33 states have internal predecessors, (133), 16 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (39), 17 states have call predecessors, (39), 15 states have call successors, (39) [2022-07-19 22:21:06,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:06,718 INFO L93 Difference]: Finished difference Result 198 states and 236 transitions. [2022-07-19 22:21:06,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 22:21:06,720 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 41 states have (on average 3.2439024390243905) internal successors, (133), 33 states have internal predecessors, (133), 16 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (39), 17 states have call predecessors, (39), 15 states have call successors, (39) Word has length 147 [2022-07-19 22:21:06,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:06,721 INFO L225 Difference]: With dead ends: 198 [2022-07-19 22:21:06,721 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 22:21:06,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 159 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=227, Invalid=3545, Unknown=14, NotChecked=120, Total=3906 [2022-07-19 22:21:06,722 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:06,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 100 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 354 Invalid, 0 Unknown, 99 Unchecked, 0.2s Time] [2022-07-19 22:21:06,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 22:21:06,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 22:21:06,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 22:21:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 22:21:06,724 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 147 [2022-07-19 22:21:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:06,724 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 22:21:06,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 41 states have (on average 3.2439024390243905) internal successors, (133), 33 states have internal predecessors, (133), 16 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (39), 17 states have call predecessors, (39), 15 states have call successors, (39) [2022-07-19 22:21:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 22:21:06,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 22:21:06,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 22:21:06,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 22:21:06,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:21:06,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 22:21:07,108 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (or (not (= 195 |~#s_can_fail_allocator_static~0.base|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-19 22:21:07,109 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-07-19 22:21:07,109 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-07-19 22:21:07,109 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-07-19 22:21:07,109 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (or (not (= 195 |~#s_can_fail_allocator_static~0.base|)) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-19 22:21:07,109 INFO L902 garLoopResultBuilder]: At program point aws_mem_acquireENTRY(lines 6928 6938) the Hoare annotation is: true [2022-07-19 22:21:07,109 INFO L899 garLoopResultBuilder]: For program point L6934(lines 6934 6936) no Hoare annotation was computed. [2022-07-19 22:21:07,109 INFO L899 garLoopResultBuilder]: For program point L6935-1(line 6935) no Hoare annotation was computed. [2022-07-19 22:21:07,109 INFO L902 garLoopResultBuilder]: At program point L6935(line 6935) the Hoare annotation is: true [2022-07-19 22:21:07,109 INFO L899 garLoopResultBuilder]: For program point aws_mem_acquireEXIT(lines 6928 6938) no Hoare annotation was computed. [2022-07-19 22:21:07,109 INFO L902 garLoopResultBuilder]: At program point L6931-1(line 6931) the Hoare annotation is: true [2022-07-19 22:21:07,109 INFO L902 garLoopResultBuilder]: At program point L6931(line 6931) the Hoare annotation is: true [2022-07-19 22:21:07,110 INFO L899 garLoopResultBuilder]: For program point L6934-2(lines 6934 6936) no Hoare annotation was computed. [2022-07-19 22:21:07,110 INFO L899 garLoopResultBuilder]: For program point L6933(line 6933) no Hoare annotation was computed. [2022-07-19 22:21:07,110 INFO L899 garLoopResultBuilder]: For program point L6929-2(line 6929) no Hoare annotation was computed. [2022-07-19 22:21:07,110 INFO L902 garLoopResultBuilder]: At program point L6929-1(line 6929) the Hoare annotation is: true [2022-07-19 22:21:07,110 INFO L902 garLoopResultBuilder]: At program point L6929(line 6929) the Hoare annotation is: true [2022-07-19 22:21:07,110 INFO L899 garLoopResultBuilder]: For program point aws_mem_acquireFINAL(lines 6928 6938) no Hoare annotation was computed. [2022-07-19 22:21:07,110 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-19 22:21:07,110 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-19 22:21:07,110 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-19 22:21:07,110 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-07-19 22:21:07,110 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-07-19 22:21:07,110 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-07-19 22:21:07,110 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-07-19 22:21:07,110 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-07-19 22:21:07,110 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-07-19 22:21:07,110 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-07-19 22:21:07,110 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validFINAL(lines 6923 6926) no Hoare annotation was computed. [2022-07-19 22:21:07,110 INFO L899 garLoopResultBuilder]: For program point L6925-1(line 6925) no Hoare annotation was computed. [2022-07-19 22:21:07,110 INFO L902 garLoopResultBuilder]: At program point L6925(line 6925) the Hoare annotation is: true [2022-07-19 22:21:07,110 INFO L902 garLoopResultBuilder]: At program point aws_allocator_is_validENTRY(lines 6923 6926) the Hoare annotation is: true [2022-07-19 22:21:07,111 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validEXIT(lines 6923 6926) no Hoare annotation was computed. [2022-07-19 22:21:07,111 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-19 22:21:07,111 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-19 22:21:07,111 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-19 22:21:07,111 INFO L902 garLoopResultBuilder]: At program point __CPROVER_overflow_plusENTRY(lines 248 251) the Hoare annotation is: true [2022-07-19 22:21:07,111 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusFINAL(lines 248 251) no Hoare annotation was computed. [2022-07-19 22:21:07,111 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusEXIT(lines 248 251) no Hoare annotation was computed. [2022-07-19 22:21:07,111 INFO L899 garLoopResultBuilder]: For program point L8989(line 8989) no Hoare annotation was computed. [2022-07-19 22:21:07,111 INFO L899 garLoopResultBuilder]: For program point L8990-1(line 8990) no Hoare annotation was computed. [2022-07-19 22:21:07,111 INFO L902 garLoopResultBuilder]: At program point L8989-1(line 8989) the Hoare annotation is: true [2022-07-19 22:21:07,111 INFO L899 garLoopResultBuilder]: For program point L8989-2(line 8989) no Hoare annotation was computed. [2022-07-19 22:21:07,111 INFO L902 garLoopResultBuilder]: At program point aws_string_new_from_stringENTRY(lines 8988 8991) the Hoare annotation is: true [2022-07-19 22:21:07,112 INFO L902 garLoopResultBuilder]: At program point L8990(line 8990) the Hoare annotation is: true [2022-07-19 22:21:07,112 INFO L902 garLoopResultBuilder]: At program point L8989-4(line 8989) the Hoare annotation is: true [2022-07-19 22:21:07,112 INFO L899 garLoopResultBuilder]: For program point L8989-5(line 8989) no Hoare annotation was computed. [2022-07-19 22:21:07,112 INFO L899 garLoopResultBuilder]: For program point aws_string_new_from_stringEXIT(lines 8988 8991) no Hoare annotation was computed. [2022-07-19 22:21:07,112 INFO L899 garLoopResultBuilder]: For program point aws_string_new_from_stringFINAL(lines 8988 8991) no Hoare annotation was computed. [2022-07-19 22:21:07,112 INFO L902 garLoopResultBuilder]: At program point can_fail_mallocENTRY(lines 6899 6903) the Hoare annotation is: true [2022-07-19 22:21:07,112 INFO L899 garLoopResultBuilder]: For program point L6900-3(lines 6900 6902) no Hoare annotation was computed. [2022-07-19 22:21:07,112 INFO L902 garLoopResultBuilder]: At program point L6902(line 6902) the Hoare annotation is: true [2022-07-19 22:21:07,113 INFO L899 garLoopResultBuilder]: For program point can_fail_mallocFINAL(lines 6899 6903) no Hoare annotation was computed. [2022-07-19 22:21:07,113 INFO L899 garLoopResultBuilder]: For program point L6900-1(lines 6900 6902) no Hoare annotation was computed. [2022-07-19 22:21:07,113 INFO L899 garLoopResultBuilder]: For program point can_fail_mallocEXIT(lines 6899 6903) no Hoare annotation was computed. [2022-07-19 22:21:07,113 INFO L902 garLoopResultBuilder]: At program point L6900(line 6900) the Hoare annotation is: true [2022-07-19 22:21:07,113 INFO L899 garLoopResultBuilder]: For program point L6902-1(line 6902) no Hoare annotation was computed. [2022-07-19 22:21:07,113 INFO L902 garLoopResultBuilder]: At program point aws_string_new_from_arrayENTRY(lines 8964 8986) the Hoare annotation is: true [2022-07-19 22:21:07,113 INFO L899 garLoopResultBuilder]: For program point L8985-4(line 8985) no Hoare annotation was computed. [2022-07-19 22:21:07,113 INFO L902 garLoopResultBuilder]: At program point L8985-1(line 8985) the Hoare annotation is: true [2022-07-19 22:21:07,114 INFO L902 garLoopResultBuilder]: At program point L8983(line 8983) the Hoare annotation is: true [2022-07-19 22:21:07,114 INFO L899 garLoopResultBuilder]: For program point L8985-2(line 8985) no Hoare annotation was computed. [2022-07-19 22:21:07,114 INFO L899 garLoopResultBuilder]: For program point L8983-1(line 8983) no Hoare annotation was computed. [2022-07-19 22:21:07,114 INFO L902 garLoopResultBuilder]: At program point L8985-3(line 8985) the Hoare annotation is: true [2022-07-19 22:21:07,114 INFO L902 garLoopResultBuilder]: At program point L8973(line 8973) the Hoare annotation is: true [2022-07-19 22:21:07,114 INFO L899 garLoopResultBuilder]: For program point L8973-1(line 8973) no Hoare annotation was computed. [2022-07-19 22:21:07,114 INFO L902 garLoopResultBuilder]: At program point L8965(line 8965) the Hoare annotation is: true [2022-07-19 22:21:07,114 INFO L899 garLoopResultBuilder]: For program point aws_string_new_from_arrayFINAL(lines 8964 8986) no Hoare annotation was computed. [2022-07-19 22:21:07,115 INFO L902 garLoopResultBuilder]: At program point L8965-1(line 8965) the Hoare annotation is: true [2022-07-19 22:21:07,115 INFO L899 garLoopResultBuilder]: For program point aws_string_new_from_arrayEXIT(lines 8964 8986) no Hoare annotation was computed. [2022-07-19 22:21:07,115 INFO L899 garLoopResultBuilder]: For program point L8974(lines 8974 8978) no Hoare annotation was computed. [2022-07-19 22:21:07,115 INFO L902 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: true [2022-07-19 22:21:07,115 INFO L899 garLoopResultBuilder]: For program point L8968-1(line 8968) no Hoare annotation was computed. [2022-07-19 22:21:07,115 INFO L899 garLoopResultBuilder]: For program point L8966(line 8966) no Hoare annotation was computed. [2022-07-19 22:21:07,115 INFO L899 garLoopResultBuilder]: For program point L8968-2(lines 8968 8972) no Hoare annotation was computed. [2022-07-19 22:21:07,115 INFO L902 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2022-07-19 22:21:07,116 INFO L902 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: true [2022-07-19 22:21:07,116 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memcpyFINAL(line -1) no Hoare annotation was computed. [2022-07-19 22:21:07,116 INFO L902 garLoopResultBuilder]: At program point #Ultimate.C_memcpyENTRY(line -1) the Hoare annotation is: true [2022-07-19 22:21:07,116 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memcpyEXIT(line -1) no Hoare annotation was computed. [2022-07-19 22:21:07,116 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-19 22:21:07,116 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-19 22:21:07,116 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-19 22:21:07,116 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-19 22:21:07,117 INFO L902 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: true [2022-07-19 22:21:07,117 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2022-07-19 22:21:07,117 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2022-07-19 22:21:07,117 INFO L899 garLoopResultBuilder]: For program point L7317(lines 7317 7319) no Hoare annotation was computed. [2022-07-19 22:21:07,117 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-07-19 22:21:07,117 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-07-19 22:21:07,117 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-07-19 22:21:07,117 INFO L902 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: true [2022-07-19 22:21:07,118 INFO L902 garLoopResultBuilder]: At program point aws_add_size_checkedENTRY(lines 2613 2621) the Hoare annotation is: true [2022-07-19 22:21:07,118 INFO L902 garLoopResultBuilder]: At program point L2542(line 2542) the Hoare annotation is: true [2022-07-19 22:21:07,118 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2022-07-19 22:21:07,118 INFO L902 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: true [2022-07-19 22:21:07,118 INFO L899 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2022-07-19 22:21:07,118 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedFINAL(lines 2613 2621) no Hoare annotation was computed. [2022-07-19 22:21:07,118 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedEXIT(lines 2613 2621) no Hoare annotation was computed. [2022-07-19 22:21:07,119 INFO L895 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: false [2022-07-19 22:21:07,119 INFO L899 garLoopResultBuilder]: For program point L9338(lines 9338 9344) no Hoare annotation was computed. [2022-07-19 22:21:07,119 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-07-19 22:21:07,119 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2022-07-19 22:21:07,119 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-07-19 22:21:07,119 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_~max_size#1| 18446744073710786165) (let ((.cse0 (* (div |ULTIMATE.start_ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616) 18446744073709551616))) (<= (+ 18446744073709551616 .cse0) (+ |ULTIMATE.start_ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ (* (- 1) |ULTIMATE.start_ensure_string_is_allocated_bounded_length_~len~1#1|) 18446744073710786164 .cse0) 18446744073709551616))))) (= 195 |~#s_can_fail_allocator_static~0.base|) (<= 18446744073709551616 (+ |ULTIMATE.start_ensure_string_is_allocated_~len#1| (* 18446744073709551616 (div (+ 18446744073710786164 (* (- 1) |ULTIMATE.start_ensure_string_is_allocated_~len#1|)) 18446744073709551616))))) [2022-07-19 22:21:07,120 INFO L895 garLoopResultBuilder]: At program point L6803(lines 6800 6804) the Hoare annotation is: false [2022-07-19 22:21:07,120 INFO L895 garLoopResultBuilder]: At program point L9338-2(lines 9338 9344) the Hoare annotation is: (and (not (= |ULTIMATE.start_ensure_string_is_allocated_#res#1.base| 0)) (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res#1.offset| 0) (let ((.cse0 (* (div |ULTIMATE.start_ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616) 18446744073709551616))) (<= (+ 18446744073709551616 .cse0) (+ |ULTIMATE.start_ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ (* (- 1) |ULTIMATE.start_ensure_string_is_allocated_bounded_length_~len~1#1|) 18446744073710786164 .cse0) 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_new_from_string_harness_~source~0#1.base| 0)) (= |ULTIMATE.start_ensure_string_is_allocated_#res#1.offset| 0) (= (+ |ULTIMATE.start_ensure_string_is_allocated_bounded_length_~max_size#1| (- 18446744073710786165)) 0) (let ((.cse1 (select |#memory_int| |ULTIMATE.start_aws_string_new_from_string_harness_~source~0#1.base|))) (let ((.cse2 (mod (select .cse1 (+ |ULTIMATE.start_aws_string_new_from_string_harness_~source~0#1.offset| 8)) 18446744073709551616))) (let ((.cse3 (<= .cse2 9223372036854775807))) (or (and (= (mod (select .cse1 (+ |ULTIMATE.start_aws_string_new_from_string_harness_~source~0#1.offset| 16 .cse2)) 256) 0) .cse3) (and (not .cse3) (= (mod (select .cse1 (+ |ULTIMATE.start_aws_string_new_from_string_harness_~source~0#1.offset| .cse2 (- 18446744073709551600))) 256) 0)))))) (not (= |ULTIMATE.start_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ULTIMATE.start_ensure_string_is_allocated_~str~0#1.offset| 0) (not (= |ULTIMATE.start_ensure_string_is_allocated_nondet_length_#res#1.base| 0)) (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res#1.base| 0)) (= |ULTIMATE.start_ensure_string_is_allocated_nondet_length_#res#1.offset| 0) (not (= |ULTIMATE.start_ensure_string_is_allocated_~len#1| (+ (* (div |ULTIMATE.start_ensure_string_is_allocated_~len#1| 18446744073709551616) 18446744073709551616) 18446744073709551600))) (= |ULTIMATE.start_aws_string_new_from_string_harness_~source~0#1.offset| 0)) [2022-07-19 22:21:07,120 INFO L895 garLoopResultBuilder]: At program point L6795(lines 6793 6798) the Hoare annotation is: false [2022-07-19 22:21:07,120 INFO L902 garLoopResultBuilder]: At program point L9347(line 9347) the Hoare annotation is: true [2022-07-19 22:21:07,120 INFO L899 garLoopResultBuilder]: For program point L9343-2(line 9343) no Hoare annotation was computed. [2022-07-19 22:21:07,120 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 22:21:07,120 INFO L895 garLoopResultBuilder]: At program point L9339(line 9339) the Hoare annotation is: false [2022-07-19 22:21:07,121 INFO L899 garLoopResultBuilder]: For program point L9339-1(line 9339) no Hoare annotation was computed. [2022-07-19 22:21:07,121 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 22:21:07,121 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 22:21:07,121 INFO L895 garLoopResultBuilder]: At program point L9343(line 9343) the Hoare annotation is: false [2022-07-19 22:21:07,121 INFO L895 garLoopResultBuilder]: At program point L9343-1(line 9343) the Hoare annotation is: false [2022-07-19 22:21:07,121 INFO L895 garLoopResultBuilder]: At program point L9335(line 9335) the Hoare annotation is: false [2022-07-19 22:21:07,121 INFO L899 garLoopResultBuilder]: For program point L9335-1(line 9335) no Hoare annotation was computed. [2022-07-19 22:21:07,121 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2022-07-19 22:21:07,122 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2022-07-19 22:21:07,122 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-07-19 22:21:07,122 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 22:21:07,122 INFO L895 garLoopResultBuilder]: At program point L9340(line 9340) the Hoare annotation is: false [2022-07-19 22:21:07,122 INFO L899 garLoopResultBuilder]: For program point L9340-1(line 9340) no Hoare annotation was computed. [2022-07-19 22:21:07,122 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-07-19 22:21:07,122 INFO L899 garLoopResultBuilder]: For program point L9332(line 9332) no Hoare annotation was computed. [2022-07-19 22:21:07,123 INFO L895 garLoopResultBuilder]: At program point L9332-2(line 9332) the Hoare annotation is: false [2022-07-19 22:21:07,123 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-07-19 22:21:07,123 INFO L895 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (and (= 195 |~#s_can_fail_allocator_static~0.base|) (= (+ |ULTIMATE.start_ensure_string_is_allocated_bounded_length_~max_size#1| (- 18446744073710786165)) 0)) [2022-07-19 22:21:07,123 INFO L899 garLoopResultBuilder]: For program point L9332-3(line 9332) no Hoare annotation was computed. [2022-07-19 22:21:07,123 INFO L899 garLoopResultBuilder]: For program point L9332-4(line 9332) no Hoare annotation was computed. [2022-07-19 22:21:07,123 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-07-19 22:21:07,123 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2022-07-19 22:21:07,123 INFO L895 garLoopResultBuilder]: At program point L9341(line 9341) the Hoare annotation is: false [2022-07-19 22:21:07,124 INFO L899 garLoopResultBuilder]: For program point L9341-1(line 9341) no Hoare annotation was computed. [2022-07-19 22:21:07,124 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: false [2022-07-19 22:21:07,124 INFO L895 garLoopResultBuilder]: At program point L9345(line 9345) the Hoare annotation is: (= |ULTIMATE.start_aws_string_new_from_string_harness_#t~ret1329#1| 1) [2022-07-19 22:21:07,124 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-07-19 22:21:07,124 INFO L899 garLoopResultBuilder]: For program point L9345-1(line 9345) no Hoare annotation was computed. [2022-07-19 22:21:07,124 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-07-19 22:21:07,124 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: false [2022-07-19 22:21:07,124 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-07-19 22:21:07,125 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= 195 |~#s_can_fail_allocator_static~0.base|) (= (+ |ULTIMATE.start_ensure_string_is_allocated_bounded_length_~max_size#1| (- 18446744073710786165)) 0)) [2022-07-19 22:21:07,125 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-07-19 22:21:07,125 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-07-19 22:21:07,125 INFO L899 garLoopResultBuilder]: For program point L9329(lines 9329 9346) no Hoare annotation was computed. [2022-07-19 22:21:07,125 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-19 22:21:07,125 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-19 22:21:07,125 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-19 22:21:07,125 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-19 22:21:07,126 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-19 22:21:07,126 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-19 22:21:07,129 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:21:07,130 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 22:21:07,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:21:07 BoogieIcfgContainer [2022-07-19 22:21:07,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 22:21:07,140 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 22:21:07,140 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 22:21:07,140 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 22:21:07,140 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:20:33" (3/4) ... [2022-07-19 22:21:07,143 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 22:21:07,148 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_malloc [2022-07-19 22:21:07,148 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-19 22:21:07,149 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_acquire [2022-07-19 22:21:07,149 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_new_from_array [2022-07-19 22:21:07,149 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-19 22:21:07,149 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2022-07-19 22:21:07,149 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-19 22:21:07,149 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2022-07-19 22:21:07,149 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-19 22:21:07,149 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-07-19 22:21:07,149 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_allocator_is_valid [2022-07-19 22:21:07,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_add_size_checked [2022-07-19 22:21:07,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-19 22:21:07,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-19 22:21:07,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_plus [2022-07-19 22:21:07,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_new_from_string [2022-07-19 22:21:07,163 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 154 nodes and edges [2022-07-19 22:21:07,164 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 68 nodes and edges [2022-07-19 22:21:07,166 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-07-19 22:21:07,167 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-07-19 22:21:07,168 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-19 22:21:07,169 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-19 22:21:07,170 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 22:21:07,171 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 22:21:07,531 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 22:21:07,540 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 22:21:07,541 INFO L158 Benchmark]: Toolchain (without parser) took 37494.11ms. Allocated memory was 90.2MB in the beginning and 438.3MB in the end (delta: 348.1MB). Free memory was 64.5MB in the beginning and 368.5MB in the end (delta: -304.0MB). Peak memory consumption was 322.2MB. Max. memory is 16.1GB. [2022-07-19 22:21:07,542 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory was 60.0MB in the beginning and 59.9MB in the end (delta: 19.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 22:21:07,543 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2066.40ms. Allocated memory was 90.2MB in the beginning and 155.2MB in the end (delta: 65.0MB). Free memory was 64.1MB in the beginning and 88.7MB in the end (delta: -24.6MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. [2022-07-19 22:21:07,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 167.55ms. Allocated memory is still 155.2MB. Free memory was 88.7MB in the beginning and 77.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 22:21:07,543 INFO L158 Benchmark]: Boogie Preprocessor took 83.31ms. Allocated memory is still 155.2MB. Free memory was 77.6MB in the beginning and 69.9MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 22:21:07,544 INFO L158 Benchmark]: RCFGBuilder took 1532.56ms. Allocated memory is still 155.2MB. Free memory was 69.9MB in the beginning and 56.7MB in the end (delta: 13.2MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2022-07-19 22:21:07,544 INFO L158 Benchmark]: TraceAbstraction took 33236.47ms. Allocated memory was 155.2MB in the beginning and 438.3MB in the end (delta: 283.1MB). Free memory was 56.7MB in the beginning and 219.8MB in the end (delta: -163.2MB). Peak memory consumption was 120.9MB. Max. memory is 16.1GB. [2022-07-19 22:21:07,544 INFO L158 Benchmark]: Witness Printer took 400.70ms. Allocated memory is still 438.3MB. Free memory was 219.8MB in the beginning and 368.5MB in the end (delta: -148.7MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-07-19 22:21:07,546 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 90.2MB. Free memory was 60.0MB in the beginning and 59.9MB in the end (delta: 19.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2066.40ms. Allocated memory was 90.2MB in the beginning and 155.2MB in the end (delta: 65.0MB). Free memory was 64.1MB in the beginning and 88.7MB in the end (delta: -24.6MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 167.55ms. Allocated memory is still 155.2MB. Free memory was 88.7MB in the beginning and 77.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.31ms. Allocated memory is still 155.2MB. Free memory was 77.6MB in the beginning and 69.9MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1532.56ms. Allocated memory is still 155.2MB. Free memory was 69.9MB in the beginning and 56.7MB in the end (delta: 13.2MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * TraceAbstraction took 33236.47ms. Allocated memory was 155.2MB in the beginning and 438.3MB in the end (delta: 283.1MB). Free memory was 56.7MB in the beginning and 219.8MB in the end (delta: -163.2MB). Peak memory consumption was 120.9MB. Max. memory is 16.1GB. * Witness Printer took 400.70ms. Allocated memory is still 438.3MB. Free memory was 219.8MB in the beginning and 368.5MB in the end (delta: -148.7MB). Peak memory consumption was 130.0MB. 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 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 153 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.2s, OverallIterations: 11, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2145 SdHoareTripleChecker+Valid, 11.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1987 mSDsluCounter, 9895 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1033 IncrementalHoareTripleChecker+Unchecked, 8181 mSDsCounter, 1551 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10657 IncrementalHoareTripleChecker+Invalid, 13241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1551 mSolverCounterUnsat, 1714 mSDtfsCounter, 10657 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 971 GetRequests, 663 SyntacticMatches, 4 SemanticMatches, 304 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2827 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=6, InterpolantAutomatonStates: 179, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 374 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 321 PreInvPairs, 327 NumberOfFragments, 288 HoareAnnotationTreeSize, 321 FomulaSimplifications, 2528 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 62 FomulaSimplificationsInter, 143 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 1552 NumberOfCodeBlocks, 1552 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1538 ConstructedInterpolants, 33 QuantifiedInterpolants, 8107 SizeOfPredicates, 82 NumberOfNonLiveVariables, 8228 ConjunctsInSsa, 260 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 751/823 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6793]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 8985]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9347]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6800]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-07-19 22:21:07,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE