./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_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-?-6c24879 [2022-07-12 11:17:43,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:17:43,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:17:43,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:17:43,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:17:43,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:17:43,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:17:43,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:17:43,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:17:43,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:17:43,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:17:43,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:17:43,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:17:43,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:17:43,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:17:43,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:17:43,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:17:43,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:17:43,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:17:43,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:17:43,409 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:17:43,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:17:43,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:17:43,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:17:43,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:17:43,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:17:43,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:17:43,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:17:43,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:17:43,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:17:43,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:17:43,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:17:43,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:17:43,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:17:43,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:17:43,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:17:43,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:17:43,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:17:43,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:17:43,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:17:43,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:17:43,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:17:43,432 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:17:43,457 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:17:43,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:17:43,458 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:17:43,459 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:17:43,459 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:17:43,459 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:17:43,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:17:43,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:17:43,460 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:17:43,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:17:43,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:17:43,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:17:43,462 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:17:43,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:17:43,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:17:43,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:17:43,462 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:17:43,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:17:43,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:17:43,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:17:43,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:17:43,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:17:43,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:17:43,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:17:43,464 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:17:43,464 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:17:43,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:17:43,464 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:17:43,464 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:17:43,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:17:43,465 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-12 11:17:43,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:17:43,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:17:43,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:17:43,690 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:17:43,691 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:17:43,692 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-12 11:17:43,748 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b2779d61/4c3947950a244a9da9360f2e417c0805/FLAG03d3c241e [2022-07-12 11:17:44,352 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:17:44,354 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_new_from_string_harness.i [2022-07-12 11:17:44,387 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b2779d61/4c3947950a244a9da9360f2e417c0805/FLAG03d3c241e [2022-07-12 11:17:44,778 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b2779d61/4c3947950a244a9da9360f2e417c0805 [2022-07-12 11:17:44,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:17:44,781 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:17:44,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:17:44,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:17:44,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:17:44,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:17:44" (1/1) ... [2022-07-12 11:17:44,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f49732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:44, skipping insertion in model container [2022-07-12 11:17:44,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:17:44" (1/1) ... [2022-07-12 11:17:44,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:17:44,916 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:17:45,139 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-12 11:17:45,145 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-12 11:17:45,615 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:45,622 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:45,623 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:45,623 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:45,624 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:45,632 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:45,632 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:45,633 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:45,634 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:45,813 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:17:45,814 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:17:45,815 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:17:45,816 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:17:45,817 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:17:45,817 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:17:45,818 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:17:45,818 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:17:45,818 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:17:45,819 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:17:45,894 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:17:45,942 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:45,943 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:46,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:17:46,085 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:17:46,094 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-12 11:17:46,094 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-12 11:17:46,116 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:46,116 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:46,116 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:46,117 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:46,117 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:46,120 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:46,128 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:46,129 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:46,129 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:46,157 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:17:46,159 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:17:46,160 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:17:46,161 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:17:46,161 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:17:46,162 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:17:46,162 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:17:46,162 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:17:46,163 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:17:46,163 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:17:46,178 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:17:46,233 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:46,234 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:46,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:17:46,450 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:17:46,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:46 WrapperNode [2022-07-12 11:17:46,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:17:46,452 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:17:46,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:17:46,452 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:17:46,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:46" (1/1) ... [2022-07-12 11:17:46,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:46" (1/1) ... [2022-07-12 11:17:46,616 INFO L137 Inliner]: procedures = 690, calls = 2740, calls flagged for inlining = 59, calls inlined = 9, statements flattened = 831 [2022-07-12 11:17:46,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:17:46,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:17:46,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:17:46,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:17:46,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:46" (1/1) ... [2022-07-12 11:17:46,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:46" (1/1) ... [2022-07-12 11:17:46,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:46" (1/1) ... [2022-07-12 11:17:46,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:46" (1/1) ... [2022-07-12 11:17:46,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:46" (1/1) ... [2022-07-12 11:17:46,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:46" (1/1) ... [2022-07-12 11:17:46,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:46" (1/1) ... [2022-07-12 11:17:46,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:17:46,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:17:46,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:17:46,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:17:46,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:46" (1/1) ... [2022-07-12 11:17:46,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:17:46,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:17:46,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 11:17:46,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 11:17:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-12 11:17:46,763 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-12 11:17:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:17:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 11:17:46,764 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 11:17:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2022-07-12 11:17:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-07-12 11:17:46,765 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-07-12 11:17:46,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 11:17:46,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 11:17:46,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:17:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 11:17:46,766 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 11:17:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-12 11:17:46,767 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-12 11:17:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 11:17:46,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 11:17:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:17:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:17:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:17:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:17:46,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:17:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 11:17:46,768 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 11:17:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 11:17:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 11:17:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-07-12 11:17:46,769 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-07-12 11:17:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 11:17:46,770 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 11:17:46,770 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-07-12 11:17:46,770 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-07-12 11:17:46,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:17:46,770 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-12 11:17:46,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-12 11:17:46,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:17:46,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:17:46,770 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2022-07-12 11:17:46,771 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2022-07-12 11:17:46,771 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-12 11:17:46,771 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-12 11:17:46,771 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-12 11:17:46,771 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-12 11:17:46,771 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 11:17:46,771 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 11:17:46,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:17:46,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2022-07-12 11:17:46,772 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_string [2022-07-12 11:17:46,772 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_string [2022-07-12 11:17:46,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:17:47,007 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:17:47,008 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:17:47,140 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2022-07-12 11:17:47,873 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:17:47,892 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:17:47,892 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 11:17:47,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:17:47 BoogieIcfgContainer [2022-07-12 11:17:47,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:17:47,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:17:47,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:17:47,899 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:17:47,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:17:44" (1/3) ... [2022-07-12 11:17:47,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9cdbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:17:47, skipping insertion in model container [2022-07-12 11:17:47,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:46" (2/3) ... [2022-07-12 11:17:47,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9cdbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:17:47, skipping insertion in model container [2022-07-12 11:17:47,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:17:47" (3/3) ... [2022-07-12 11:17:47,902 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_string_harness.i [2022-07-12 11:17:47,912 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:17:47,912 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:17:47,959 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:17:47,967 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@7e125f3b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2603d69 [2022-07-12 11:17:47,968 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:17:47,971 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-12 11:17:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-12 11:17:47,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:47,982 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-12 11:17:47,983 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:47,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:47,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1670706302, now seen corresponding path program 1 times [2022-07-12 11:17:47,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:47,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724529541] [2022-07-12 11:17:47,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:47,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:17:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:17:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:17:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:17:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 11:17:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:48,591 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-12 11:17:48,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:48,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724529541] [2022-07-12 11:17:48,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724529541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:48,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:48,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:17:48,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429427972] [2022-07-12 11:17:48,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:48,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:17:48,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:48,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:17:48,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:17:48,624 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-12 11:17:49,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:49,026 INFO L93 Difference]: Finished difference Result 317 states and 419 transitions. [2022-07-12 11:17:49,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:17:49,028 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-12 11:17:49,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:49,040 INFO L225 Difference]: With dead ends: 317 [2022-07-12 11:17:49,041 INFO L226 Difference]: Without dead ends: 164 [2022-07-12 11:17:49,046 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-12 11:17:49,051 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:49,052 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.3s Time] [2022-07-12 11:17:49,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-12 11:17:49,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2022-07-12 11:17:49,086 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-12 11:17:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 183 transitions. [2022-07-12 11:17:49,088 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 183 transitions. Word has length 80 [2022-07-12 11:17:49,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:49,089 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 183 transitions. [2022-07-12 11:17:49,089 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-12 11:17:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 183 transitions. [2022-07-12 11:17:49,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-12 11:17:49,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:49,091 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-12 11:17:49,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:17:49,092 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:49,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:49,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2065694084, now seen corresponding path program 1 times [2022-07-12 11:17:49,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:49,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287637928] [2022-07-12 11:17:49,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:49,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:17:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:17:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:17:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:17:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 11:17:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:49,514 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-12 11:17:49,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:49,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287637928] [2022-07-12 11:17:49,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287637928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:49,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:49,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:17:49,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908244189] [2022-07-12 11:17:49,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:49,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:17:49,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:49,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:17:49,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:17:49,517 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-12 11:17:50,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:50,357 INFO L93 Difference]: Finished difference Result 240 states and 305 transitions. [2022-07-12 11:17:50,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:17:50,358 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-12 11:17:50,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:50,360 INFO L225 Difference]: With dead ends: 240 [2022-07-12 11:17:50,360 INFO L226 Difference]: Without dead ends: 193 [2022-07-12 11:17:50,360 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-12 11:17:50,361 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 78 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:50,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 803 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 11:17:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-12 11:17:50,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 152. [2022-07-12 11:17:50,372 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-12 11:17:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 188 transitions. [2022-07-12 11:17:50,373 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 188 transitions. Word has length 80 [2022-07-12 11:17:50,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:50,373 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 188 transitions. [2022-07-12 11:17:50,373 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-12 11:17:50,373 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2022-07-12 11:17:50,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-12 11:17:50,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:50,375 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-12 11:17:50,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 11:17:50,375 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:50,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:50,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1742615278, now seen corresponding path program 1 times [2022-07-12 11:17:50,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:50,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789186713] [2022-07-12 11:17:50,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:50,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:17:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:17:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:17:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:17:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 11:17:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:50,734 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-12 11:17:50,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:50,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789186713] [2022-07-12 11:17:50,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789186713] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:50,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:50,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:17:50,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208638923] [2022-07-12 11:17:50,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:50,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:17:50,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:50,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:17:50,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:17:50,740 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-12 11:17:51,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:51,462 INFO L93 Difference]: Finished difference Result 260 states and 338 transitions. [2022-07-12 11:17:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 11:17:51,462 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-12 11:17:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:51,464 INFO L225 Difference]: With dead ends: 260 [2022-07-12 11:17:51,464 INFO L226 Difference]: Without dead ends: 218 [2022-07-12 11:17:51,465 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-12 11:17:51,465 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 161 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:51,466 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.6s Time] [2022-07-12 11:17:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-12 11:17:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 160. [2022-07-12 11:17:51,477 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-12 11:17:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 199 transitions. [2022-07-12 11:17:51,478 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 199 transitions. Word has length 86 [2022-07-12 11:17:51,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:51,479 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 199 transitions. [2022-07-12 11:17:51,479 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-12 11:17:51,479 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 199 transitions. [2022-07-12 11:17:51,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-12 11:17:51,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:51,481 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-12 11:17:51,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 11:17:51,481 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:51,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:51,481 INFO L85 PathProgramCache]: Analyzing trace with hash -305918410, now seen corresponding path program 1 times [2022-07-12 11:17:51,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:51,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032657052] [2022-07-12 11:17:51,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:51,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:17:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:17:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:17:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:17:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:17:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:17:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:51,760 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-12 11:17:51,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:51,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032657052] [2022-07-12 11:17:51,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032657052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:51,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:51,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:17:51,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485812767] [2022-07-12 11:17:51,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:51,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:17:51,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:51,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:17:51,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:17:51,762 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-12 11:17:52,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:52,523 INFO L93 Difference]: Finished difference Result 256 states and 325 transitions. [2022-07-12 11:17:52,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 11:17:52,523 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-12 11:17:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:52,525 INFO L225 Difference]: With dead ends: 256 [2022-07-12 11:17:52,525 INFO L226 Difference]: Without dead ends: 216 [2022-07-12 11:17:52,525 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-12 11:17:52,526 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 92 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:52,526 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.7s Time] [2022-07-12 11:17:52,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-12 11:17:52,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 170. [2022-07-12 11:17:52,537 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-12 11:17:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 211 transitions. [2022-07-12 11:17:52,538 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 211 transitions. Word has length 95 [2022-07-12 11:17:52,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:52,538 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 211 transitions. [2022-07-12 11:17:52,539 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-12 11:17:52,539 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 211 transitions. [2022-07-12 11:17:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 11:17:52,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:52,540 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-12 11:17:52,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 11:17:52,541 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:52,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:52,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1965360267, now seen corresponding path program 1 times [2022-07-12 11:17:52,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:52,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698572520] [2022-07-12 11:17:52,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:52,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:17:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:17:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:17:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:17:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:17:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:17:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:17:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:52,976 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-12 11:17:52,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:52,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698572520] [2022-07-12 11:17:52,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698572520] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:17:52,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827719683] [2022-07-12 11:17:52,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:52,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:52,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:17:52,992 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-12 11:17:53,021 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-12 11:17:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:53,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 2690 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-12 11:17:53,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:17:53,539 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-12 11:17:55,488 INFO L356 Elim1Store]: treesize reduction 168, result has 24.0 percent of original size [2022-07-12 11:17:55,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 187 treesize of output 171 [2022-07-12 11:17:55,824 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-12 11:17:55,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:18:01,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827719683] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:18:01,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:18:01,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 30] total 42 [2022-07-12 11:18:01,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440496383] [2022-07-12 11:18:01,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:18:01,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-12 11:18:01,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:01,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-12 11:18:01,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2404, Unknown=0, NotChecked=0, Total=2550 [2022-07-12 11:18:01,890 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-12 11:18:07,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:07,037 INFO L93 Difference]: Finished difference Result 411 states and 527 transitions. [2022-07-12 11:18:07,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-12 11:18:07,038 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-12 11:18:07,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:07,040 INFO L225 Difference]: With dead ends: 411 [2022-07-12 11:18:07,040 INFO L226 Difference]: Without dead ends: 254 [2022-07-12 11:18:07,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1511 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=659, Invalid=7346, Unknown=5, NotChecked=0, Total=8010 [2022-07-12 11:18:07,043 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 485 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 4023 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:18:07,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 2236 Invalid, 5360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 4023 Invalid, 0 Unknown, 934 Unchecked, 2.9s Time] [2022-07-12 11:18:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-07-12 11:18:07,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 200. [2022-07-12 11:18:07,060 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-12 11:18:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 253 transitions. [2022-07-12 11:18:07,062 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 253 transitions. Word has length 103 [2022-07-12 11:18:07,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:07,062 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 253 transitions. [2022-07-12 11:18:07,062 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-12 11:18:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 253 transitions. [2022-07-12 11:18:07,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 11:18:07,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:07,064 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-12 11:18:07,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 11:18:07,283 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-12 11:18:07,283 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:07,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:07,284 INFO L85 PathProgramCache]: Analyzing trace with hash 848771971, now seen corresponding path program 1 times [2022-07-12 11:18:07,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:07,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376314541] [2022-07-12 11:18:07,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:07,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:07,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:18:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:07,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:18:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:07,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:18:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:07,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:07,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:18:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:07,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:18:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:07,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:18:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:07,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:18:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:07,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:18:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:07,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:18:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:07,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:07,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:18:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:07,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:18:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:07,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:07,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:18:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:07,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:18:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:07,635 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-12 11:18:07,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:07,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376314541] [2022-07-12 11:18:07,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376314541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:07,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:18:07,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-12 11:18:07,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218289787] [2022-07-12 11:18:07,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:07,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 11:18:07,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:07,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 11:18:07,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:18:07,638 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-12 11:18:08,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:08,905 INFO L93 Difference]: Finished difference Result 263 states and 343 transitions. [2022-07-12 11:18:08,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 11:18:08,908 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-12 11:18:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:08,910 INFO L225 Difference]: With dead ends: 263 [2022-07-12 11:18:08,910 INFO L226 Difference]: Without dead ends: 251 [2022-07-12 11:18:08,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2022-07-12 11:18:08,912 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 302 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:18:08,913 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.1s Time] [2022-07-12 11:18:08,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-12 11:18:08,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 205. [2022-07-12 11:18:08,934 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-12 11:18:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 260 transitions. [2022-07-12 11:18:08,935 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 260 transitions. Word has length 108 [2022-07-12 11:18:08,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:08,936 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 260 transitions. [2022-07-12 11:18:08,936 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-12 11:18:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 260 transitions. [2022-07-12 11:18:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 11:18:08,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:08,937 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-12 11:18:08,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 11:18:08,937 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:08,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:08,938 INFO L85 PathProgramCache]: Analyzing trace with hash -675274041, now seen corresponding path program 2 times [2022-07-12 11:18:08,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:08,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237863638] [2022-07-12 11:18:08,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:08,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:09,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:18:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:09,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:18:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:09,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:18:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:09,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:09,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:18:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:09,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:18:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:09,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:18:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:09,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:18:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:09,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:18:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:09,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:18:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:09,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:09,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:18:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:09,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:18:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:09,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:09,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:18:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:09,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:18:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:09,294 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-12 11:18:09,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:09,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237863638] [2022-07-12 11:18:09,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237863638] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:18:09,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094040125] [2022-07-12 11:18:09,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:18:09,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:18:09,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:18:09,296 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-12 11:18:09,297 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-12 11:18:09,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:18:09,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:18:09,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 2696 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 11:18:09,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:18:10,086 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-12 11:18:10,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:18:10,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094040125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:10,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:18:10,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [18] total 31 [2022-07-12 11:18:10,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6063651] [2022-07-12 11:18:10,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:10,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 11:18:10,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:10,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 11:18:10,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=865, Unknown=0, NotChecked=0, Total=930 [2022-07-12 11:18:10,088 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-12 11:18:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:10,423 INFO L93 Difference]: Finished difference Result 283 states and 360 transitions. [2022-07-12 11:18:10,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 11:18:10,424 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-12 11:18:10,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:10,426 INFO L225 Difference]: With dead ends: 283 [2022-07-12 11:18:10,426 INFO L226 Difference]: Without dead ends: 199 [2022-07-12 11:18:10,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=1367, Unknown=0, NotChecked=0, Total=1482 [2022-07-12 11:18:10,428 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-12 11:18:10,428 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-12 11:18:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-12 11:18:10,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 189. [2022-07-12 11:18:10,455 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-12 11:18:10,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 236 transitions. [2022-07-12 11:18:10,456 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 236 transitions. Word has length 108 [2022-07-12 11:18:10,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:10,456 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 236 transitions. [2022-07-12 11:18:10,456 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-12 11:18:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 236 transitions. [2022-07-12 11:18:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-12 11:18:10,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:10,459 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-12 11:18:10,495 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-12 11:18:10,675 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-12 11:18:10,675 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:10,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:10,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1176778786, now seen corresponding path program 1 times [2022-07-12 11:18:10,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:10,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137246436] [2022-07-12 11:18:10,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:10,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:10,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:18:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:10,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:18:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:10,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:18:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:10,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:10,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:18:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:10,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:18:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:10,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:18:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:10,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:18:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:10,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 11:18:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:10,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:10,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:18:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:10,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:18:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:10,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:10,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:18:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:10,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:18:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:10,948 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-12 11:18:10,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:10,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137246436] [2022-07-12 11:18:10,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137246436] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:10,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:18:10,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 11:18:10,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844775895] [2022-07-12 11:18:10,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:10,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 11:18:10,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:10,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 11:18:10,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:18:10,951 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-12 11:18:11,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:11,765 INFO L93 Difference]: Finished difference Result 305 states and 393 transitions. [2022-07-12 11:18:11,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 11:18:11,766 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-12 11:18:11,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:11,767 INFO L225 Difference]: With dead ends: 305 [2022-07-12 11:18:11,767 INFO L226 Difference]: Without dead ends: 242 [2022-07-12 11:18:11,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2022-07-12 11:18:11,768 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 361 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:18:11,769 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.7s Time] [2022-07-12 11:18:11,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-12 11:18:11,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 176. [2022-07-12 11:18:11,782 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-12 11:18:11,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 216 transitions. [2022-07-12 11:18:11,785 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 216 transitions. Word has length 99 [2022-07-12 11:18:11,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:11,786 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 216 transitions. [2022-07-12 11:18:11,786 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-12 11:18:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 216 transitions. [2022-07-12 11:18:11,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-12 11:18:11,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:11,789 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-12 11:18:11,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 11:18:11,790 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:11,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:11,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1796968396, now seen corresponding path program 1 times [2022-07-12 11:18:11,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:11,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781146909] [2022-07-12 11:18:11,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:11,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:11,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:18:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:11,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:18:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:11,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:18:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:11,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:11,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:18:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:11,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:18:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:18:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:18:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:18:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:18:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:18:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:18:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:18:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:18:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:18:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 11:18:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 11:18:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,152 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-12 11:18:12,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:12,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781146909] [2022-07-12 11:18:12,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781146909] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:12,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:18:12,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:18:12,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689608049] [2022-07-12 11:18:12,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:12,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:18:12,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:12,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:18:12,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:18:12,154 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-12 11:18:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:12,806 INFO L93 Difference]: Finished difference Result 269 states and 333 transitions. [2022-07-12 11:18:12,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 11:18:12,806 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-12 11:18:12,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:12,808 INFO L225 Difference]: With dead ends: 269 [2022-07-12 11:18:12,808 INFO L226 Difference]: Without dead ends: 193 [2022-07-12 11:18:12,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:18:12,809 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 179 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:18:12,809 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.5s Time] [2022-07-12 11:18:12,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-12 11:18:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 181. [2022-07-12 11:18:12,819 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-12 11:18:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 221 transitions. [2022-07-12 11:18:12,820 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 221 transitions. Word has length 141 [2022-07-12 11:18:12,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:12,820 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 221 transitions. [2022-07-12 11:18:12,820 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-12 11:18:12,820 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 221 transitions. [2022-07-12 11:18:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-12 11:18:12,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:12,821 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-12 11:18:12,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 11:18:12,822 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:12,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:12,822 INFO L85 PathProgramCache]: Analyzing trace with hash -897660901, now seen corresponding path program 1 times [2022-07-12 11:18:12,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:12,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545138445] [2022-07-12 11:18:12,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:12,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:18:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:18:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:18:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:18:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:18:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:18:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:12,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:18:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:13,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:18:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:13,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:18:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:13,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:18:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:13,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:13,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:18:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:13,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:13,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:13,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:18:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:13,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:18:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:13,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:18:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:13,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:13,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:18:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:13,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 11:18:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:13,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 11:18:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:13,125 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-12 11:18:13,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:13,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545138445] [2022-07-12 11:18:13,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545138445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:18:13,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:18:13,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 11:18:13,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344074483] [2022-07-12 11:18:13,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:18:13,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 11:18:13,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:13,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 11:18:13,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:18:13,128 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-12 11:18:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:14,007 INFO L93 Difference]: Finished difference Result 274 states and 341 transitions. [2022-07-12 11:18:14,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 11:18:14,008 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-12 11:18:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:14,009 INFO L225 Difference]: With dead ends: 274 [2022-07-12 11:18:14,009 INFO L226 Difference]: Without dead ends: 210 [2022-07-12 11:18:14,009 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-12 11:18:14,010 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 113 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:18:14,010 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.7s Time] [2022-07-12 11:18:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-12 11:18:14,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 186. [2022-07-12 11:18:14,021 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-12 11:18:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 226 transitions. [2022-07-12 11:18:14,022 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 226 transitions. Word has length 147 [2022-07-12 11:18:14,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:14,022 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 226 transitions. [2022-07-12 11:18:14,022 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-12 11:18:14,022 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 226 transitions. [2022-07-12 11:18:14,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-12 11:18:14,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:18:14,023 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-12 11:18:14,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 11:18:14,024 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:18:14,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:18:14,024 INFO L85 PathProgramCache]: Analyzing trace with hash -648190534, now seen corresponding path program 1 times [2022-07-12 11:18:14,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:18:14,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935180857] [2022-07-12 11:18:14,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:14,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:18:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:18:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:18:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:18:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:18:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:18:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:18:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:18:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:18:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:18:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:18:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:18:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:18:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:18:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:18:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:18:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:18:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:18:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 11:18:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,484 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-12 11:18:14,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:18:14,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935180857] [2022-07-12 11:18:14,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935180857] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:18:14,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061693631] [2022-07-12 11:18:14,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:18:14,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:18:14,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:18:14,486 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-12 11:18:14,487 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-12 11:18:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:18:14,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 2842 conjuncts, 132 conjunts are in the unsatisfiable core [2022-07-12 11:18:14,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:18:14,946 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-12 11:18:15,054 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-12 11:18:16,114 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-12 11:18:16,172 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-12 11:18:16,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:18:16,306 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-12 11:18:16,314 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 11:18:16,314 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-12 11:18:17,135 INFO L356 Elim1Store]: treesize reduction 168, result has 24.0 percent of original size [2022-07-12 11:18:17,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 231 treesize of output 191 [2022-07-12 11:18:17,367 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-12 11:18:17,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:18:18,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061693631] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:18:18,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:18:18,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 37] total 48 [2022-07-12 11:18:18,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999623802] [2022-07-12 11:18:18,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:18:18,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-12 11:18:18,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:18:18,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-12 11:18:18,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2791, Unknown=17, NotChecked=106, Total=3080 [2022-07-12 11:18:18,708 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-12 11:18:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:18:19,161 INFO L93 Difference]: Finished difference Result 198 states and 236 transitions. [2022-07-12 11:18:19,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 11:18:19,166 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-12 11:18:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:18:19,167 INFO L225 Difference]: With dead ends: 198 [2022-07-12 11:18:19,167 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 11:18:19,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 159 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=227, Invalid=3542, Unknown=17, NotChecked=120, Total=3906 [2022-07-12 11:18:19,168 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-12 11:18:19,169 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-12 11:18:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 11:18:19,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 11:18:19,169 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-12 11:18:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 11:18:19,169 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 147 [2022-07-12 11:18:19,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:18:19,170 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 11:18:19,170 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-12 11:18:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 11:18:19,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 11:18:19,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 11:18:19,195 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-12 11:18:19,393 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-12 11:18:19,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 11:18:19,602 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-12 11:18:19,602 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-07-12 11:18:19,602 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-07-12 11:18:19,602 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-07-12 11:18:19,602 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-12 11:18:19,602 INFO L902 garLoopResultBuilder]: At program point aws_mem_acquireENTRY(lines 6928 6938) the Hoare annotation is: true [2022-07-12 11:18:19,602 INFO L899 garLoopResultBuilder]: For program point L6934(lines 6934 6936) no Hoare annotation was computed. [2022-07-12 11:18:19,602 INFO L899 garLoopResultBuilder]: For program point L6935-1(line 6935) no Hoare annotation was computed. [2022-07-12 11:18:19,602 INFO L902 garLoopResultBuilder]: At program point L6935(line 6935) the Hoare annotation is: true [2022-07-12 11:18:19,602 INFO L899 garLoopResultBuilder]: For program point aws_mem_acquireEXIT(lines 6928 6938) no Hoare annotation was computed. [2022-07-12 11:18:19,602 INFO L902 garLoopResultBuilder]: At program point L6931-1(line 6931) the Hoare annotation is: true [2022-07-12 11:18:19,602 INFO L902 garLoopResultBuilder]: At program point L6931(line 6931) the Hoare annotation is: true [2022-07-12 11:18:19,602 INFO L899 garLoopResultBuilder]: For program point L6934-2(lines 6934 6936) no Hoare annotation was computed. [2022-07-12 11:18:19,602 INFO L899 garLoopResultBuilder]: For program point L6933(line 6933) no Hoare annotation was computed. [2022-07-12 11:18:19,602 INFO L899 garLoopResultBuilder]: For program point L6929-2(line 6929) no Hoare annotation was computed. [2022-07-12 11:18:19,602 INFO L902 garLoopResultBuilder]: At program point L6929-1(line 6929) the Hoare annotation is: true [2022-07-12 11:18:19,603 INFO L902 garLoopResultBuilder]: At program point L6929(line 6929) the Hoare annotation is: true [2022-07-12 11:18:19,603 INFO L899 garLoopResultBuilder]: For program point aws_mem_acquireFINAL(lines 6928 6938) no Hoare annotation was computed. [2022-07-12 11:18:19,603 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-12 11:18:19,603 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-12 11:18:19,603 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-12 11:18:19,603 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-07-12 11:18:19,603 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-07-12 11:18:19,603 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-07-12 11:18:19,603 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-07-12 11:18:19,603 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-07-12 11:18:19,603 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-07-12 11:18:19,603 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-07-12 11:18:19,603 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validFINAL(lines 6923 6926) no Hoare annotation was computed. [2022-07-12 11:18:19,603 INFO L899 garLoopResultBuilder]: For program point L6925-1(line 6925) no Hoare annotation was computed. [2022-07-12 11:18:19,603 INFO L902 garLoopResultBuilder]: At program point L6925(line 6925) the Hoare annotation is: true [2022-07-12 11:18:19,603 INFO L902 garLoopResultBuilder]: At program point aws_allocator_is_validENTRY(lines 6923 6926) the Hoare annotation is: true [2022-07-12 11:18:19,603 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validEXIT(lines 6923 6926) no Hoare annotation was computed. [2022-07-12 11:18:19,603 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-12 11:18:19,603 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-12 11:18:19,603 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-12 11:18:19,603 INFO L902 garLoopResultBuilder]: At program point __CPROVER_overflow_plusENTRY(lines 248 251) the Hoare annotation is: true [2022-07-12 11:18:19,603 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusFINAL(lines 248 251) no Hoare annotation was computed. [2022-07-12 11:18:19,603 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusEXIT(lines 248 251) no Hoare annotation was computed. [2022-07-12 11:18:19,603 INFO L899 garLoopResultBuilder]: For program point L8989(line 8989) no Hoare annotation was computed. [2022-07-12 11:18:19,603 INFO L899 garLoopResultBuilder]: For program point L8990-1(line 8990) no Hoare annotation was computed. [2022-07-12 11:18:19,603 INFO L902 garLoopResultBuilder]: At program point L8989-1(line 8989) the Hoare annotation is: true [2022-07-12 11:18:19,604 INFO L899 garLoopResultBuilder]: For program point L8989-2(line 8989) no Hoare annotation was computed. [2022-07-12 11:18:19,604 INFO L902 garLoopResultBuilder]: At program point aws_string_new_from_stringENTRY(lines 8988 8991) the Hoare annotation is: true [2022-07-12 11:18:19,604 INFO L902 garLoopResultBuilder]: At program point L8990(line 8990) the Hoare annotation is: true [2022-07-12 11:18:19,604 INFO L902 garLoopResultBuilder]: At program point L8989-4(line 8989) the Hoare annotation is: true [2022-07-12 11:18:19,604 INFO L899 garLoopResultBuilder]: For program point L8989-5(line 8989) no Hoare annotation was computed. [2022-07-12 11:18:19,604 INFO L899 garLoopResultBuilder]: For program point aws_string_new_from_stringEXIT(lines 8988 8991) no Hoare annotation was computed. [2022-07-12 11:18:19,604 INFO L899 garLoopResultBuilder]: For program point aws_string_new_from_stringFINAL(lines 8988 8991) no Hoare annotation was computed. [2022-07-12 11:18:19,604 INFO L902 garLoopResultBuilder]: At program point can_fail_mallocENTRY(lines 6899 6903) the Hoare annotation is: true [2022-07-12 11:18:19,604 INFO L899 garLoopResultBuilder]: For program point L6900-3(lines 6900 6902) no Hoare annotation was computed. [2022-07-12 11:18:19,604 INFO L902 garLoopResultBuilder]: At program point L6902(line 6902) the Hoare annotation is: true [2022-07-12 11:18:19,604 INFO L899 garLoopResultBuilder]: For program point can_fail_mallocFINAL(lines 6899 6903) no Hoare annotation was computed. [2022-07-12 11:18:19,604 INFO L899 garLoopResultBuilder]: For program point L6900-1(lines 6900 6902) no Hoare annotation was computed. [2022-07-12 11:18:19,604 INFO L899 garLoopResultBuilder]: For program point can_fail_mallocEXIT(lines 6899 6903) no Hoare annotation was computed. [2022-07-12 11:18:19,604 INFO L902 garLoopResultBuilder]: At program point L6900(line 6900) the Hoare annotation is: true [2022-07-12 11:18:19,604 INFO L899 garLoopResultBuilder]: For program point L6902-1(line 6902) no Hoare annotation was computed. [2022-07-12 11:18:19,604 INFO L902 garLoopResultBuilder]: At program point aws_string_new_from_arrayENTRY(lines 8964 8986) the Hoare annotation is: true [2022-07-12 11:18:19,604 INFO L899 garLoopResultBuilder]: For program point L8985-4(line 8985) no Hoare annotation was computed. [2022-07-12 11:18:19,604 INFO L902 garLoopResultBuilder]: At program point L8985-1(line 8985) the Hoare annotation is: true [2022-07-12 11:18:19,604 INFO L902 garLoopResultBuilder]: At program point L8983(line 8983) the Hoare annotation is: true [2022-07-12 11:18:19,611 INFO L899 garLoopResultBuilder]: For program point L8985-2(line 8985) no Hoare annotation was computed. [2022-07-12 11:18:19,611 INFO L899 garLoopResultBuilder]: For program point L8983-1(line 8983) no Hoare annotation was computed. [2022-07-12 11:18:19,612 INFO L902 garLoopResultBuilder]: At program point L8985-3(line 8985) the Hoare annotation is: true [2022-07-12 11:18:19,612 INFO L902 garLoopResultBuilder]: At program point L8973(line 8973) the Hoare annotation is: true [2022-07-12 11:18:19,612 INFO L899 garLoopResultBuilder]: For program point L8973-1(line 8973) no Hoare annotation was computed. [2022-07-12 11:18:19,613 INFO L902 garLoopResultBuilder]: At program point L8965(line 8965) the Hoare annotation is: true [2022-07-12 11:18:19,613 INFO L899 garLoopResultBuilder]: For program point aws_string_new_from_arrayFINAL(lines 8964 8986) no Hoare annotation was computed. [2022-07-12 11:18:19,613 INFO L902 garLoopResultBuilder]: At program point L8965-1(line 8965) the Hoare annotation is: true [2022-07-12 11:18:19,613 INFO L899 garLoopResultBuilder]: For program point aws_string_new_from_arrayEXIT(lines 8964 8986) no Hoare annotation was computed. [2022-07-12 11:18:19,613 INFO L899 garLoopResultBuilder]: For program point L8974(lines 8974 8978) no Hoare annotation was computed. [2022-07-12 11:18:19,613 INFO L902 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: true [2022-07-12 11:18:19,614 INFO L899 garLoopResultBuilder]: For program point L8968-1(line 8968) no Hoare annotation was computed. [2022-07-12 11:18:19,614 INFO L899 garLoopResultBuilder]: For program point L8966(line 8966) no Hoare annotation was computed. [2022-07-12 11:18:19,614 INFO L899 garLoopResultBuilder]: For program point L8968-2(lines 8968 8972) no Hoare annotation was computed. [2022-07-12 11:18:19,614 INFO L902 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2022-07-12 11:18:19,614 INFO L902 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: true [2022-07-12 11:18:19,615 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memcpyFINAL(line -1) no Hoare annotation was computed. [2022-07-12 11:18:19,615 INFO L902 garLoopResultBuilder]: At program point #Ultimate.C_memcpyENTRY(line -1) the Hoare annotation is: true [2022-07-12 11:18:19,615 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memcpyEXIT(line -1) no Hoare annotation was computed. [2022-07-12 11:18:19,615 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-12 11:18:19,615 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-12 11:18:19,616 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-12 11:18:19,616 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-12 11:18:19,616 INFO L902 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: true [2022-07-12 11:18:19,616 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2022-07-12 11:18:19,616 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2022-07-12 11:18:19,616 INFO L899 garLoopResultBuilder]: For program point L7317(lines 7317 7319) no Hoare annotation was computed. [2022-07-12 11:18:19,616 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-07-12 11:18:19,616 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-07-12 11:18:19,616 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-07-12 11:18:19,616 INFO L902 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: true [2022-07-12 11:18:19,617 INFO L902 garLoopResultBuilder]: At program point aws_add_size_checkedENTRY(lines 2613 2621) the Hoare annotation is: true [2022-07-12 11:18:19,617 INFO L902 garLoopResultBuilder]: At program point L2542(line 2542) the Hoare annotation is: true [2022-07-12 11:18:19,617 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2022-07-12 11:18:19,617 INFO L902 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: true [2022-07-12 11:18:19,617 INFO L899 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2022-07-12 11:18:19,618 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedFINAL(lines 2613 2621) no Hoare annotation was computed. [2022-07-12 11:18:19,618 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedEXIT(lines 2613 2621) no Hoare annotation was computed. [2022-07-12 11:18:19,618 INFO L895 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: false [2022-07-12 11:18:19,619 INFO L899 garLoopResultBuilder]: For program point L9338(lines 9338 9344) no Hoare annotation was computed. [2022-07-12 11:18:19,619 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-07-12 11:18:19,619 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2022-07-12 11:18:19,619 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-07-12 11:18:19,620 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-12 11:18:19,620 INFO L895 garLoopResultBuilder]: At program point L6803(lines 6800 6804) the Hoare annotation is: false [2022-07-12 11:18:19,620 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-12 11:18:19,620 INFO L895 garLoopResultBuilder]: At program point L6795(lines 6793 6798) the Hoare annotation is: false [2022-07-12 11:18:19,620 INFO L902 garLoopResultBuilder]: At program point L9347(line 9347) the Hoare annotation is: true [2022-07-12 11:18:19,620 INFO L899 garLoopResultBuilder]: For program point L9343-2(line 9343) no Hoare annotation was computed. [2022-07-12 11:18:19,620 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 11:18:19,621 INFO L895 garLoopResultBuilder]: At program point L9339(line 9339) the Hoare annotation is: false [2022-07-12 11:18:19,621 INFO L899 garLoopResultBuilder]: For program point L9339-1(line 9339) no Hoare annotation was computed. [2022-07-12 11:18:19,621 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 11:18:19,621 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 11:18:19,621 INFO L895 garLoopResultBuilder]: At program point L9343(line 9343) the Hoare annotation is: false [2022-07-12 11:18:19,621 INFO L895 garLoopResultBuilder]: At program point L9343-1(line 9343) the Hoare annotation is: false [2022-07-12 11:18:19,622 INFO L895 garLoopResultBuilder]: At program point L9335(line 9335) the Hoare annotation is: false [2022-07-12 11:18:19,622 INFO L899 garLoopResultBuilder]: For program point L9335-1(line 9335) no Hoare annotation was computed. [2022-07-12 11:18:19,622 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2022-07-12 11:18:19,622 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2022-07-12 11:18:19,622 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-07-12 11:18:19,622 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 11:18:19,622 INFO L895 garLoopResultBuilder]: At program point L9340(line 9340) the Hoare annotation is: false [2022-07-12 11:18:19,622 INFO L899 garLoopResultBuilder]: For program point L9340-1(line 9340) no Hoare annotation was computed. [2022-07-12 11:18:19,622 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-07-12 11:18:19,622 INFO L899 garLoopResultBuilder]: For program point L9332(line 9332) no Hoare annotation was computed. [2022-07-12 11:18:19,622 INFO L895 garLoopResultBuilder]: At program point L9332-2(line 9332) the Hoare annotation is: false [2022-07-12 11:18:19,623 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-07-12 11:18:19,623 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-12 11:18:19,623 INFO L899 garLoopResultBuilder]: For program point L9332-3(line 9332) no Hoare annotation was computed. [2022-07-12 11:18:19,623 INFO L899 garLoopResultBuilder]: For program point L9332-4(line 9332) no Hoare annotation was computed. [2022-07-12 11:18:19,623 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-07-12 11:18:19,623 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2022-07-12 11:18:19,623 INFO L895 garLoopResultBuilder]: At program point L9341(line 9341) the Hoare annotation is: false [2022-07-12 11:18:19,623 INFO L899 garLoopResultBuilder]: For program point L9341-1(line 9341) no Hoare annotation was computed. [2022-07-12 11:18:19,623 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: false [2022-07-12 11:18:19,623 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-12 11:18:19,624 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-07-12 11:18:19,624 INFO L899 garLoopResultBuilder]: For program point L9345-1(line 9345) no Hoare annotation was computed. [2022-07-12 11:18:19,624 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-07-12 11:18:19,624 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: false [2022-07-12 11:18:19,624 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-07-12 11:18:19,624 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-12 11:18:19,624 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-07-12 11:18:19,625 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-07-12 11:18:19,625 INFO L899 garLoopResultBuilder]: For program point L9329(lines 9329 9346) no Hoare annotation was computed. [2022-07-12 11:18:19,625 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-12 11:18:19,625 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-12 11:18:19,625 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-12 11:18:19,625 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-12 11:18:19,625 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-12 11:18:19,625 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-12 11:18:19,628 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:18:19,629 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 11:18:19,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 11:18:19 BoogieIcfgContainer [2022-07-12 11:18:19,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 11:18:19,643 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 11:18:19,643 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 11:18:19,643 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 11:18:19,644 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:17:47" (3/4) ... [2022-07-12 11:18:19,646 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 11:18:19,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_malloc [2022-07-12 11:18:19,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-12 11:18:19,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_acquire [2022-07-12 11:18:19,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_new_from_array [2022-07-12 11:18:19,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-12 11:18:19,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2022-07-12 11:18:19,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-12 11:18:19,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2022-07-12 11:18:19,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-12 11:18:19,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-07-12 11:18:19,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_allocator_is_valid [2022-07-12 11:18:19,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_add_size_checked [2022-07-12 11:18:19,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-12 11:18:19,651 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-12 11:18:19,651 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_plus [2022-07-12 11:18:19,651 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_new_from_string [2022-07-12 11:18:19,667 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 154 nodes and edges [2022-07-12 11:18:19,669 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 68 nodes and edges [2022-07-12 11:18:19,669 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-07-12 11:18:19,670 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-07-12 11:18:19,671 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-12 11:18:19,672 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-12 11:18:19,672 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 11:18:19,673 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 11:18:19,960 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 11:18:19,961 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 11:18:19,961 INFO L158 Benchmark]: Toolchain (without parser) took 35180.21ms. Allocated memory was 117.4MB in the beginning and 432.0MB in the end (delta: 314.6MB). Free memory was 77.2MB in the beginning and 235.4MB in the end (delta: -158.2MB). Peak memory consumption was 154.8MB. Max. memory is 16.1GB. [2022-07-12 11:18:19,961 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 79.7MB. Free memory was 37.2MB in the beginning and 37.2MB in the end (delta: 41.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:18:19,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1660.07ms. Allocated memory was 117.4MB in the beginning and 146.8MB in the end (delta: 29.4MB). Free memory was 77.2MB in the beginning and 51.5MB in the end (delta: 25.7MB). Peak memory consumption was 68.7MB. Max. memory is 16.1GB. [2022-07-12 11:18:19,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 165.01ms. Allocated memory is still 146.8MB. Free memory was 51.5MB in the beginning and 85.6MB in the end (delta: -34.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 11:18:19,962 INFO L158 Benchmark]: Boogie Preprocessor took 79.43ms. Allocated memory is still 146.8MB. Free memory was 85.6MB in the beginning and 78.5MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 11:18:19,962 INFO L158 Benchmark]: RCFGBuilder took 1197.02ms. Allocated memory was 146.8MB in the beginning and 241.2MB in the end (delta: 94.4MB). Free memory was 78.5MB in the beginning and 121.9MB in the end (delta: -43.4MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2022-07-12 11:18:19,963 INFO L158 Benchmark]: TraceAbstraction took 31747.75ms. Allocated memory was 241.2MB in the beginning and 432.0MB in the end (delta: 190.8MB). Free memory was 121.9MB in the beginning and 366.4MB in the end (delta: -244.5MB). Peak memory consumption was 196.1MB. Max. memory is 16.1GB. [2022-07-12 11:18:19,963 INFO L158 Benchmark]: Witness Printer took 317.63ms. Allocated memory is still 432.0MB. Free memory was 366.4MB in the beginning and 235.4MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-07-12 11:18:19,964 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.16ms. Allocated memory is still 79.7MB. Free memory was 37.2MB in the beginning and 37.2MB in the end (delta: 41.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1660.07ms. Allocated memory was 117.4MB in the beginning and 146.8MB in the end (delta: 29.4MB). Free memory was 77.2MB in the beginning and 51.5MB in the end (delta: 25.7MB). Peak memory consumption was 68.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 165.01ms. Allocated memory is still 146.8MB. Free memory was 51.5MB in the beginning and 85.6MB in the end (delta: -34.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.43ms. Allocated memory is still 146.8MB. Free memory was 85.6MB in the beginning and 78.5MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1197.02ms. Allocated memory was 146.8MB in the beginning and 241.2MB in the end (delta: 94.4MB). Free memory was 78.5MB in the beginning and 121.9MB in the end (delta: -43.4MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31747.75ms. Allocated memory was 241.2MB in the beginning and 432.0MB in the end (delta: 190.8MB). Free memory was 121.9MB in the beginning and 366.4MB in the end (delta: -244.5MB). Peak memory consumption was 196.1MB. Max. memory is 16.1GB. * Witness Printer took 317.63ms. Allocated memory is still 432.0MB. Free memory was 366.4MB in the beginning and 235.4MB in the end (delta: 131.1MB). 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: 31.7s, OverallIterations: 11, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2145 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1987 mSDsluCounter, 9895 SdHoareTripleChecker+Invalid, 7.6s 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, 2825 ImplicationChecksByTransitivity, 12.2s 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, 149 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 1552 NumberOfCodeBlocks, 1552 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1538 ConstructedInterpolants, 33 QuantifiedInterpolants, 8163 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-12 11:18:19,996 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