./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e19ca921 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_eq_byte_cursor_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 caa9ea3c4b01be424b9d4542ff8acdcb39307db8022d65ba85a629a6a4ef591a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 14:03:54,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 14:03:54,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 14:03:54,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 14:03:54,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 14:03:54,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 14:03:54,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 14:03:54,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 14:03:54,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 14:03:54,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 14:03:54,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 14:03:54,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 14:03:54,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 14:03:54,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 14:03:54,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 14:03:54,487 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 14:03:54,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 14:03:54,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 14:03:54,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 14:03:54,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 14:03:54,495 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 14:03:54,495 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 14:03:54,496 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 14:03:54,497 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 14:03:54,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 14:03:54,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 14:03:54,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 14:03:54,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 14:03:54,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 14:03:54,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 14:03:54,504 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 14:03:54,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 14:03:54,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 14:03:54,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 14:03:54,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 14:03:54,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 14:03:54,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 14:03:54,508 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 14:03:54,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 14:03:54,509 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 14:03:54,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 14:03:54,510 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-22 14:03:54,538 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 14:03:54,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 14:03:54,539 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 14:03:54,539 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 14:03:54,540 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 14:03:54,540 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 14:03:54,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 14:03:54,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 14:03:54,540 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 14:03:54,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 14:03:54,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 14:03:54,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 14:03:54,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 14:03:54,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 14:03:54,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 14:03:54,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 14:03:54,542 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 14:03:54,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 14:03:54,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 14:03:54,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 14:03:54,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 14:03:54,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 14:03:54,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 14:03:54,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 14:03:54,543 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 14:03:54,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 14:03:54,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 14:03:54,543 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 14:03:54,544 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 14:03:54,544 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 14:03:54,544 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 14:03:54,544 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 -> caa9ea3c4b01be424b9d4542ff8acdcb39307db8022d65ba85a629a6a4ef591a [2021-12-22 14:03:54,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 14:03:54,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 14:03:54,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 14:03:54,730 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 14:03:54,730 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 14:03:54,731 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i [2021-12-22 14:03:54,778 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9b49bbd3/3b2474189ffb47cb93b60c2029f391aa/FLAG937dce363 [2021-12-22 14:03:55,401 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 14:03:55,402 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i [2021-12-22 14:03:55,436 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9b49bbd3/3b2474189ffb47cb93b60c2029f391aa/FLAG937dce363 [2021-12-22 14:03:55,805 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9b49bbd3/3b2474189ffb47cb93b60c2029f391aa [2021-12-22 14:03:55,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 14:03:55,807 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 14:03:55,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 14:03:55,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 14:03:55,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 14:03:55,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:03:55" (1/1) ... [2021-12-22 14:03:55,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c080d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:03:55, skipping insertion in model container [2021-12-22 14:03:55,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:03:55" (1/1) ... [2021-12-22 14:03:55,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 14:03:55,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 14:03:56,111 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_eq_byte_cursor_harness.i[4499,4512] [2021-12-22 14:03:56,117 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_eq_byte_cursor_harness.i[4559,4572] [2021-12-22 14:03:56,826 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:56,827 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:56,828 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:56,828 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:56,830 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:56,844 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:56,845 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:56,847 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:56,847 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:57,061 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-22 14:03:57,062 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-22 14:03:57,063 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-22 14:03:57,064 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-22 14:03:57,065 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-22 14:03:57,065 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-22 14:03:57,065 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-22 14:03:57,066 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-22 14:03:57,066 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-22 14:03:57,066 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-22 14:03:57,183 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-22 14:03:57,267 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:57,268 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:57,344 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 14:03:57,387 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 14:03:57,404 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_eq_byte_cursor_harness.i[4499,4512] [2021-12-22 14:03:57,407 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_eq_byte_cursor_harness.i[4559,4572] [2021-12-22 14:03:57,440 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:57,441 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:57,441 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:57,442 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:57,442 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:57,446 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:57,446 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:57,447 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:57,447 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:57,473 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-22 14:03:57,474 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-22 14:03:57,474 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-22 14:03:57,474 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-22 14:03:57,475 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-22 14:03:57,475 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-22 14:03:57,475 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-22 14:03:57,476 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-22 14:03:57,476 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-22 14:03:57,476 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-22 14:03:57,487 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-22 14:03:57,556 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:57,557 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 14:03:57,592 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 14:03:57,746 INFO L208 MainTranslator]: Completed translation [2021-12-22 14:03:57,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:03:57 WrapperNode [2021-12-22 14:03:57,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 14:03:57,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 14:03:57,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 14:03:57,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 14:03:57,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:03:57" (1/1) ... [2021-12-22 14:03:57,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:03:57" (1/1) ... [2021-12-22 14:03:57,894 INFO L137 Inliner]: procedures = 693, calls = 2789, calls flagged for inlining = 60, calls inlined = 7, statements flattened = 869 [2021-12-22 14:03:57,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 14:03:57,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 14:03:57,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 14:03:57,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 14:03:57,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:03:57" (1/1) ... [2021-12-22 14:03:57,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:03:57" (1/1) ... [2021-12-22 14:03:57,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:03:57" (1/1) ... [2021-12-22 14:03:57,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:03:57" (1/1) ... [2021-12-22 14:03:57,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:03:57" (1/1) ... [2021-12-22 14:03:57,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:03:57" (1/1) ... [2021-12-22 14:03:57,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:03:57" (1/1) ... [2021-12-22 14:03:57,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 14:03:57,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 14:03:57,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 14:03:57,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 14:03:57,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:03:57" (1/1) ... [2021-12-22 14:03:57,964 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 14:03:57,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 14:03:57,984 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) [2021-12-22 14:03:58,002 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 [2021-12-22 14:03:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2021-12-22 14:03:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2021-12-22 14:03:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2021-12-22 14:03:58,013 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2021-12-22 14:03:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2021-12-22 14:03:58,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2021-12-22 14:03:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-22 14:03:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 14:03:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-22 14:03:58,014 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-22 14:03:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 14:03:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-22 14:03:58,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-22 14:03:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 14:03:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 14:03:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 14:03:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 14:03:58,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 14:03:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-22 14:03:58,016 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-22 14:03:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-22 14:03:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-22 14:03:58,016 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-22 14:03:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 14:03:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 14:03:58,017 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2021-12-22 14:03:58,017 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2021-12-22 14:03:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-22 14:03:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-12-22 14:03:58,018 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-12-22 14:03:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-22 14:03:58,018 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-22 14:03:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 14:03:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 14:03:58,230 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 14:03:58,231 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 14:03:59,035 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 14:03:59,040 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 14:03:59,040 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-22 14:03:59,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:03:59 BoogieIcfgContainer [2021-12-22 14:03:59,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 14:03:59,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 14:03:59,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 14:03:59,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 14:03:59,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 02:03:55" (1/3) ... [2021-12-22 14:03:59,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b675f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:03:59, skipping insertion in model container [2021-12-22 14:03:59,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:03:57" (2/3) ... [2021-12-22 14:03:59,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b675f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:03:59, skipping insertion in model container [2021-12-22 14:03:59,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:03:59" (3/3) ... [2021-12-22 14:03:59,047 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_cursor_harness.i [2021-12-22 14:03:59,050 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 14:03:59,050 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-22 14:03:59,078 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 14:03:59,088 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 14:03:59,088 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-22 14:03:59,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2021-12-22 14:03:59,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-22 14:03:59,110 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:03:59,111 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 14:03:59,111 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:03:59,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:03:59,118 INFO L85 PathProgramCache]: Analyzing trace with hash -386411024, now seen corresponding path program 1 times [2021-12-22 14:03:59,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:03:59,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667082303] [2021-12-22 14:03:59,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:03:59,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:03:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:03:59,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:03:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:03:59,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 14:03:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:03:59,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-22 14:03:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:03:59,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-22 14:03:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:03:59,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-22 14:03:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:03:59,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-22 14:03:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:03:59,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 14:03:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:03:59,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-22 14:03:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:03:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-22 14:03:59,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:03:59,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667082303] [2021-12-22 14:03:59,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667082303] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 14:03:59,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876166049] [2021-12-22 14:03:59,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:03:59,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:03:59,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 14:03:59,669 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) [2021-12-22 14:03:59,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 14:04:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:00,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-22 14:04:00,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 14:04:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-22 14:04:00,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 14:04:00,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876166049] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 14:04:00,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 14:04:00,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2021-12-22 14:04:00,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786616504] [2021-12-22 14:04:00,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 14:04:00,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-22 14:04:00,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:00,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-22 14:04:00,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-22 14:04:00,257 INFO L87 Difference]: Start difference. First operand has 125 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 14:04:00,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:00,288 INFO L93 Difference]: Finished difference Result 241 states and 335 transitions. [2021-12-22 14:04:00,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-22 14:04:00,290 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2021-12-22 14:04:00,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:00,297 INFO L225 Difference]: With dead ends: 241 [2021-12-22 14:04:00,297 INFO L226 Difference]: Without dead ends: 120 [2021-12-22 14:04:00,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-22 14:04:00,306 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:00,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 14:04:00,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-22 14:04:00,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2021-12-22 14:04:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 80 states have (on average 1.275) internal successors, (102), 81 states have internal predecessors, (102), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2021-12-22 14:04:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 159 transitions. [2021-12-22 14:04:00,341 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 159 transitions. Word has length 61 [2021-12-22 14:04:00,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:00,342 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 159 transitions. [2021-12-22 14:04:00,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 14:04:00,343 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 159 transitions. [2021-12-22 14:04:00,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-22 14:04:00,345 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:00,345 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 14:04:00,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-22 14:04:00,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-12-22 14:04:00,553 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:00,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:00,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1156835566, now seen corresponding path program 1 times [2021-12-22 14:04:00,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:00,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212695542] [2021-12-22 14:04:00,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:00,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:00,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:00,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 14:04:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:00,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-22 14:04:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:00,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-22 14:04:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:00,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-22 14:04:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:00,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-22 14:04:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:00,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 14:04:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:00,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-22 14:04:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-22 14:04:00,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:00,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212695542] [2021-12-22 14:04:00,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212695542] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 14:04:00,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151352962] [2021-12-22 14:04:00,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:00,770 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:00,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 14:04:00,771 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) [2021-12-22 14:04:00,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-22 14:04:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:01,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 14:04:01,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 14:04:01,271 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-22 14:04:01,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 14:04:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-22 14:04:01,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151352962] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-22 14:04:01,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-22 14:04:01,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 13 [2021-12-22 14:04:01,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306090969] [2021-12-22 14:04:01,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 14:04:01,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 14:04:01,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:01,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 14:04:01,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-12-22 14:04:01,429 INFO L87 Difference]: Start difference. First operand 120 states and 159 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-22 14:04:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:01,670 INFO L93 Difference]: Finished difference Result 208 states and 282 transitions. [2021-12-22 14:04:01,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 14:04:01,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 61 [2021-12-22 14:04:01,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:01,672 INFO L225 Difference]: With dead ends: 208 [2021-12-22 14:04:01,672 INFO L226 Difference]: Without dead ends: 155 [2021-12-22 14:04:01,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2021-12-22 14:04:01,674 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 241 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:01,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 548 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 14:04:01,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-22 14:04:01,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2021-12-22 14:04:01,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-22 14:04:01,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 177 transitions. [2021-12-22 14:04:01,685 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 177 transitions. Word has length 61 [2021-12-22 14:04:01,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:01,686 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 177 transitions. [2021-12-22 14:04:01,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-22 14:04:01,686 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 177 transitions. [2021-12-22 14:04:01,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-22 14:04:01,688 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:01,688 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 14:04:01,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-22 14:04:01,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-12-22 14:04:01,908 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:01,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:01,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1751928336, now seen corresponding path program 1 times [2021-12-22 14:04:01,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:01,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823455495] [2021-12-22 14:04:01,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:01,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:02,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:02,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 14:04:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:02,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-22 14:04:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:02,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-22 14:04:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:02,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-22 14:04:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-22 14:04:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:02,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 14:04:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:02,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-22 14:04:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:02,094 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-22 14:04:02,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:02,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823455495] [2021-12-22 14:04:02,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823455495] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 14:04:02,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030675777] [2021-12-22 14:04:02,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:02,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:02,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 14:04:02,096 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) [2021-12-22 14:04:02,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-22 14:04:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:02,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 14:04:02,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 14:04:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-22 14:04:02,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 14:04:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-22 14:04:02,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030675777] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 14:04:02,736 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 14:04:02,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2021-12-22 14:04:02,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469314237] [2021-12-22 14:04:02,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 14:04:02,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 14:04:02,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:02,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 14:04:02,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-22 14:04:02,737 INFO L87 Difference]: Start difference. First operand 132 states and 177 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) [2021-12-22 14:04:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:02,882 INFO L93 Difference]: Finished difference Result 230 states and 312 transitions. [2021-12-22 14:04:02,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 14:04:02,883 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) Word has length 61 [2021-12-22 14:04:02,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:02,891 INFO L225 Difference]: With dead ends: 230 [2021-12-22 14:04:02,891 INFO L226 Difference]: Without dead ends: 135 [2021-12-22 14:04:02,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-12-22 14:04:02,897 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 336 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:02,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 588 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 14:04:02,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-22 14:04:02,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-12-22 14:04:02,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 92 states have internal predecessors, (114), 33 states have call successors, (33), 10 states have call predecessors, (33), 11 states have return successors, (34), 32 states have call predecessors, (34), 32 states have call successors, (34) [2021-12-22 14:04:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 181 transitions. [2021-12-22 14:04:02,914 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 181 transitions. Word has length 61 [2021-12-22 14:04:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:02,916 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 181 transitions. [2021-12-22 14:04:02,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) [2021-12-22 14:04:02,916 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 181 transitions. [2021-12-22 14:04:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-22 14:04:02,921 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:02,922 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 14:04:02,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-22 14:04:03,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:03,135 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:03,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:03,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1531369667, now seen corresponding path program 1 times [2021-12-22 14:04:03,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:03,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96160653] [2021-12-22 14:04:03,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:03,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 14:04:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-22 14:04:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 14:04:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-22 14:04:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 14:04:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-22 14:04:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-22 14:04:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-22 14:04:03,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:03,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96160653] [2021-12-22 14:04:03,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96160653] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 14:04:03,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 14:04:03,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 14:04:03,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274250862] [2021-12-22 14:04:03,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 14:04:03,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 14:04:03,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:03,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 14:04:03,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 14:04:03,368 INFO L87 Difference]: Start difference. First operand 135 states and 181 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-22 14:04:03,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:03,387 INFO L93 Difference]: Finished difference Result 233 states and 317 transitions. [2021-12-22 14:04:03,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 14:04:03,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 65 [2021-12-22 14:04:03,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:03,389 INFO L225 Difference]: With dead ends: 233 [2021-12-22 14:04:03,389 INFO L226 Difference]: Without dead ends: 179 [2021-12-22 14:04:03,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 14:04:03,390 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 12 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:03,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 482 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 14:04:03,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-12-22 14:04:03,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2021-12-22 14:04:03,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 118 states have (on average 1.271186440677966) internal successors, (150), 120 states have internal predecessors, (150), 47 states have call successors, (47), 10 states have call predecessors, (47), 11 states have return successors, (50), 46 states have call predecessors, (50), 46 states have call successors, (50) [2021-12-22 14:04:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 247 transitions. [2021-12-22 14:04:03,402 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 247 transitions. Word has length 65 [2021-12-22 14:04:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:03,402 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 247 transitions. [2021-12-22 14:04:03,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-22 14:04:03,403 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 247 transitions. [2021-12-22 14:04:03,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-22 14:04:03,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:03,404 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2021-12-22 14:04:03,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 14:04:03,404 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:03,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:03,404 INFO L85 PathProgramCache]: Analyzing trace with hash -84293126, now seen corresponding path program 1 times [2021-12-22 14:04:03,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:03,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094003983] [2021-12-22 14:04:03,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:03,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 14:04:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-22 14:04:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 14:04:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-22 14:04:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 14:04:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-22 14:04:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-22 14:04:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-22 14:04:03,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:03,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094003983] [2021-12-22 14:04:03,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094003983] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 14:04:03,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 14:04:03,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 14:04:03,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533914140] [2021-12-22 14:04:03,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 14:04:03,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 14:04:03,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:03,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 14:04:03,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 14:04:03,645 INFO L87 Difference]: Start difference. First operand 177 states and 247 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-22 14:04:03,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:03,689 INFO L93 Difference]: Finished difference Result 188 states and 263 transitions. [2021-12-22 14:04:03,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 14:04:03,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 65 [2021-12-22 14:04:03,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:03,691 INFO L225 Difference]: With dead ends: 188 [2021-12-22 14:04:03,691 INFO L226 Difference]: Without dead ends: 181 [2021-12-22 14:04:03,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-22 14:04:03,692 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 16 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:03,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 1078 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 14:04:03,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-22 14:04:03,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-12-22 14:04:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 121 states have (on average 1.2644628099173554) internal successors, (153), 124 states have internal predecessors, (153), 47 states have call successors, (47), 10 states have call predecessors, (47), 12 states have return successors, (56), 46 states have call predecessors, (56), 46 states have call successors, (56) [2021-12-22 14:04:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 256 transitions. [2021-12-22 14:04:03,704 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 256 transitions. Word has length 65 [2021-12-22 14:04:03,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:03,704 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 256 transitions. [2021-12-22 14:04:03,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-22 14:04:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 256 transitions. [2021-12-22 14:04:03,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-22 14:04:03,705 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:03,705 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2021-12-22 14:04:03,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 14:04:03,705 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:03,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:03,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1359362750, now seen corresponding path program 1 times [2021-12-22 14:04:03,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:03,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365192476] [2021-12-22 14:04:03,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:03,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 14:04:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-22 14:04:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 14:04:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-22 14:04:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 14:04:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-22 14:04:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-22 14:04:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:03,979 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-22 14:04:03,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:03,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365192476] [2021-12-22 14:04:03,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365192476] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 14:04:03,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005575284] [2021-12-22 14:04:03,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:03,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:03,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 14:04:03,981 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 14:04:03,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-22 14:04:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:04,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 2507 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-22 14:04:04,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 14:04:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-22 14:04:04,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 14:04:05,188 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-12-22 14:04:05,223 INFO L353 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-22 14:04:05,224 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-12-22 14:04:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-22 14:04:05,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005575284] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 14:04:05,247 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 14:04:05,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2021-12-22 14:04:05,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014233302] [2021-12-22 14:04:05,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 14:04:05,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-22 14:04:05,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:05,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-22 14:04:05,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-12-22 14:04:05,248 INFO L87 Difference]: Start difference. First operand 181 states and 256 transitions. Second operand has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-22 14:04:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:05,820 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2021-12-22 14:04:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-22 14:04:05,821 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 69 [2021-12-22 14:04:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:05,823 INFO L225 Difference]: With dead ends: 334 [2021-12-22 14:04:05,823 INFO L226 Difference]: Without dead ends: 306 [2021-12-22 14:04:05,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 133 SyntacticMatches, 12 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2021-12-22 14:04:05,823 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 96 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:05,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 1862 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 380 Invalid, 0 Unknown, 140 Unchecked, 0.3s Time] [2021-12-22 14:04:05,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-12-22 14:04:05,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 270. [2021-12-22 14:04:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 184 states have (on average 1.2934782608695652) internal successors, (238), 188 states have internal predecessors, (238), 71 states have call successors, (71), 12 states have call predecessors, (71), 14 states have return successors, (82), 69 states have call predecessors, (82), 70 states have call successors, (82) [2021-12-22 14:04:05,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 391 transitions. [2021-12-22 14:04:05,842 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 391 transitions. Word has length 69 [2021-12-22 14:04:05,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:05,842 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 391 transitions. [2021-12-22 14:04:05,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-22 14:04:05,842 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 391 transitions. [2021-12-22 14:04:05,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-22 14:04:05,843 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:05,843 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2021-12-22 14:04:05,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-22 14:04:06,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:06,064 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:06,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:06,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1404727030, now seen corresponding path program 1 times [2021-12-22 14:04:06,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:06,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296671304] [2021-12-22 14:04:06,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:06,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:06,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:06,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 14:04:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:06,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-22 14:04:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:06,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-22 14:04:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:06,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 14:04:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:06,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-22 14:04:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:06,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-22 14:04:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:06,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-22 14:04:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-22 14:04:06,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:06,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296671304] [2021-12-22 14:04:06,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296671304] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 14:04:06,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354751113] [2021-12-22 14:04:06,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:06,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:06,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 14:04:06,270 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 14:04:06,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-22 14:04:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:06,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 2519 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-22 14:04:06,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 14:04:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-22 14:04:06,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 14:04:06,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354751113] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 14:04:06,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 14:04:06,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 10 [2021-12-22 14:04:06,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871325871] [2021-12-22 14:04:06,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 14:04:06,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 14:04:06,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:06,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 14:04:06,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-22 14:04:06,799 INFO L87 Difference]: Start difference. First operand 270 states and 391 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-22 14:04:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:06,905 INFO L93 Difference]: Finished difference Result 411 states and 598 transitions. [2021-12-22 14:04:06,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 14:04:06,906 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2021-12-22 14:04:06,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:06,908 INFO L225 Difference]: With dead ends: 411 [2021-12-22 14:04:06,908 INFO L226 Difference]: Without dead ends: 275 [2021-12-22 14:04:06,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-12-22 14:04:06,909 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:06,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1155 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 14:04:06,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-12-22 14:04:06,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2021-12-22 14:04:06,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 188 states have (on average 1.2872340425531914) internal successors, (242), 193 states have internal predecessors, (242), 71 states have call successors, (71), 12 states have call predecessors, (71), 15 states have return successors, (87), 69 states have call predecessors, (87), 70 states have call successors, (87) [2021-12-22 14:04:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 400 transitions. [2021-12-22 14:04:06,933 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 400 transitions. Word has length 73 [2021-12-22 14:04:06,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:06,934 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 400 transitions. [2021-12-22 14:04:06,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-22 14:04:06,934 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 400 transitions. [2021-12-22 14:04:06,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-22 14:04:06,938 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:06,938 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-22 14:04:06,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-22 14:04:07,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:07,159 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:07,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:07,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1686084061, now seen corresponding path program 1 times [2021-12-22 14:04:07,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:07,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359381385] [2021-12-22 14:04:07,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:07,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 14:04:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-22 14:04:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 14:04:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-22 14:04:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 14:04:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-22 14:04:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-22 14:04:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 14:04:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-12-22 14:04:07,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:07,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359381385] [2021-12-22 14:04:07,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359381385] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 14:04:07,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 14:04:07,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 14:04:07,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091343017] [2021-12-22 14:04:07,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 14:04:07,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 14:04:07,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:07,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 14:04:07,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 14:04:07,318 INFO L87 Difference]: Start difference. First operand 275 states and 400 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-22 14:04:07,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:07,366 INFO L93 Difference]: Finished difference Result 397 states and 565 transitions. [2021-12-22 14:04:07,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 14:04:07,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 76 [2021-12-22 14:04:07,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:07,367 INFO L225 Difference]: With dead ends: 397 [2021-12-22 14:04:07,368 INFO L226 Difference]: Without dead ends: 296 [2021-12-22 14:04:07,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 14:04:07,368 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 35 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:07,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 692 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 14:04:07,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-12-22 14:04:07,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 266. [2021-12-22 14:04:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 183 states have (on average 1.2513661202185793) internal successors, (229), 188 states have internal predecessors, (229), 67 states have call successors, (67), 12 states have call predecessors, (67), 15 states have return successors, (77), 65 states have call predecessors, (77), 66 states have call successors, (77) [2021-12-22 14:04:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 373 transitions. [2021-12-22 14:04:07,387 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 373 transitions. Word has length 76 [2021-12-22 14:04:07,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:07,387 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 373 transitions. [2021-12-22 14:04:07,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-22 14:04:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 373 transitions. [2021-12-22 14:04:07,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-22 14:04:07,389 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:07,389 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2021-12-22 14:04:07,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 14:04:07,389 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:07,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:07,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1559219441, now seen corresponding path program 1 times [2021-12-22 14:04:07,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:07,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321969679] [2021-12-22 14:04:07,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:07,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 14:04:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-22 14:04:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-22 14:04:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-22 14:04:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 14:04:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-22 14:04:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-22 14:04:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,594 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-22 14:04:07,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:07,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321969679] [2021-12-22 14:04:07,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321969679] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 14:04:07,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900658545] [2021-12-22 14:04:07,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:07,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:07,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 14:04:07,596 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 14:04:07,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-22 14:04:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:07,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 14:04:07,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 14:04:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-22 14:04:08,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 14:04:08,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900658545] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 14:04:08,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 14:04:08,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2021-12-22 14:04:08,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509845672] [2021-12-22 14:04:08,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 14:04:08,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 14:04:08,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:08,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 14:04:08,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-22 14:04:08,109 INFO L87 Difference]: Start difference. First operand 266 states and 373 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 14:04:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:08,227 INFO L93 Difference]: Finished difference Result 405 states and 571 transitions. [2021-12-22 14:04:08,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 14:04:08,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2021-12-22 14:04:08,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:08,228 INFO L225 Difference]: With dead ends: 405 [2021-12-22 14:04:08,228 INFO L226 Difference]: Without dead ends: 266 [2021-12-22 14:04:08,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-22 14:04:08,229 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 15 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:08,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 564 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2021-12-22 14:04:08,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-12-22 14:04:08,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-12-22 14:04:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 183 states have (on average 1.2459016393442623) internal successors, (228), 188 states have internal predecessors, (228), 67 states have call successors, (67), 12 states have call predecessors, (67), 15 states have return successors, (77), 65 states have call predecessors, (77), 66 states have call successors, (77) [2021-12-22 14:04:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 372 transitions. [2021-12-22 14:04:08,242 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 372 transitions. Word has length 75 [2021-12-22 14:04:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:08,242 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 372 transitions. [2021-12-22 14:04:08,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 14:04:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 372 transitions. [2021-12-22 14:04:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-22 14:04:08,243 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:08,243 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2021-12-22 14:04:08,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-22 14:04:08,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:08,459 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:08,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:08,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1115318767, now seen corresponding path program 1 times [2021-12-22 14:04:08,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:08,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679486974] [2021-12-22 14:04:08,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:08,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:08,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:08,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 14:04:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:08,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-22 14:04:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:08,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-22 14:04:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:08,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-22 14:04:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:08,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 14:04:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:08,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-22 14:04:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:08,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-22 14:04:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:08,806 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-22 14:04:08,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:08,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679486974] [2021-12-22 14:04:08,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679486974] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 14:04:08,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630987768] [2021-12-22 14:04:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:08,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:08,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 14:04:08,807 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 14:04:08,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-22 14:04:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:09,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 2529 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-22 14:04:09,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 14:04:09,240 INFO L387 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 13 treesize of output 9 [2021-12-22 14:04:09,244 INFO L387 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 13 treesize of output 9 [2021-12-22 14:04:09,671 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-22 14:04:09,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 14:04:09,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630987768] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 14:04:09,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 14:04:09,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2021-12-22 14:04:09,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059115959] [2021-12-22 14:04:09,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 14:04:09,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 14:04:09,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:09,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 14:04:09,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2021-12-22 14:04:09,674 INFO L87 Difference]: Start difference. First operand 266 states and 372 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-22 14:04:09,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:09,731 INFO L93 Difference]: Finished difference Result 422 states and 584 transitions. [2021-12-22 14:04:09,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 14:04:09,731 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 75 [2021-12-22 14:04:09,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:09,732 INFO L225 Difference]: With dead ends: 422 [2021-12-22 14:04:09,732 INFO L226 Difference]: Without dead ends: 273 [2021-12-22 14:04:09,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2021-12-22 14:04:09,733 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 46 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:09,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 706 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 31 Unchecked, 0.0s Time] [2021-12-22 14:04:09,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-12-22 14:04:09,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 270. [2021-12-22 14:04:09,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 187 states have (on average 1.2459893048128343) internal successors, (233), 191 states have internal predecessors, (233), 67 states have call successors, (67), 13 states have call predecessors, (67), 15 states have return successors, (77), 65 states have call predecessors, (77), 66 states have call successors, (77) [2021-12-22 14:04:09,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 377 transitions. [2021-12-22 14:04:09,746 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 377 transitions. Word has length 75 [2021-12-22 14:04:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:09,747 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 377 transitions. [2021-12-22 14:04:09,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-22 14:04:09,747 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 377 transitions. [2021-12-22 14:04:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-22 14:04:09,748 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:09,748 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2021-12-22 14:04:09,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-22 14:04:09,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:09,971 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:09,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:09,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1074644017, now seen corresponding path program 1 times [2021-12-22 14:04:09,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:09,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6986100] [2021-12-22 14:04:09,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:09,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:10,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:10,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 14:04:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:10,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-22 14:04:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:10,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-22 14:04:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:10,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-22 14:04:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:10,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 14:04:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:10,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-22 14:04:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:10,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-22 14:04:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-22 14:04:10,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:10,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6986100] [2021-12-22 14:04:10,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6986100] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 14:04:10,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768158978] [2021-12-22 14:04:10,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:10,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:10,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 14:04:10,096 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 14:04:10,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-22 14:04:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:10,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 14:04:10,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 14:04:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-22 14:04:10,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 14:04:10,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768158978] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 14:04:10,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 14:04:10,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2021-12-22 14:04:10,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701597750] [2021-12-22 14:04:10,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 14:04:10,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 14:04:10,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:10,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 14:04:10,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 14:04:10,562 INFO L87 Difference]: Start difference. First operand 270 states and 377 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 14:04:10,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:10,591 INFO L93 Difference]: Finished difference Result 414 states and 578 transitions. [2021-12-22 14:04:10,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 14:04:10,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2021-12-22 14:04:10,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:10,593 INFO L225 Difference]: With dead ends: 414 [2021-12-22 14:04:10,593 INFO L226 Difference]: Without dead ends: 274 [2021-12-22 14:04:10,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 14:04:10,594 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 9 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:10,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 462 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 14:04:10,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-12-22 14:04:10,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2021-12-22 14:04:10,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 188 states have (on average 1.2393617021276595) internal successors, (233), 192 states have internal predecessors, (233), 67 states have call successors, (67), 13 states have call predecessors, (67), 15 states have return successors, (75), 65 states have call predecessors, (75), 66 states have call successors, (75) [2021-12-22 14:04:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 375 transitions. [2021-12-22 14:04:10,608 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 375 transitions. Word has length 75 [2021-12-22 14:04:10,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:10,608 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 375 transitions. [2021-12-22 14:04:10,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 14:04:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 375 transitions. [2021-12-22 14:04:10,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-22 14:04:10,610 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:10,610 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-22 14:04:10,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-22 14:04:10,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-22 14:04:10,829 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:10,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:10,829 INFO L85 PathProgramCache]: Analyzing trace with hash -453034012, now seen corresponding path program 1 times [2021-12-22 14:04:10,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:10,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846023459] [2021-12-22 14:04:10,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:10,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:10,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:10,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 14:04:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:10,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-22 14:04:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:10,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 14:04:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:10,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-22 14:04:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:10,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 14:04:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:10,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-22 14:04:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:10,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-22 14:04:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:11,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 14:04:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:11,012 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-22 14:04:11,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:11,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846023459] [2021-12-22 14:04:11,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846023459] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 14:04:11,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817284244] [2021-12-22 14:04:11,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:11,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:11,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 14:04:11,014 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 14:04:11,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-22 14:04:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:11,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 2518 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-22 14:04:11,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 14:04:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-22 14:04:11,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 14:04:11,672 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-22 14:04:11,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817284244] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 14:04:11,673 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 14:04:11,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2021-12-22 14:04:11,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658141722] [2021-12-22 14:04:11,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 14:04:11,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-22 14:04:11,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:11,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-22 14:04:11,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-12-22 14:04:11,674 INFO L87 Difference]: Start difference. First operand 271 states and 375 transitions. Second operand has 20 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 11 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) [2021-12-22 14:04:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:11,931 INFO L93 Difference]: Finished difference Result 385 states and 522 transitions. [2021-12-22 14:04:11,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 14:04:11,931 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 11 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) Word has length 77 [2021-12-22 14:04:11,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:11,933 INFO L225 Difference]: With dead ends: 385 [2021-12-22 14:04:11,933 INFO L226 Difference]: Without dead ends: 292 [2021-12-22 14:04:11,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2021-12-22 14:04:11,933 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 406 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:11,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 1261 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 14:04:11,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-12-22 14:04:11,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 268. [2021-12-22 14:04:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 186 states have (on average 1.2365591397849462) internal successors, (230), 189 states have internal predecessors, (230), 67 states have call successors, (67), 13 states have call predecessors, (67), 14 states have return successors, (73), 65 states have call predecessors, (73), 66 states have call successors, (73) [2021-12-22 14:04:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 370 transitions. [2021-12-22 14:04:11,945 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 370 transitions. Word has length 77 [2021-12-22 14:04:11,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:11,945 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 370 transitions. [2021-12-22 14:04:11,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 11 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) [2021-12-22 14:04:11,946 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2021-12-22 14:04:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-22 14:04:11,947 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:11,947 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2021-12-22 14:04:11,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-22 14:04:12,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:12,160 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:12,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:12,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1814152958, now seen corresponding path program 1 times [2021-12-22 14:04:12,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:12,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617352976] [2021-12-22 14:04:12,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:12,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 14:04:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-22 14:04:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 14:04:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-22 14:04:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 14:04:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 14:04:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-22 14:04:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-22 14:04:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-22 14:04:12,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:12,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617352976] [2021-12-22 14:04:12,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617352976] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 14:04:12,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 14:04:12,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 14:04:12,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487422111] [2021-12-22 14:04:12,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 14:04:12,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 14:04:12,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:12,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 14:04:12,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 14:04:12,317 INFO L87 Difference]: Start difference. First operand 268 states and 370 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-22 14:04:12,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:12,350 INFO L93 Difference]: Finished difference Result 344 states and 465 transitions. [2021-12-22 14:04:12,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 14:04:12,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2021-12-22 14:04:12,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:12,351 INFO L225 Difference]: With dead ends: 344 [2021-12-22 14:04:12,351 INFO L226 Difference]: Without dead ends: 268 [2021-12-22 14:04:12,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 14:04:12,352 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 18 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:12,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 634 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 14:04:12,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-12-22 14:04:12,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 262. [2021-12-22 14:04:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 182 states have (on average 1.2087912087912087) internal successors, (220), 185 states have internal predecessors, (220), 65 states have call successors, (65), 13 states have call predecessors, (65), 14 states have return successors, (71), 63 states have call predecessors, (71), 64 states have call successors, (71) [2021-12-22 14:04:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 356 transitions. [2021-12-22 14:04:12,364 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 356 transitions. Word has length 78 [2021-12-22 14:04:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:12,364 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 356 transitions. [2021-12-22 14:04:12,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-22 14:04:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 356 transitions. [2021-12-22 14:04:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-22 14:04:12,365 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:12,366 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-22 14:04:12,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 14:04:12,366 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:12,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:12,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1823272801, now seen corresponding path program 1 times [2021-12-22 14:04:12,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:12,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442316163] [2021-12-22 14:04:12,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:12,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 14:04:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-22 14:04:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 14:04:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-22 14:04:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 14:04:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-22 14:04:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-22 14:04:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-22 14:04:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-22 14:04:12,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:12,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442316163] [2021-12-22 14:04:12,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442316163] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 14:04:12,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984327569] [2021-12-22 14:04:12,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:12,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:12,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 14:04:12,584 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 14:04:12,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-22 14:04:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:12,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 2523 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-22 14:04:12,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 14:04:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-22 14:04:13,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 14:04:13,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-12-22 14:04:13,802 INFO L353 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-22 14:04:13,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-12-22 14:04:13,827 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-22 14:04:13,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984327569] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 14:04:13,827 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 14:04:13,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2021-12-22 14:04:13,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177111217] [2021-12-22 14:04:13,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 14:04:13,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-22 14:04:13,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:13,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-22 14:04:13,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2021-12-22 14:04:13,828 INFO L87 Difference]: Start difference. First operand 262 states and 356 transitions. Second operand has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-22 14:04:14,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:14,499 INFO L93 Difference]: Finished difference Result 383 states and 526 transitions. [2021-12-22 14:04:14,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-22 14:04:14,500 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 79 [2021-12-22 14:04:14,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:14,502 INFO L225 Difference]: With dead ends: 383 [2021-12-22 14:04:14,502 INFO L226 Difference]: Without dead ends: 319 [2021-12-22 14:04:14,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 153 SyntacticMatches, 15 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-12-22 14:04:14,503 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 197 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:14,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 1582 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 453 Invalid, 0 Unknown, 179 Unchecked, 0.4s Time] [2021-12-22 14:04:14,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-12-22 14:04:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 254. [2021-12-22 14:04:14,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 176 states have (on average 1.1931818181818181) internal successors, (210), 179 states have internal predecessors, (210), 62 states have call successors, (62), 14 states have call predecessors, (62), 15 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2021-12-22 14:04:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 339 transitions. [2021-12-22 14:04:14,519 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 339 transitions. Word has length 79 [2021-12-22 14:04:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:14,519 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 339 transitions. [2021-12-22 14:04:14,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-22 14:04:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 339 transitions. [2021-12-22 14:04:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-22 14:04:14,521 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:14,521 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2021-12-22 14:04:14,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-22 14:04:14,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-22 14:04:14,730 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:14,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1762517655, now seen corresponding path program 1 times [2021-12-22 14:04:14,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:14,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82292688] [2021-12-22 14:04:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:14,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:14,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:14,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 14:04:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:14,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 14:04:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:15,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 14:04:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:15,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-22 14:04:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:15,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-22 14:04:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:15,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 14:04:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:15,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-22 14:04:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:15,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 14:04:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:15,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-22 14:04:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-22 14:04:15,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:15,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82292688] [2021-12-22 14:04:15,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82292688] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 14:04:15,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 14:04:15,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-22 14:04:15,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22517716] [2021-12-22 14:04:15,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 14:04:15,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 14:04:15,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:15,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 14:04:15,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-12-22 14:04:15,144 INFO L87 Difference]: Start difference. First operand 254 states and 339 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-22 14:04:15,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:15,691 INFO L93 Difference]: Finished difference Result 320 states and 431 transitions. [2021-12-22 14:04:15,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 14:04:15,691 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2021-12-22 14:04:15,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:15,693 INFO L225 Difference]: With dead ends: 320 [2021-12-22 14:04:15,694 INFO L226 Difference]: Without dead ends: 313 [2021-12-22 14:04:15,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-12-22 14:04:15,695 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 160 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:15,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 859 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 14:04:15,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-12-22 14:04:15,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 259. [2021-12-22 14:04:15,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 180 states have (on average 1.1888888888888889) internal successors, (214), 184 states have internal predecessors, (214), 62 states have call successors, (62), 14 states have call predecessors, (62), 16 states have return successors, (69), 60 states have call predecessors, (69), 60 states have call successors, (69) [2021-12-22 14:04:15,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 345 transitions. [2021-12-22 14:04:15,713 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 345 transitions. Word has length 86 [2021-12-22 14:04:15,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:15,714 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 345 transitions. [2021-12-22 14:04:15,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-22 14:04:15,714 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 345 transitions. [2021-12-22 14:04:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-22 14:04:15,715 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:15,716 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2021-12-22 14:04:15,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 14:04:15,716 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:15,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:15,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1504352217, now seen corresponding path program 1 times [2021-12-22 14:04:15,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:15,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632672667] [2021-12-22 14:04:15,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:15,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:15,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:15,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 14:04:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:15,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 14:04:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:15,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 14:04:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:15,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-22 14:04:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:15,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-22 14:04:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:15,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 14:04:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:15,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-22 14:04:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:15,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 14:04:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:15,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-22 14:04:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-22 14:04:15,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:15,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632672667] [2021-12-22 14:04:15,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632672667] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 14:04:15,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 14:04:15,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 14:04:15,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648284221] [2021-12-22 14:04:15,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 14:04:15,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 14:04:15,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:15,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 14:04:15,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 14:04:15,885 INFO L87 Difference]: Start difference. First operand 259 states and 345 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-22 14:04:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:16,077 INFO L93 Difference]: Finished difference Result 378 states and 492 transitions. [2021-12-22 14:04:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 14:04:16,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 86 [2021-12-22 14:04:16,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:16,079 INFO L225 Difference]: With dead ends: 378 [2021-12-22 14:04:16,079 INFO L226 Difference]: Without dead ends: 252 [2021-12-22 14:04:16,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 14:04:16,080 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 55 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:16,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 402 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 14:04:16,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-12-22 14:04:16,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2021-12-22 14:04:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 172 states have (on average 1.186046511627907) internal successors, (204), 175 states have internal predecessors, (204), 62 states have call successors, (62), 14 states have call predecessors, (62), 15 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2021-12-22 14:04:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 332 transitions. [2021-12-22 14:04:16,095 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 332 transitions. Word has length 86 [2021-12-22 14:04:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:16,095 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 332 transitions. [2021-12-22 14:04:16,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-22 14:04:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 332 transitions. [2021-12-22 14:04:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-22 14:04:16,096 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:16,097 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 14:04:16,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-22 14:04:16,097 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:16,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:16,097 INFO L85 PathProgramCache]: Analyzing trace with hash 858492976, now seen corresponding path program 1 times [2021-12-22 14:04:16,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:16,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499868700] [2021-12-22 14:04:16,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:16,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:16,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:16,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 14:04:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:16,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 14:04:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:16,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 14:04:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:16,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-22 14:04:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:16,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-22 14:04:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:16,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 14:04:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:16,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-22 14:04:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:16,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 14:04:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:16,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-22 14:04:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-22 14:04:16,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:16,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499868700] [2021-12-22 14:04:16,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499868700] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 14:04:16,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 14:04:16,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-22 14:04:16,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442961714] [2021-12-22 14:04:16,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 14:04:16,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-22 14:04:16,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:16,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-22 14:04:16,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-22 14:04:16,357 INFO L87 Difference]: Start difference. First operand 250 states and 332 transitions. Second operand has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-22 14:04:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:16,825 INFO L93 Difference]: Finished difference Result 260 states and 341 transitions. [2021-12-22 14:04:16,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 14:04:16,825 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 88 [2021-12-22 14:04:16,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:16,826 INFO L225 Difference]: With dead ends: 260 [2021-12-22 14:04:16,826 INFO L226 Difference]: Without dead ends: 213 [2021-12-22 14:04:16,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2021-12-22 14:04:16,827 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 76 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:16,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 1264 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 14:04:16,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-22 14:04:16,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 183. [2021-12-22 14:04:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 127 states have (on average 1.1653543307086613) internal successors, (148), 131 states have internal predecessors, (148), 40 states have call successors, (40), 14 states have call predecessors, (40), 15 states have return successors, (43), 37 states have call predecessors, (43), 39 states have call successors, (43) [2021-12-22 14:04:16,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 231 transitions. [2021-12-22 14:04:16,837 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 231 transitions. Word has length 88 [2021-12-22 14:04:16,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:16,837 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 231 transitions. [2021-12-22 14:04:16,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-22 14:04:16,837 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 231 transitions. [2021-12-22 14:04:16,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-22 14:04:16,838 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:16,838 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 14:04:16,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-22 14:04:16,839 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:16,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:16,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1641071482, now seen corresponding path program 1 times [2021-12-22 14:04:16,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:16,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867479401] [2021-12-22 14:04:16,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:16,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:16,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:16,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-22 14:04:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:17,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 14:04:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:17,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 14:04:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:17,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 14:04:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:17,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 14:04:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:17,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 14:04:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:17,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 14:04:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:17,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-22 14:04:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:17,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-22 14:04:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:17,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-22 14:04:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:17,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-22 14:04:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:17,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-22 14:04:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:17,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-22 14:04:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-22 14:04:17,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:17,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867479401] [2021-12-22 14:04:17,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867479401] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 14:04:17,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725077396] [2021-12-22 14:04:17,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:17,222 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:17,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 14:04:17,223 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 14:04:17,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-22 14:04:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:17,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 2646 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-22 14:04:17,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 14:04:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-22 14:04:17,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 14:04:17,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725077396] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 14:04:17,792 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 14:04:17,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 22 [2021-12-22 14:04:17,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177157038] [2021-12-22 14:04:17,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 14:04:17,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 14:04:17,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:17,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 14:04:17,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2021-12-22 14:04:17,793 INFO L87 Difference]: Start difference. First operand 183 states and 231 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2021-12-22 14:04:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:17,908 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2021-12-22 14:04:17,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 14:04:17,908 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) Word has length 99 [2021-12-22 14:04:17,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:17,909 INFO L225 Difference]: With dead ends: 219 [2021-12-22 14:04:17,909 INFO L226 Difference]: Without dead ends: 183 [2021-12-22 14:04:17,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-12-22 14:04:17,910 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 50 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:17,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 1228 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 14:04:17,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-22 14:04:17,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2021-12-22 14:04:17,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 127 states have (on average 1.1574803149606299) internal successors, (147), 131 states have internal predecessors, (147), 40 states have call successors, (40), 14 states have call predecessors, (40), 15 states have return successors, (43), 37 states have call predecessors, (43), 39 states have call successors, (43) [2021-12-22 14:04:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 230 transitions. [2021-12-22 14:04:17,921 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 230 transitions. Word has length 99 [2021-12-22 14:04:17,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:17,921 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 230 transitions. [2021-12-22 14:04:17,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2021-12-22 14:04:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2021-12-22 14:04:17,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-22 14:04:17,922 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:17,922 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 14:04:17,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-22 14:04:18,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-22 14:04:18,123 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:18,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:18,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1774035915, now seen corresponding path program 1 times [2021-12-22 14:04:18,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:18,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140419640] [2021-12-22 14:04:18,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:18,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:18,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:18,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-22 14:04:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:18,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 14:04:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:18,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 14:04:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:18,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 14:04:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:18,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 14:04:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:18,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 14:04:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:18,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 14:04:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:18,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-22 14:04:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:18,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-22 14:04:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:18,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-22 14:04:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:18,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-22 14:04:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:18,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-22 14:04:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:18,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-22 14:04:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-22 14:04:18,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:18,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140419640] [2021-12-22 14:04:18,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140419640] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 14:04:18,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872810602] [2021-12-22 14:04:18,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:18,452 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:18,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 14:04:18,453 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 14:04:18,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-22 14:04:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:18,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 2639 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-22 14:04:18,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 14:04:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-22 14:04:19,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 14:04:19,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872810602] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 14:04:19,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 14:04:19,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2021-12-22 14:04:19,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781265800] [2021-12-22 14:04:19,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 14:04:19,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 14:04:19,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:19,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 14:04:19,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2021-12-22 14:04:19,103 INFO L87 Difference]: Start difference. First operand 183 states and 230 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-22 14:04:19,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:19,207 INFO L93 Difference]: Finished difference Result 275 states and 355 transitions. [2021-12-22 14:04:19,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 14:04:19,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 100 [2021-12-22 14:04:19,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:19,209 INFO L225 Difference]: With dead ends: 275 [2021-12-22 14:04:19,209 INFO L226 Difference]: Without dead ends: 214 [2021-12-22 14:04:19,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2021-12-22 14:04:19,211 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 18 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:19,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 610 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 14:04:19,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-12-22 14:04:19,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 193. [2021-12-22 14:04:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 133 states have (on average 1.1353383458646618) internal successors, (151), 137 states have internal predecessors, (151), 44 states have call successors, (44), 14 states have call predecessors, (44), 15 states have return successors, (50), 41 states have call predecessors, (50), 43 states have call successors, (50) [2021-12-22 14:04:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 245 transitions. [2021-12-22 14:04:19,222 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 245 transitions. Word has length 100 [2021-12-22 14:04:19,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:19,223 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 245 transitions. [2021-12-22 14:04:19,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-22 14:04:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 245 transitions. [2021-12-22 14:04:19,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-22 14:04:19,224 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:19,224 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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] [2021-12-22 14:04:19,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-22 14:04:19,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:19,435 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:19,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:19,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1103291491, now seen corresponding path program 1 times [2021-12-22 14:04:19,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:19,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036836623] [2021-12-22 14:04:19,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:19,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:19,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:19,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-22 14:04:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:19,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 14:04:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:19,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 14:04:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:19,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 14:04:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:19,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 14:04:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:19,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 14:04:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:19,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 14:04:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:19,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-22 14:04:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:19,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-22 14:04:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:19,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-22 14:04:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:19,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-22 14:04:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:19,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-22 14:04:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:19,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-22 14:04:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:19,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-22 14:04:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-22 14:04:19,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:19,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036836623] [2021-12-22 14:04:19,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036836623] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 14:04:19,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411838430] [2021-12-22 14:04:19,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:19,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:19,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 14:04:19,808 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 14:04:19,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-22 14:04:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:20,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 2667 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-22 14:04:20,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 14:04:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 23 proven. 28 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-22 14:04:20,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 14:04:20,631 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-22 14:04:20,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411838430] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-22 14:04:20,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-22 14:04:20,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18, 7] total 27 [2021-12-22 14:04:20,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457611854] [2021-12-22 14:04:20,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 14:04:20,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 14:04:20,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:20,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 14:04:20,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=641, Unknown=0, NotChecked=0, Total=702 [2021-12-22 14:04:20,633 INFO L87 Difference]: Start difference. First operand 193 states and 245 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2021-12-22 14:04:20,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:20,832 INFO L93 Difference]: Finished difference Result 268 states and 338 transitions. [2021-12-22 14:04:20,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 14:04:20,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 109 [2021-12-22 14:04:20,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:20,834 INFO L225 Difference]: With dead ends: 268 [2021-12-22 14:04:20,834 INFO L226 Difference]: Without dead ends: 214 [2021-12-22 14:04:20,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2021-12-22 14:04:20,835 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 202 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:20,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 601 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 14:04:20,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-12-22 14:04:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 193. [2021-12-22 14:04:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 133 states have (on average 1.1203007518796992) internal successors, (149), 137 states have internal predecessors, (149), 44 states have call successors, (44), 14 states have call predecessors, (44), 15 states have return successors, (50), 41 states have call predecessors, (50), 43 states have call successors, (50) [2021-12-22 14:04:20,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 243 transitions. [2021-12-22 14:04:20,846 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 243 transitions. Word has length 109 [2021-12-22 14:04:20,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:20,847 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 243 transitions. [2021-12-22 14:04:20,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2021-12-22 14:04:20,847 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 243 transitions. [2021-12-22 14:04:20,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-22 14:04:20,848 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:20,848 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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] [2021-12-22 14:04:20,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-22 14:04:21,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-12-22 14:04:21,064 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:21,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:21,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2087155491, now seen corresponding path program 1 times [2021-12-22 14:04:21,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:21,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238261860] [2021-12-22 14:04:21,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:21,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:21,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:21,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-22 14:04:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:21,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 14:04:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:21,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 14:04:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:21,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 14:04:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:21,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 14:04:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:21,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 14:04:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:21,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 14:04:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:21,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-22 14:04:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:21,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-22 14:04:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:21,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-22 14:04:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:21,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-22 14:04:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:21,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-22 14:04:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:21,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-22 14:04:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:21,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-22 14:04:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-22 14:04:21,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:21,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238261860] [2021-12-22 14:04:21,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238261860] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 14:04:21,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727888842] [2021-12-22 14:04:21,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:21,400 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:21,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 14:04:21,401 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 14:04:21,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-22 14:04:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:21,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 2662 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-22 14:04:21,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 14:04:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-22 14:04:21,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 14:04:21,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727888842] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 14:04:21,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 14:04:21,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 22 [2021-12-22 14:04:21,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758472789] [2021-12-22 14:04:21,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 14:04:21,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 14:04:21,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:21,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 14:04:21,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2021-12-22 14:04:21,942 INFO L87 Difference]: Start difference. First operand 193 states and 243 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-22 14:04:22,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:22,042 INFO L93 Difference]: Finished difference Result 271 states and 326 transitions. [2021-12-22 14:04:22,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 14:04:22,042 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 109 [2021-12-22 14:04:22,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:22,043 INFO L225 Difference]: With dead ends: 271 [2021-12-22 14:04:22,043 INFO L226 Difference]: Without dead ends: 183 [2021-12-22 14:04:22,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-12-22 14:04:22,044 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 33 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:22,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 1259 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 14:04:22,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-22 14:04:22,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2021-12-22 14:04:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 127 states have (on average 1.110236220472441) internal successors, (141), 131 states have internal predecessors, (141), 40 states have call successors, (40), 14 states have call predecessors, (40), 15 states have return successors, (43), 37 states have call predecessors, (43), 39 states have call successors, (43) [2021-12-22 14:04:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 224 transitions. [2021-12-22 14:04:22,053 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 224 transitions. Word has length 109 [2021-12-22 14:04:22,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:22,054 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 224 transitions. [2021-12-22 14:04:22,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-22 14:04:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 224 transitions. [2021-12-22 14:04:22,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-22 14:04:22,055 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:22,055 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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] [2021-12-22 14:04:22,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-22 14:04:22,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:22,256 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:22,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:22,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1526938213, now seen corresponding path program 1 times [2021-12-22 14:04:22,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:22,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718654158] [2021-12-22 14:04:22,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:22,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-22 14:04:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 14:04:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 14:04:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 14:04:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 14:04:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 14:04:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 14:04:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-22 14:04:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-22 14:04:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-22 14:04:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-22 14:04:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-22 14:04:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-22 14:04:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-22 14:04:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-22 14:04:22,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:22,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718654158] [2021-12-22 14:04:22,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718654158] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 14:04:22,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 14:04:22,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 14:04:22,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039022918] [2021-12-22 14:04:22,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 14:04:22,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 14:04:22,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:22,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 14:04:22,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 14:04:22,422 INFO L87 Difference]: Start difference. First operand 183 states and 224 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-22 14:04:22,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:22,608 INFO L93 Difference]: Finished difference Result 219 states and 264 transitions. [2021-12-22 14:04:22,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 14:04:22,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 109 [2021-12-22 14:04:22,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:22,610 INFO L225 Difference]: With dead ends: 219 [2021-12-22 14:04:22,610 INFO L226 Difference]: Without dead ends: 164 [2021-12-22 14:04:22,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-22 14:04:22,610 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 47 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:22,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 385 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 14:04:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-22 14:04:22,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2021-12-22 14:04:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 114 states have (on average 1.0964912280701755) internal successors, (125), 117 states have internal predecessors, (125), 34 states have call successors, (34), 14 states have call predecessors, (34), 15 states have return successors, (37), 32 states have call predecessors, (37), 33 states have call successors, (37) [2021-12-22 14:04:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 196 transitions. [2021-12-22 14:04:22,619 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 196 transitions. Word has length 109 [2021-12-22 14:04:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:22,619 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 196 transitions. [2021-12-22 14:04:22,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-22 14:04:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2021-12-22 14:04:22,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-22 14:04:22,620 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:22,620 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 14:04:22,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-22 14:04:22,620 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:22,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:22,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2132558451, now seen corresponding path program 1 times [2021-12-22 14:04:22,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:22,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196799401] [2021-12-22 14:04:22,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:22,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-22 14:04:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 14:04:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 14:04:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 14:04:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 14:04:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 14:04:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 14:04:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-22 14:04:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-22 14:04:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-22 14:04:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-22 14:04:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-22 14:04:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-22 14:04:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-22 14:04:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-22 14:04:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 14:04:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 14:04:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-22 14:04:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2021-12-22 14:04:22,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:22,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196799401] [2021-12-22 14:04:22,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196799401] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 14:04:22,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 14:04:22,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 14:04:22,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537045932] [2021-12-22 14:04:22,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 14:04:22,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 14:04:22,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:22,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 14:04:22,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-22 14:04:22,822 INFO L87 Difference]: Start difference. First operand 164 states and 196 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-22 14:04:23,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:23,071 INFO L93 Difference]: Finished difference Result 203 states and 239 transitions. [2021-12-22 14:04:23,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 14:04:23,071 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 134 [2021-12-22 14:04:23,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:23,072 INFO L225 Difference]: With dead ends: 203 [2021-12-22 14:04:23,072 INFO L226 Difference]: Without dead ends: 164 [2021-12-22 14:04:23,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-22 14:04:23,073 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 48 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:23,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 544 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 14:04:23,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-22 14:04:23,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2021-12-22 14:04:23,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 114 states have (on average 1.087719298245614) internal successors, (124), 117 states have internal predecessors, (124), 34 states have call successors, (34), 14 states have call predecessors, (34), 15 states have return successors, (37), 32 states have call predecessors, (37), 33 states have call successors, (37) [2021-12-22 14:04:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 195 transitions. [2021-12-22 14:04:23,082 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 195 transitions. Word has length 134 [2021-12-22 14:04:23,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:23,082 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 195 transitions. [2021-12-22 14:04:23,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-22 14:04:23,083 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 195 transitions. [2021-12-22 14:04:23,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-22 14:04:23,083 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 14:04:23,084 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 14:04:23,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-22 14:04:23,084 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 14:04:23,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 14:04:23,084 INFO L85 PathProgramCache]: Analyzing trace with hash 284756267, now seen corresponding path program 1 times [2021-12-22 14:04:23,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 14:04:23,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022079120] [2021-12-22 14:04:23,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:23,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 14:04:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 14:04:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-22 14:04:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 14:04:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 14:04:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 14:04:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 14:04:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 14:04:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 14:04:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-22 14:04:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-22 14:04:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-22 14:04:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-22 14:04:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-22 14:04:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-22 14:04:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-22 14:04:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-22 14:04:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 14:04:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-22 14:04:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-22 14:04:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,443 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-12-22 14:04:23,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 14:04:23,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022079120] [2021-12-22 14:04:23,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022079120] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 14:04:23,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086040913] [2021-12-22 14:04:23,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 14:04:23,444 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:23,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 14:04:23,445 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 14:04:23,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-22 14:04:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 14:04:23,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 2752 conjuncts, 99 conjunts are in the unsatisfiable core [2021-12-22 14:04:23,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 14:04:26,425 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-22 14:04:26,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 14:04:29,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086040913] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 14:04:29,880 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 14:04:29,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 34] total 44 [2021-12-22 14:04:29,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437447747] [2021-12-22 14:04:29,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 14:04:29,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-22 14:04:29,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 14:04:29,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-22 14:04:29,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2992, Unknown=0, NotChecked=0, Total=3192 [2021-12-22 14:04:29,882 INFO L87 Difference]: Start difference. First operand 164 states and 195 transitions. Second operand has 44 states, 38 states have (on average 3.236842105263158) internal successors, (123), 33 states have internal predecessors, (123), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) [2021-12-22 14:04:30,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 14:04:30,532 INFO L93 Difference]: Finished difference Result 179 states and 207 transitions. [2021-12-22 14:04:30,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 14:04:30,533 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 38 states have (on average 3.236842105263158) internal successors, (123), 33 states have internal predecessors, (123), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) Word has length 135 [2021-12-22 14:04:30,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 14:04:30,533 INFO L225 Difference]: With dead ends: 179 [2021-12-22 14:04:30,533 INFO L226 Difference]: Without dead ends: 0 [2021-12-22 14:04:30,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 142 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=287, Invalid=4405, Unknown=0, NotChecked=0, Total=4692 [2021-12-22 14:04:30,535 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 42 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 14:04:30,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 503 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 489 Invalid, 0 Unknown, 54 Unchecked, 0.3s Time] [2021-12-22 14:04:30,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-22 14:04:30,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-22 14:04:30,536 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) [2021-12-22 14:04:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-22 14:04:30,536 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2021-12-22 14:04:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 14:04:30,536 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-22 14:04:30,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 38 states have (on average 3.236842105263158) internal successors, (123), 33 states have internal predecessors, (123), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) [2021-12-22 14:04:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-22 14:04:30,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-22 14:04:30,538 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-22 14:04:30,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-22 14:04:30,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 14:04:30,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-22 14:04:32,397 INFO L854 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 0))) [2021-12-22 14:04:32,397 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2021-12-22 14:04:32,397 INFO L854 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) [2021-12-22 14:04:32,397 INFO L858 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2021-12-22 14:04:32,397 INFO L854 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (or (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (or (<= 0 (+ (* 18446744073709551616 (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) .cse0) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or .cse0 (let ((.cse1 (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)))) (<= .cse1 (+ |ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ .cse1 15 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616)))))) (= |old(#valid)| |#valid|))) (not (< 0 |#StackHeapBarrier|))) [2021-12-22 14:04:32,397 INFO L858 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2021-12-22 14:04:32,397 INFO L854 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) [2021-12-22 14:04:32,397 INFO L858 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2021-12-22 14:04:32,397 INFO L854 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2021-12-22 14:04:32,397 INFO L854 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (not (< 0 |#StackHeapBarrier|))) [2021-12-22 14:04:32,397 INFO L858 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2021-12-22 14:04:32,397 INFO L858 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2021-12-22 14:04:32,397 INFO L854 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2021-12-22 14:04:32,398 INFO L858 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2021-12-22 14:04:32,398 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2021-12-22 14:04:32,398 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2021-12-22 14:04:32,398 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2021-12-22 14:04:32,398 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2021-12-22 14:04:32,398 INFO L858 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2021-12-22 14:04:32,398 INFO L854 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2021-12-22 14:04:32,398 INFO L861 garLoopResultBuilder]: At program point aws_array_eqENTRY(lines 7684 7704) the Hoare annotation is: true [2021-12-22 14:04:32,398 INFO L858 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2021-12-22 14:04:32,398 INFO L858 garLoopResultBuilder]: For program point aws_array_eqEXIT(lines 7684 7704) no Hoare annotation was computed. [2021-12-22 14:04:32,398 INFO L861 garLoopResultBuilder]: At program point L7686(line 7686) the Hoare annotation is: true [2021-12-22 14:04:32,398 INFO L858 garLoopResultBuilder]: For program point L7688(lines 7685 7704) no Hoare annotation was computed. [2021-12-22 14:04:32,398 INFO L858 garLoopResultBuilder]: For program point aws_array_eqFINAL(lines 7684 7704) no Hoare annotation was computed. [2021-12-22 14:04:32,398 INFO L861 garLoopResultBuilder]: At program point L7686-1(line 7686) the Hoare annotation is: true [2021-12-22 14:04:32,398 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2021-12-22 14:04:32,398 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2021-12-22 14:04:32,398 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2021-12-22 14:04:32,399 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-22 14:04:32,399 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-22 14:04:32,399 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-22 14:04:32,399 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-22 14:04:32,399 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2021-12-22 14:04:32,399 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2021-12-22 14:04:32,404 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2021-12-22 14:04:32,404 INFO L861 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2021-12-22 14:04:32,404 INFO L858 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2021-12-22 14:04:32,404 INFO L858 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2021-12-22 14:04:32,404 INFO L858 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2021-12-22 14:04:32,404 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2021-12-22 14:04:32,404 INFO L858 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2021-12-22 14:04:32,404 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2021-12-22 14:04:32,404 INFO L861 garLoopResultBuilder]: At program point aws_byte_cursor_is_validENTRY(lines 7368 7372) the Hoare annotation is: true [2021-12-22 14:04:32,404 INFO L858 garLoopResultBuilder]: For program point L7371(line 7371) no Hoare annotation was computed. [2021-12-22 14:04:32,404 INFO L858 garLoopResultBuilder]: For program point L7371-5(line 7371) no Hoare annotation was computed. [2021-12-22 14:04:32,404 INFO L858 garLoopResultBuilder]: For program point L7371-4(line 7371) no Hoare annotation was computed. [2021-12-22 14:04:32,404 INFO L858 garLoopResultBuilder]: For program point L7371-2(line 7371) no Hoare annotation was computed. [2021-12-22 14:04:32,404 INFO L858 garLoopResultBuilder]: For program point L7371-8(line 7371) no Hoare annotation was computed. [2021-12-22 14:04:32,404 INFO L858 garLoopResultBuilder]: For program point L7371-6(line 7371) no Hoare annotation was computed. [2021-12-22 14:04:32,405 INFO L858 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7368 7372) no Hoare annotation was computed. [2021-12-22 14:04:32,405 INFO L858 garLoopResultBuilder]: For program point L7371-11(line 7371) no Hoare annotation was computed. [2021-12-22 14:04:32,405 INFO L858 garLoopResultBuilder]: For program point L7371-10(line 7371) no Hoare annotation was computed. [2021-12-22 14:04:32,405 INFO L858 garLoopResultBuilder]: For program point L7370(lines 7370 7371) no Hoare annotation was computed. [2021-12-22 14:04:32,405 INFO L858 garLoopResultBuilder]: For program point L7370-2(lines 7370 7371) no Hoare annotation was computed. [2021-12-22 14:04:32,405 INFO L858 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7368 7372) no Hoare annotation was computed. [2021-12-22 14:04:32,405 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-12-22 14:04:32,405 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-12-22 14:04:32,405 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-12-22 14:04:32,405 INFO L858 garLoopResultBuilder]: For program point L6675-1(line 6675) no Hoare annotation was computed. [2021-12-22 14:04:32,405 INFO L854 garLoopResultBuilder]: At program point L6675(line 6675) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (< 0 |#StackHeapBarrier|)) [2021-12-22 14:04:32,405 INFO L858 garLoopResultBuilder]: For program point L9549(lines 9549 9550) no Hoare annotation was computed. [2021-12-22 14:04:32,405 INFO L858 garLoopResultBuilder]: For program point L9549-2(lines 9549 9550) no Hoare annotation was computed. [2021-12-22 14:04:32,405 INFO L858 garLoopResultBuilder]: For program point L9549-3(lines 9549 9559) no Hoare annotation was computed. [2021-12-22 14:04:32,405 INFO L854 garLoopResultBuilder]: At program point L9549-4(lines 9549 9559) the Hoare annotation is: (let ((.cse1 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse2 (< 0 |#StackHeapBarrier|))) (or (and (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse0 (* (div .cse0 18446744073709551616) 18446744073709551616))) .cse1 .cse2) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) .cse1 .cse2))) [2021-12-22 14:04:32,406 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-22 14:04:32,406 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-22 14:04:32,406 INFO L854 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2021-12-22 14:04:32,406 INFO L858 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2021-12-22 14:04:32,406 INFO L858 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2021-12-22 14:04:32,406 INFO L854 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2021-12-22 14:04:32,406 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-12-22 14:04:32,406 INFO L854 garLoopResultBuilder]: At program point L9560(line 9560) the Hoare annotation is: (and (<= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1359#1| 1) (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (<= 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1359#1|) (< 0 |#StackHeapBarrier|)) [2021-12-22 14:04:32,406 INFO L858 garLoopResultBuilder]: For program point L9560-1(line 9560) no Hoare annotation was computed. [2021-12-22 14:04:32,406 INFO L854 garLoopResultBuilder]: At program point L9329-4(line 9329) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse12 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (let ((.cse15 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse16 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base|)) (.cse8 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse13 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse17 (<= 0 (+ (* (div (* (- 1) .cse12) 18446744073709551616) 18446744073709551616) .cse12))) (.cse2 (not .cse14)) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse7 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse9 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse10 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse11 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 (<= .cse12 (* (div .cse12 18446744073709551616) 18446744073709551616)) .cse4 .cse5 .cse10 .cse13 .cse14 .cse11) (and |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1290#1| .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse16 .cse13 .cse14 .cse11) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) .cse17 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1290#1| .cse6 .cse15 .cse9 .cse10 .cse16 .cse13 .cse14 .cse11) (and .cse0 .cse1 .cse4 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1290#1| .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse11) (and .cse0 .cse1 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11)))) [2021-12-22 14:04:32,406 INFO L858 garLoopResultBuilder]: For program point L9329-5(line 9329) no Hoare annotation was computed. [2021-12-22 14:04:32,406 INFO L858 garLoopResultBuilder]: For program point L9329(line 9329) no Hoare annotation was computed. [2021-12-22 14:04:32,406 INFO L854 garLoopResultBuilder]: At program point L9552(line 9552) the Hoare annotation is: false [2021-12-22 14:04:32,406 INFO L854 garLoopResultBuilder]: At program point L9329-2(line 9329) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse8 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse9 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse10 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse11 (not |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1290#1|)) (.cse12 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 (<= 0 (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* (div (* (- 1) .cse2) 18446744073709551616) 18446744073709551616) .cse2))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse9 .cse10 .cse11 .cse12))) [2021-12-22 14:04:32,406 INFO L854 garLoopResultBuilder]: At program point L9552-1(line 9552) the Hoare annotation is: false [2021-12-22 14:04:32,406 INFO L858 garLoopResultBuilder]: For program point L9329-3(line 9329) no Hoare annotation was computed. [2021-12-22 14:04:32,406 INFO L858 garLoopResultBuilder]: For program point L9552-2(line 9552) no Hoare annotation was computed. [2021-12-22 14:04:32,407 INFO L854 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse1 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse2 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse5 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 8)) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse1 .cse2 .cse3 .cse4 .cse5))) [2021-12-22 14:04:32,407 INFO L854 garLoopResultBuilder]: At program point L9544-1(line 9544) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse2 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse3 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse6 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse0 (* (div .cse0 18446744073709551616) 18446744073709551616))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1349#1|) (<= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1349#1| 0) .cse3 .cse6) (and .cse1 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-12-22 14:04:32,407 INFO L858 garLoopResultBuilder]: For program point L9544-2(line 9544) no Hoare annotation was computed. [2021-12-22 14:04:32,407 INFO L858 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2021-12-22 14:04:32,407 INFO L854 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2021-12-22 14:04:32,407 INFO L858 garLoopResultBuilder]: For program point L9330(line 9330) no Hoare annotation was computed. [2021-12-22 14:04:32,407 INFO L858 garLoopResultBuilder]: For program point L9330-5(line 9330) no Hoare annotation was computed. [2021-12-22 14:04:32,407 INFO L858 garLoopResultBuilder]: For program point L9553(lines 9553 9558) no Hoare annotation was computed. [2021-12-22 14:04:32,407 INFO L854 garLoopResultBuilder]: At program point L9330-2(line 9330) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse2 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse3 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse4 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse5 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base|)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse8 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (<= 0 (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* (div (* (- 1) .cse0) 18446744073709551616) 18446744073709551616) .cse0))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-12-22 14:04:32,407 INFO L858 garLoopResultBuilder]: For program point L9330-3(line 9330) no Hoare annotation was computed. [2021-12-22 14:04:32,407 INFO L854 garLoopResultBuilder]: At program point L9330-4(line 9330) the Hoare annotation is: (let ((.cse18 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse13 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (let ((.cse16 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse7 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse8 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse17 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base|)) (.cse14 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse2 (not .cse13)) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse9 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse15 (<= .cse18 (* (div .cse18 18446744073709551616) 18446744073709551616))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse10 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse12 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse11 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1292#1| .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse4 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1292#1| .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse11) (and .cse14 .cse15 .cse6 .cse16 .cse9 .cse10 .cse17 .cse12 .cse13 .cse11) (and .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse17 .cse12 .cse13 .cse11) (and .cse0 .cse1 .cse14 (<= 0 (+ (* (div (* (- 1) .cse18) 18446744073709551616) 18446744073709551616) .cse18)) .cse2 .cse3 .cse4 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1292#1| .cse5 .cse6 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse15 .cse4 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1292#1| .cse5 .cse10 .cse12 .cse13 .cse11)))) [2021-12-22 14:04:32,407 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-22 14:04:32,407 INFO L861 garLoopResultBuilder]: At program point L9562(line 9562) the Hoare annotation is: true [2021-12-22 14:04:32,407 INFO L858 garLoopResultBuilder]: For program point L9537(lines 9537 9561) no Hoare annotation was computed. [2021-12-22 14:04:32,407 INFO L858 garLoopResultBuilder]: For program point L9331(lines 9331 9339) no Hoare annotation was computed. [2021-12-22 14:04:32,407 INFO L854 garLoopResultBuilder]: At program point L9554(line 9554) the Hoare annotation is: false [2021-12-22 14:04:32,407 INFO L858 garLoopResultBuilder]: For program point L6672(lines 6672 6676) no Hoare annotation was computed. [2021-12-22 14:04:32,407 INFO L858 garLoopResultBuilder]: For program point L9554-1(line 9554) no Hoare annotation was computed. [2021-12-22 14:04:32,407 INFO L854 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2021-12-22 14:04:32,407 INFO L854 garLoopResultBuilder]: At program point L9538(line 9538) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2021-12-22 14:04:32,407 INFO L858 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2021-12-22 14:04:32,408 INFO L858 garLoopResultBuilder]: For program point L9538-5(lines 9538 9539) no Hoare annotation was computed. [2021-12-22 14:04:32,408 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-22 14:04:32,408 INFO L858 garLoopResultBuilder]: For program point L9340(lines 9340 9348) no Hoare annotation was computed. [2021-12-22 14:04:32,408 INFO L858 garLoopResultBuilder]: For program point L9538-1(lines 9538 9539) no Hoare annotation was computed. [2021-12-22 14:04:32,408 INFO L854 garLoopResultBuilder]: At program point L9538-2(line 9538) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2021-12-22 14:04:32,408 INFO L858 garLoopResultBuilder]: For program point L9538-3(line 9538) no Hoare annotation was computed. [2021-12-22 14:04:32,408 INFO L858 garLoopResultBuilder]: For program point L9555(lines 9555 9557) no Hoare annotation was computed. [2021-12-22 14:04:32,408 INFO L858 garLoopResultBuilder]: For program point L6673-3(lines 6673 6675) no Hoare annotation was computed. [2021-12-22 14:04:32,408 INFO L858 garLoopResultBuilder]: For program point L6673-1(lines 6673 6675) no Hoare annotation was computed. [2021-12-22 14:04:32,408 INFO L854 garLoopResultBuilder]: At program point L6673(line 6673) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (< 0 |#StackHeapBarrier|)) [2021-12-22 14:04:32,408 INFO L854 garLoopResultBuilder]: At program point L9349(line 9349) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse2 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse3 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse4 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse5 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base|)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse8 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse0 (* (div .cse0 18446744073709551616) 18446744073709551616))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-12-22 14:04:32,408 INFO L858 garLoopResultBuilder]: For program point L9349-1(line 9349) no Hoare annotation was computed. [2021-12-22 14:04:32,408 INFO L854 garLoopResultBuilder]: At program point L9349-2(lines 9327 9350) the Hoare annotation is: (let ((.cse7 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse4 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse5 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse8 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse6 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_#res#1| 0) (not .cse0) (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0)) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (<= 0 (+ (* (div (* (- 1) .cse7) 18446744073709551616) 18446744073709551616) .cse7)) .cse2 .cse4 .cse5 .cse6))) (and (<= .cse7 (* (div .cse7 18446744073709551616) 18446744073709551616)) .cse5 .cse8 .cse0 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse0 .cse6))) [2021-12-22 14:04:32,408 INFO L854 garLoopResultBuilder]: At program point L9548(line 9548) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse2 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse3 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse6 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse0 (* (div .cse0 18446744073709551616) 18446744073709551616))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-12-22 14:04:32,408 INFO L858 garLoopResultBuilder]: For program point L9548-1(line 9548) no Hoare annotation was computed. [2021-12-22 14:04:32,408 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-22 14:04:32,408 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-22 14:04:32,408 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-22 14:04:32,408 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-22 14:04:32,408 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-22 14:04:32,408 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-22 14:04:32,411 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 14:04:32,411 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 14:04:32,416 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-22 14:04:32,417 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-22 14:04:32,429 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-22 14:04:32,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-22 14:04:32,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 02:04:32 BoogieIcfgContainer [2021-12-22 14:04:32,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 14:04:32,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 14:04:32,432 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 14:04:32,432 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 14:04:32,432 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:03:59" (3/4) ... [2021-12-22 14:04:32,434 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-22 14:04:32,438 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2021-12-22 14:04:32,438 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-22 14:04:32,438 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2021-12-22 14:04:32,438 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq [2021-12-22 14:04:32,438 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-12-22 14:04:32,438 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2021-12-22 14:04:32,438 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-22 14:04:32,438 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-22 14:04:32,438 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2021-12-22 14:04:32,439 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2021-12-22 14:04:32,448 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 127 nodes and edges [2021-12-22 14:04:32,449 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2021-12-22 14:04:32,450 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-12-22 14:04:32,451 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-22 14:04:32,451 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-12-22 14:04:32,452 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-22 14:04:32,453 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-22 14:04:32,453 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-22 14:04:32,470 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 0 && !(str == 0)) && !(str == 0)) && ((((((cursor == 0 && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown) || (((((cursor == 0 && 0 <= -1 * unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && cursor == cursor) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown))) || ((((unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616 * 18446744073709551616 && 1 < cursor) && str == 0) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown)) || (((((((cursor == 0 && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 1 < cursor) && str == 0) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown) [2021-12-22 14:04:32,471 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0 < unknown-#StackHeapBarrier-unknown) || ((((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && str == 0) && !(\result == 0)) && !(\old(max_size) == 16)) && \result == 0) [2021-12-22 14:04:33,007 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 14:04:33,007 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 14:04:33,008 INFO L158 Benchmark]: Toolchain (without parser) took 37200.11ms. Allocated memory was 94.4MB in the beginning and 465.6MB in the end (delta: 371.2MB). Free memory was 55.0MB in the beginning and 348.8MB in the end (delta: -293.8MB). Peak memory consumption was 312.2MB. Max. memory is 16.1GB. [2021-12-22 14:04:33,008 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 69.2MB. Free memory was 34.1MB in the beginning and 34.1MB in the end (delta: 43.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 14:04:33,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1937.96ms. Allocated memory was 94.4MB in the beginning and 125.8MB in the end (delta: 31.5MB). Free memory was 55.0MB in the beginning and 76.2MB in the end (delta: -21.2MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. [2021-12-22 14:04:33,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 147.30ms. Allocated memory is still 125.8MB. Free memory was 76.2MB in the beginning and 64.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-22 14:04:33,008 INFO L158 Benchmark]: Boogie Preprocessor took 45.43ms. Allocated memory is still 125.8MB. Free memory was 64.3MB in the beginning and 57.3MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-22 14:04:33,008 INFO L158 Benchmark]: RCFGBuilder took 1100.34ms. Allocated memory was 125.8MB in the beginning and 178.3MB in the end (delta: 52.4MB). Free memory was 57.3MB in the beginning and 118.1MB in the end (delta: -60.8MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2021-12-22 14:04:33,009 INFO L158 Benchmark]: TraceAbstraction took 33389.20ms. Allocated memory was 178.3MB in the beginning and 465.6MB in the end (delta: 287.3MB). Free memory was 118.1MB in the beginning and 351.1MB in the end (delta: -232.9MB). Peak memory consumption was 276.7MB. Max. memory is 16.1GB. [2021-12-22 14:04:33,009 INFO L158 Benchmark]: Witness Printer took 574.98ms. Allocated memory is still 465.6MB. Free memory was 351.1MB in the beginning and 348.8MB in the end (delta: 2.3MB). Peak memory consumption was 237.2MB. Max. memory is 16.1GB. [2021-12-22 14:04:33,010 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.14ms. Allocated memory is still 69.2MB. Free memory was 34.1MB in the beginning and 34.1MB in the end (delta: 43.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1937.96ms. Allocated memory was 94.4MB in the beginning and 125.8MB in the end (delta: 31.5MB). Free memory was 55.0MB in the beginning and 76.2MB in the end (delta: -21.2MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 147.30ms. Allocated memory is still 125.8MB. Free memory was 76.2MB in the beginning and 64.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.43ms. Allocated memory is still 125.8MB. Free memory was 64.3MB in the beginning and 57.3MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1100.34ms. Allocated memory was 125.8MB in the beginning and 178.3MB in the end (delta: 52.4MB). Free memory was 57.3MB in the beginning and 118.1MB in the end (delta: -60.8MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. * TraceAbstraction took 33389.20ms. Allocated memory was 178.3MB in the beginning and 465.6MB in the end (delta: 287.3MB). Free memory was 118.1MB in the beginning and 351.1MB in the end (delta: -232.9MB). Peak memory consumption was 276.7MB. Max. memory is 16.1GB. * Witness Printer took 574.98ms. Allocated memory is still 465.6MB. Free memory was 351.1MB in the beginning and 348.8MB in the end (delta: 2.3MB). Peak memory consumption was 237.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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 11 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.3s, OverallIterations: 24, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2307 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2170 mSDsluCounter, 19433 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 428 IncrementalHoareTripleChecker+Unchecked, 15879 mSDsCounter, 659 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4389 IncrementalHoareTripleChecker+Invalid, 5476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 659 mSolverCounterUnsat, 3554 mSDtfsCounter, 4389 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2523 GetRequests, 2103 SyntacticMatches, 34 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1886 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=275occurred in iteration=7, InterpolantAutomatonStates: 218, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 320 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 42 LocationsWithAnnotation, 483 PreInvPairs, 541 NumberOfFragments, 1539 HoareAnnotationTreeSize, 483 FomulaSimplifications, 749 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 42 FomulaSimplificationsInter, 11056 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 3303 NumberOfCodeBlocks, 3303 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3714 ConstructedInterpolants, 106 QuantifiedInterpolants, 16053 SizeOfPredicates, 117 NumberOfNonLiveVariables, 38463 ConjunctsInSsa, 313 ConjunctsInUnsatCore, 45 InterpolantComputations, 19 PerfectInterpolantSequences, 1734/2007 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: 9327]: Loop Invariant [2021-12-22 14:04:33,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-22 14:04:33,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-22 14:04:33,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-22 14:04:33,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((\result == 0 && !(str == 0)) && !(str == 0)) && ((((((cursor == 0 && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown) || (((((cursor == 0 && 0 <= -1 * unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && cursor == cursor) && 1 < cursor) && 0 < unknown-#StackHeapBarrier-unknown))) || ((((unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616 * 18446744073709551616 && 1 < cursor) && str == 0) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown)) || (((((((cursor == 0 && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 1 < cursor) && str == 0) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 9562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: !(0 < unknown-#StackHeapBarrier-unknown) || ((((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && str == 0) && !(\result == 0)) && !(\old(max_size) == 16)) && \result == 0) RESULT: Ultimate proved your program to be correct! [2021-12-22 14:04:33,044 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