./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 791161d1 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-?-791161d [2022-07-22 22:34:08,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 22:34:08,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 22:34:08,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 22:34:08,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 22:34:08,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 22:34:08,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 22:34:08,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 22:34:08,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 22:34:08,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 22:34:08,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 22:34:08,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 22:34:08,563 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 22:34:08,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 22:34:08,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 22:34:08,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 22:34:08,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 22:34:08,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 22:34:08,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 22:34:08,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 22:34:08,581 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 22:34:08,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 22:34:08,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 22:34:08,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 22:34:08,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 22:34:08,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 22:34:08,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 22:34:08,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 22:34:08,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 22:34:08,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 22:34:08,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 22:34:08,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 22:34:08,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 22:34:08,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 22:34:08,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 22:34:08,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 22:34:08,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 22:34:08,601 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 22:34:08,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 22:34:08,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 22:34:08,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 22:34:08,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 22:34:08,606 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-22 22:34:08,637 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 22:34:08,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 22:34:08,638 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 22:34:08,638 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 22:34:08,639 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 22:34:08,639 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 22:34:08,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 22:34:08,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 22:34:08,640 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 22:34:08,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 22:34:08,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 22:34:08,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 22:34:08,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 22:34:08,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 22:34:08,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 22:34:08,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 22:34:08,642 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 22:34:08,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 22:34:08,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 22:34:08,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 22:34:08,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 22:34:08,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:34:08,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 22:34:08,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 22:34:08,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 22:34:08,645 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 22:34:08,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 22:34:08,646 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 22:34:08,646 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 22:34:08,646 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 22:34:08,646 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 [2022-07-22 22:34:08,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 22:34:08,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 22:34:08,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 22:34:08,950 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 22:34:08,951 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 22:34:08,952 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 [2022-07-22 22:34:09,033 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3187d10d/139eef91f6e04b269b8ee8e9bd6ed07f/FLAG05b16431e [2022-07-22 22:34:09,719 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 22:34:09,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i [2022-07-22 22:34:09,762 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3187d10d/139eef91f6e04b269b8ee8e9bd6ed07f/FLAG05b16431e [2022-07-22 22:34:09,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3187d10d/139eef91f6e04b269b8ee8e9bd6ed07f [2022-07-22 22:34:09,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 22:34:09,883 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 22:34:09,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 22:34:09,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 22:34:09,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 22:34:09,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:34:09" (1/1) ... [2022-07-22 22:34:09,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f94b00d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:09, skipping insertion in model container [2022-07-22 22:34:09,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:34:09" (1/1) ... [2022-07-22 22:34:09,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 22:34:09,980 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 22:34:10,218 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] [2022-07-22 22:34:10,225 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] [2022-07-22 22:34:10,887 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:10,892 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:10,893 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:10,894 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:10,895 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:10,908 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:10,912 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:10,916 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:10,917 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:11,151 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:34:11,152 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:34:11,153 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:34:11,154 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:34:11,155 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:34:11,155 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:34:11,156 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:34:11,156 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:34:11,157 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:34:11,157 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:34:11,301 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:34:11,473 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:11,473 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:11,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:34:11,625 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 22:34:11,648 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] [2022-07-22 22:34:11,649 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] [2022-07-22 22:34:11,676 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:11,677 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:11,678 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:11,678 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:11,678 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:11,683 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:11,685 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:11,686 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:11,686 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:11,724 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:34:11,725 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:34:11,726 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:34:11,726 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:34:11,727 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:34:11,727 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:34:11,727 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:34:11,728 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:34:11,728 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:34:11,728 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:34:11,746 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:34:11,830 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:11,831 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:11,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:34:12,039 INFO L208 MainTranslator]: Completed translation [2022-07-22 22:34:12,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:12 WrapperNode [2022-07-22 22:34:12,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 22:34:12,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 22:34:12,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 22:34:12,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 22:34:12,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:12" (1/1) ... [2022-07-22 22:34:12,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:12" (1/1) ... [2022-07-22 22:34:12,241 INFO L137 Inliner]: procedures = 693, calls = 2789, calls flagged for inlining = 60, calls inlined = 7, statements flattened = 869 [2022-07-22 22:34:12,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 22:34:12,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 22:34:12,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 22:34:12,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 22:34:12,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:12" (1/1) ... [2022-07-22 22:34:12,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:12" (1/1) ... [2022-07-22 22:34:12,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:12" (1/1) ... [2022-07-22 22:34:12,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:12" (1/1) ... [2022-07-22 22:34:12,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:12" (1/1) ... [2022-07-22 22:34:12,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:12" (1/1) ... [2022-07-22 22:34:12,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:12" (1/1) ... [2022-07-22 22:34:12,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 22:34:12,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 22:34:12,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 22:34:12,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 22:34:12,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:12" (1/1) ... [2022-07-22 22:34:12,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:34:12,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:12,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 22:34:12,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 22:34:12,428 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-22 22:34:12,428 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-22 22:34:12,429 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-22 22:34:12,429 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-22 22:34:12,429 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-07-22 22:34:12,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-07-22 22:34:12,429 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-22 22:34:12,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 22:34:12,430 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-22 22:34:12,430 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-22 22:34:12,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 22:34:12,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 22:34:12,431 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 22:34:12,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 22:34:12,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 22:34:12,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 22:34:12,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 22:34:12,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 22:34:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-22 22:34:12,433 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-22 22:34:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-22 22:34:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 22:34:12,433 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 22:34:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 22:34:12,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 22:34:12,434 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2022-07-22 22:34:12,434 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2022-07-22 22:34:12,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 22:34:12,435 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-22 22:34:12,435 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-22 22:34:12,436 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-22 22:34:12,436 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-22 22:34:12,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 22:34:12,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 22:34:12,727 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 22:34:12,729 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 22:34:13,740 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 22:34:13,751 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 22:34:13,751 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 22:34:13,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:34:13 BoogieIcfgContainer [2022-07-22 22:34:13,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 22:34:13,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 22:34:13,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 22:34:13,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 22:34:13,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:34:09" (1/3) ... [2022-07-22 22:34:13,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2e53c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:34:13, skipping insertion in model container [2022-07-22 22:34:13,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:12" (2/3) ... [2022-07-22 22:34:13,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2e53c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:34:13, skipping insertion in model container [2022-07-22 22:34:13,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:34:13" (3/3) ... [2022-07-22 22:34:13,763 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_cursor_harness.i [2022-07-22 22:34:13,779 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 22:34:13,779 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 22:34:13,844 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 22:34:13,849 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5dffed4c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5d6a7f9f [2022-07-22 22:34:13,850 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 22:34:13,853 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) [2022-07-22 22:34:13,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-22 22:34:13,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:13,867 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:13,869 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:13,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:13,876 INFO L85 PathProgramCache]: Analyzing trace with hash -386411024, now seen corresponding path program 1 times [2022-07-22 22:34:13,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:13,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620689796] [2022-07-22 22:34:13,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:13,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:14,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:14,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:14,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:14,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:14,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:34:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:14,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:34:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:14,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:34:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:14,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:34:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 22:34:14,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:14,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620689796] [2022-07-22 22:34:14,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620689796] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:14,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346960695] [2022-07-22 22:34:14,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:14,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:14,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:14,640 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:34:14,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 22:34:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:15,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-22 22:34:15,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 22:34:15,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:34:15,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346960695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:15,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:34:15,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2022-07-22 22:34:15,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158764692] [2022-07-22 22:34:15,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:15,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 22:34:15,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:15,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 22:34:15,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:34:15,161 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) [2022-07-22 22:34:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:15,191 INFO L93 Difference]: Finished difference Result 241 states and 335 transitions. [2022-07-22 22:34:15,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 22:34:15,194 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 [2022-07-22 22:34:15,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:15,202 INFO L225 Difference]: With dead ends: 241 [2022-07-22 22:34:15,202 INFO L226 Difference]: Without dead ends: 120 [2022-07-22 22:34:15,206 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:34:15,210 INFO L413 NwaCegarLoop]: 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 [2022-07-22 22:34:15,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:34:15,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-22 22:34:15,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-22 22:34:15,249 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) [2022-07-22 22:34:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 159 transitions. [2022-07-22 22:34:15,253 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 159 transitions. Word has length 61 [2022-07-22 22:34:15,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:15,255 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 159 transitions. [2022-07-22 22:34:15,255 INFO L496 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) [2022-07-22 22:34:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 159 transitions. [2022-07-22 22:34:15,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-22 22:34:15,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:15,259 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:15,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 22:34:15,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-07-22 22:34:15,476 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:15,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:15,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1156835566, now seen corresponding path program 1 times [2022-07-22 22:34:15,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:15,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091294082] [2022-07-22 22:34:15,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:15,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:15,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:15,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:15,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:15,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:15,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:34:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:15,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:34:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:15,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:34:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:15,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:34:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:15,771 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 22:34:15,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:15,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091294082] [2022-07-22 22:34:15,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091294082] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:15,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339350222] [2022-07-22 22:34:15,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:15,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:15,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:15,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:34:15,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 22:34:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:16,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 22:34:16,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 22:34:16,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:34:16,450 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 22:34:16,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339350222] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:16,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 22:34:16,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 13 [2022-07-22 22:34:16,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589293675] [2022-07-22 22:34:16,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:16,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:34:16,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:16,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:34:16,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:34:16,458 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) [2022-07-22 22:34:16,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:16,694 INFO L93 Difference]: Finished difference Result 208 states and 282 transitions. [2022-07-22 22:34:16,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:34:16,694 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 [2022-07-22 22:34:16,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:16,702 INFO L225 Difference]: With dead ends: 208 [2022-07-22 22:34:16,703 INFO L226 Difference]: Without dead ends: 155 [2022-07-22 22:34:16,706 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:34:16,707 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 241 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:16,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 535 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:34:16,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-22 22:34:16,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2022-07-22 22:34:16,735 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) [2022-07-22 22:34:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 177 transitions. [2022-07-22 22:34:16,737 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 177 transitions. Word has length 61 [2022-07-22 22:34:16,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:16,738 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 177 transitions. [2022-07-22 22:34:16,739 INFO L496 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) [2022-07-22 22:34:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 177 transitions. [2022-07-22 22:34:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-22 22:34:16,750 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:16,750 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:16,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 22:34:16,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-07-22 22:34:16,967 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:16,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:16,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1751928336, now seen corresponding path program 1 times [2022-07-22 22:34:16,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:16,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535702180] [2022-07-22 22:34:16,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:16,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:17,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:17,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:17,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:17,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 22:34:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:17,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:34:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:17,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:34:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:17,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:34:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:17,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:34:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:17,233 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 22:34:17,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:17,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535702180] [2022-07-22 22:34:17,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535702180] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:17,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870152859] [2022-07-22 22:34:17,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:17,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:17,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:17,236 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:34:17,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 22:34:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:17,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 22:34:17,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 22:34:17,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:34:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 22:34:17,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870152859] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:34:17,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:34:17,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-07-22 22:34:17,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137129969] [2022-07-22 22:34:17,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:34:17,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 22:34:17,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:17,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 22:34:17,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:34:17,896 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) [2022-07-22 22:34:18,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:18,098 INFO L93 Difference]: Finished difference Result 230 states and 312 transitions. [2022-07-22 22:34:18,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:34:18,099 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 [2022-07-22 22:34:18,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:18,101 INFO L225 Difference]: With dead ends: 230 [2022-07-22 22:34:18,101 INFO L226 Difference]: Without dead ends: 135 [2022-07-22 22:34:18,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:34:18,103 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 336 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:18,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 584 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:34:18,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-22 22:34:18,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-07-22 22:34:18,113 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) [2022-07-22 22:34:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 181 transitions. [2022-07-22 22:34:18,114 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 181 transitions. Word has length 61 [2022-07-22 22:34:18,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:18,115 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 181 transitions. [2022-07-22 22:34:18,115 INFO L496 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) [2022-07-22 22:34:18,115 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 181 transitions. [2022-07-22 22:34:18,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 22:34:18,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:18,116 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:18,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 22:34:18,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:18,328 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:18,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:18,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1531369667, now seen corresponding path program 1 times [2022-07-22 22:34:18,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:18,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525370096] [2022-07-22 22:34:18,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:18,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:18,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:18,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:18,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:18,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:18,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:34:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:18,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:34:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:18,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:34:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:18,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:34:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:18,601 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-22 22:34:18,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:18,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525370096] [2022-07-22 22:34:18,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525370096] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:18,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:18,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 22:34:18,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240814639] [2022-07-22 22:34:18,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:18,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:34:18,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:18,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:34:18,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 22:34:18,606 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) [2022-07-22 22:34:18,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:18,635 INFO L93 Difference]: Finished difference Result 233 states and 317 transitions. [2022-07-22 22:34:18,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 22:34:18,635 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 [2022-07-22 22:34:18,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:18,637 INFO L225 Difference]: With dead ends: 233 [2022-07-22 22:34:18,637 INFO L226 Difference]: Without dead ends: 179 [2022-07-22 22:34:18,638 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:34:18,638 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 12 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:18,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 481 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:34:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-22 22:34:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2022-07-22 22:34:18,653 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) [2022-07-22 22:34:18,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 247 transitions. [2022-07-22 22:34:18,655 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 247 transitions. Word has length 65 [2022-07-22 22:34:18,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:18,655 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 247 transitions. [2022-07-22 22:34:18,655 INFO L496 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) [2022-07-22 22:34:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 247 transitions. [2022-07-22 22:34:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 22:34:18,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:18,657 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:18,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 22:34:18,657 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:18,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:18,658 INFO L85 PathProgramCache]: Analyzing trace with hash -84293126, now seen corresponding path program 1 times [2022-07-22 22:34:18,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:18,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170256202] [2022-07-22 22:34:18,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:18,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:18,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:18,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:18,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:18,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:18,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:34:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:18,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:34:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:18,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:34:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:18,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:34:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 22:34:18,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:18,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170256202] [2022-07-22 22:34:18,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170256202] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:18,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:18,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 22:34:18,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141510716] [2022-07-22 22:34:18,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:18,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:34:18,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:18,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:34:18,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:34:18,960 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) [2022-07-22 22:34:19,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:19,018 INFO L93 Difference]: Finished difference Result 188 states and 263 transitions. [2022-07-22 22:34:19,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:34:19,019 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 [2022-07-22 22:34:19,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:19,020 INFO L225 Difference]: With dead ends: 188 [2022-07-22 22:34:19,021 INFO L226 Difference]: Without dead ends: 181 [2022-07-22 22:34:19,021 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:34:19,022 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 16 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:19,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1070 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:34:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-22 22:34:19,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-07-22 22:34:19,035 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) [2022-07-22 22:34:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 256 transitions. [2022-07-22 22:34:19,037 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 256 transitions. Word has length 65 [2022-07-22 22:34:19,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:19,038 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 256 transitions. [2022-07-22 22:34:19,038 INFO L496 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) [2022-07-22 22:34:19,038 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 256 transitions. [2022-07-22 22:34:19,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-22 22:34:19,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:19,039 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:19,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 22:34:19,040 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:19,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:19,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1359362750, now seen corresponding path program 1 times [2022-07-22 22:34:19,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:19,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152305988] [2022-07-22 22:34:19,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:19,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:19,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:19,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:19,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:19,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:19,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:34:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:19,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:34:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:19,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:34:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:19,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:34:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:19,400 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-22 22:34:19,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:19,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152305988] [2022-07-22 22:34:19,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152305988] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:19,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306480175] [2022-07-22 22:34:19,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:19,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:19,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:19,404 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) [2022-07-22 22:34:19,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 22:34:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:19,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 2507 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-22 22:34:19,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 22:34:20,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:34:20,780 INFO L390 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 [2022-07-22 22:34:20,819 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-22 22:34:20,819 INFO L390 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 [2022-07-22 22:34:20,831 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 22:34:20,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306480175] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:34:20,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:34:20,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2022-07-22 22:34:20,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110821849] [2022-07-22 22:34:20,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:34:20,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-22 22:34:20,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:20,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 22:34:20,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-07-22 22:34:20,834 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) [2022-07-22 22:34:21,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:21,559 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2022-07-22 22:34:21,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 22:34:21,560 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 [2022-07-22 22:34:21,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:21,563 INFO L225 Difference]: With dead ends: 334 [2022-07-22 22:34:21,563 INFO L226 Difference]: Without dead ends: 306 [2022-07-22 22:34:21,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 133 SyntacticMatches, 12 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2022-07-22 22:34:21,564 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 96 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:21,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1856 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 383 Invalid, 0 Unknown, 141 Unchecked, 0.4s Time] [2022-07-22 22:34:21,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-22 22:34:21,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 270. [2022-07-22 22:34:21,589 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) [2022-07-22 22:34:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 391 transitions. [2022-07-22 22:34:21,591 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 391 transitions. Word has length 69 [2022-07-22 22:34:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:21,592 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 391 transitions. [2022-07-22 22:34:21,592 INFO L496 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) [2022-07-22 22:34:21,592 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 391 transitions. [2022-07-22 22:34:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-22 22:34:21,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:21,594 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:21,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 22:34:21,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:21,807 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:21,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:21,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1404727030, now seen corresponding path program 1 times [2022-07-22 22:34:21,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:21,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47795969] [2022-07-22 22:34:21,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:21,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:34:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 22:34:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 22:34:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-22 22:34:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 22:34:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-22 22:34:22,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:22,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47795969] [2022-07-22 22:34:22,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47795969] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:22,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121537631] [2022-07-22 22:34:22,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:22,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:22,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:22,080 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) [2022-07-22 22:34:22,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 22:34:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 2519 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-22 22:34:22,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 22:34:22,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:34:22,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121537631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:22,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:34:22,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 10 [2022-07-22 22:34:22,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229580870] [2022-07-22 22:34:22,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:22,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:34:22,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:22,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:34:22,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:34:22,577 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) [2022-07-22 22:34:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:22,728 INFO L93 Difference]: Finished difference Result 411 states and 598 transitions. [2022-07-22 22:34:22,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 22:34:22,728 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 [2022-07-22 22:34:22,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:22,731 INFO L225 Difference]: With dead ends: 411 [2022-07-22 22:34:22,731 INFO L226 Difference]: Without dead ends: 275 [2022-07-22 22:34:22,732 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:34:22,733 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:22,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1146 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:34:22,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-22 22:34:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2022-07-22 22:34:22,765 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) [2022-07-22 22:34:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 400 transitions. [2022-07-22 22:34:22,768 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 400 transitions. Word has length 73 [2022-07-22 22:34:22,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:22,768 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 400 transitions. [2022-07-22 22:34:22,768 INFO L496 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) [2022-07-22 22:34:22,769 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 400 transitions. [2022-07-22 22:34:22,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-22 22:34:22,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:22,774 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:22,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 22:34:22,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:22,995 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:22,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:22,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1686084061, now seen corresponding path program 1 times [2022-07-22 22:34:22,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:22,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014920006] [2022-07-22 22:34:22,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:22,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:34:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:34:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:34:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:34:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:34:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-22 22:34:23,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:23,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014920006] [2022-07-22 22:34:23,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014920006] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:23,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:23,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 22:34:23,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829608244] [2022-07-22 22:34:23,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:23,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:34:23,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:23,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:34:23,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:34:23,240 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) [2022-07-22 22:34:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:23,308 INFO L93 Difference]: Finished difference Result 397 states and 565 transitions. [2022-07-22 22:34:23,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:34:23,309 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 [2022-07-22 22:34:23,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:23,311 INFO L225 Difference]: With dead ends: 397 [2022-07-22 22:34:23,311 INFO L226 Difference]: Without dead ends: 296 [2022-07-22 22:34:23,311 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:34:23,312 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 35 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:23,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 688 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:34:23,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-07-22 22:34:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 266. [2022-07-22 22:34:23,332 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) [2022-07-22 22:34:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 373 transitions. [2022-07-22 22:34:23,334 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 373 transitions. Word has length 76 [2022-07-22 22:34:23,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:23,335 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 373 transitions. [2022-07-22 22:34:23,335 INFO L496 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) [2022-07-22 22:34:23,335 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 373 transitions. [2022-07-22 22:34:23,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-22 22:34:23,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:23,338 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:23,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 22:34:23,338 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:23,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1559219441, now seen corresponding path program 1 times [2022-07-22 22:34:23,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:23,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257144635] [2022-07-22 22:34:23,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:23,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:34:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:34:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:34:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:34:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 22:34:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-22 22:34:23,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:23,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257144635] [2022-07-22 22:34:23,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257144635] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:23,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67296197] [2022-07-22 22:34:23,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:23,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:23,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:23,604 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) [2022-07-22 22:34:23,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 22:34:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:24,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 22:34:24,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-22 22:34:24,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:34:24,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67296197] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:24,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:34:24,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-07-22 22:34:24,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054760864] [2022-07-22 22:34:24,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:24,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:34:24,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:24,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:34:24,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:34:24,145 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) [2022-07-22 22:34:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:24,333 INFO L93 Difference]: Finished difference Result 405 states and 571 transitions. [2022-07-22 22:34:24,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:34:24,333 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 [2022-07-22 22:34:24,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:24,335 INFO L225 Difference]: With dead ends: 405 [2022-07-22 22:34:24,335 INFO L226 Difference]: Without dead ends: 266 [2022-07-22 22:34:24,336 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:34:24,337 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 17 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:24,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 561 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-07-22 22:34:24,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-22 22:34:24,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-07-22 22:34:24,354 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) [2022-07-22 22:34:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 372 transitions. [2022-07-22 22:34:24,356 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 372 transitions. Word has length 75 [2022-07-22 22:34:24,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:24,357 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 372 transitions. [2022-07-22 22:34:24,357 INFO L496 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) [2022-07-22 22:34:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 372 transitions. [2022-07-22 22:34:24,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-22 22:34:24,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:24,359 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:24,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 22:34:24,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:24,572 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:24,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1115318767, now seen corresponding path program 1 times [2022-07-22 22:34:24,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:24,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430733094] [2022-07-22 22:34:24,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:24,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:24,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:24,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:24,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:25,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:34:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:25,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:34:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:25,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:34:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:25,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:34:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:25,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 22:34:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 22:34:25,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:25,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430733094] [2022-07-22 22:34:25,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430733094] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:25,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674623026] [2022-07-22 22:34:25,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:25,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:25,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:25,051 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) [2022-07-22 22:34:25,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 22:34:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:25,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 2529 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-22 22:34:25,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:25,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 22:34:25,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 22:34:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 22:34:25,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:34:25,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674623026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:25,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:34:25,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2022-07-22 22:34:25,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791144151] [2022-07-22 22:34:25,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:25,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 22:34:25,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:25,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 22:34:25,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:34:25,872 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) [2022-07-22 22:34:25,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:25,960 INFO L93 Difference]: Finished difference Result 422 states and 584 transitions. [2022-07-22 22:34:25,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 22:34:25,960 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 [2022-07-22 22:34:25,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:25,962 INFO L225 Difference]: With dead ends: 422 [2022-07-22 22:34:25,962 INFO L226 Difference]: Without dead ends: 273 [2022-07-22 22:34:25,963 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:34:25,964 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 46 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:25,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 704 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 31 Unchecked, 0.1s Time] [2022-07-22 22:34:25,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-22 22:34:25,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 270. [2022-07-22 22:34:25,979 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) [2022-07-22 22:34:25,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 377 transitions. [2022-07-22 22:34:25,981 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 377 transitions. Word has length 75 [2022-07-22 22:34:25,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:25,981 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 377 transitions. [2022-07-22 22:34:25,982 INFO L496 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) [2022-07-22 22:34:25,982 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 377 transitions. [2022-07-22 22:34:25,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-22 22:34:25,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:25,983 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:26,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 22:34:26,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:26,212 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:26,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:26,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1074644017, now seen corresponding path program 1 times [2022-07-22 22:34:26,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:26,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866896363] [2022-07-22 22:34:26,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:26,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:26,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:26,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:26,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:26,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:34:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:26,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:34:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:26,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:34:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:26,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 22:34:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:26,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 22:34:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:26,377 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-22 22:34:26,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:26,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866896363] [2022-07-22 22:34:26,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866896363] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:26,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984030427] [2022-07-22 22:34:26,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:26,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:26,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:26,380 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) [2022-07-22 22:34:26,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 22:34:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:26,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 22:34:26,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:26,803 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-22 22:34:26,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:34:26,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984030427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:26,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:34:26,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-07-22 22:34:26,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819873667] [2022-07-22 22:34:26,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:26,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:34:26,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:26,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:34:26,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 22:34:26,806 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) [2022-07-22 22:34:26,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:26,841 INFO L93 Difference]: Finished difference Result 414 states and 578 transitions. [2022-07-22 22:34:26,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:34:26,842 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 [2022-07-22 22:34:26,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:26,844 INFO L225 Difference]: With dead ends: 414 [2022-07-22 22:34:26,844 INFO L226 Difference]: Without dead ends: 274 [2022-07-22 22:34:26,845 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:34:26,845 INFO L413 NwaCegarLoop]: 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 [2022-07-22 22:34:26,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 462 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:34:26,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-07-22 22:34:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2022-07-22 22:34:26,864 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) [2022-07-22 22:34:26,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 375 transitions. [2022-07-22 22:34:26,867 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 375 transitions. Word has length 75 [2022-07-22 22:34:26,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:26,867 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 375 transitions. [2022-07-22 22:34:26,867 INFO L496 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) [2022-07-22 22:34:26,868 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 375 transitions. [2022-07-22 22:34:26,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-22 22:34:26,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:26,869 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:26,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 22:34:27,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-22 22:34:27,083 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:27,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:27,084 INFO L85 PathProgramCache]: Analyzing trace with hash -453034012, now seen corresponding path program 1 times [2022-07-22 22:34:27,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:27,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017946068] [2022-07-22 22:34:27,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:27,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:27,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:27,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:27,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:27,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:27,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:34:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:27,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:34:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:27,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:34:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:27,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:34:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:27,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 22:34:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 22:34:27,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:27,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017946068] [2022-07-22 22:34:27,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017946068] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:27,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384008050] [2022-07-22 22:34:27,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:27,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:27,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:27,320 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) [2022-07-22 22:34:27,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 22:34:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:27,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 2518 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 22:34:27,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:27,876 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 22:34:27,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:34:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-22 22:34:28,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384008050] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:34:28,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:34:28,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2022-07-22 22:34:28,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52916781] [2022-07-22 22:34:28,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:34:28,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 22:34:28,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:28,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 22:34:28,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-07-22 22:34:28,028 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) [2022-07-22 22:34:28,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:28,411 INFO L93 Difference]: Finished difference Result 385 states and 522 transitions. [2022-07-22 22:34:28,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 22:34:28,412 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 [2022-07-22 22:34:28,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:28,413 INFO L225 Difference]: With dead ends: 385 [2022-07-22 22:34:28,413 INFO L226 Difference]: Without dead ends: 292 [2022-07-22 22:34:28,414 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:34:28,414 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 406 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:28,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1241 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:34:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-07-22 22:34:28,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 268. [2022-07-22 22:34:28,431 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) [2022-07-22 22:34:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 370 transitions. [2022-07-22 22:34:28,433 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 370 transitions. Word has length 77 [2022-07-22 22:34:28,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:28,433 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 370 transitions. [2022-07-22 22:34:28,433 INFO L496 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) [2022-07-22 22:34:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2022-07-22 22:34:28,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-22 22:34:28,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:28,435 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:28,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 22:34:28,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:28,648 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:28,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:28,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1814152958, now seen corresponding path program 1 times [2022-07-22 22:34:28,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:28,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050798505] [2022-07-22 22:34:28,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:28,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:28,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:28,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:28,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:28,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:28,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:34:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:28,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:34:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:28,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:34:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:28,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:34:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:28,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 22:34:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-22 22:34:28,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:28,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050798505] [2022-07-22 22:34:28,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050798505] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:28,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:28,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 22:34:28,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588607402] [2022-07-22 22:34:28,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:28,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:34:28,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:28,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:34:28,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:34:28,884 INFO L87 Difference]: Start difference. First operand 268 states and 370 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-22 22:34:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:28,972 INFO L93 Difference]: Finished difference Result 360 states and 496 transitions. [2022-07-22 22:34:28,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:34:28,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 78 [2022-07-22 22:34:28,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:28,974 INFO L225 Difference]: With dead ends: 360 [2022-07-22 22:34:28,974 INFO L226 Difference]: Without dead ends: 290 [2022-07-22 22:34:28,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:34:28,976 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 54 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:28,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 827 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:34:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-22 22:34:28,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 263. [2022-07-22 22:34:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 183 states have (on average 1.2295081967213115) internal successors, (225), 187 states have internal predecessors, (225), 64 states have call successors, (64), 13 states have call predecessors, (64), 15 states have return successors, (73), 62 states have call predecessors, (73), 63 states have call successors, (73) [2022-07-22 22:34:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 362 transitions. [2022-07-22 22:34:28,996 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 362 transitions. Word has length 78 [2022-07-22 22:34:28,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:28,996 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 362 transitions. [2022-07-22 22:34:28,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-22 22:34:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 362 transitions. [2022-07-22 22:34:28,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-22 22:34:28,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:28,998 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:28,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 22:34:28,998 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:28,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:28,999 INFO L85 PathProgramCache]: Analyzing trace with hash 635447172, now seen corresponding path program 1 times [2022-07-22 22:34:28,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:28,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462377545] [2022-07-22 22:34:29,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:29,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:34:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:34:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:34:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:34:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 22:34:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-22 22:34:29,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:29,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462377545] [2022-07-22 22:34:29,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462377545] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:29,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:29,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 22:34:29,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004566305] [2022-07-22 22:34:29,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:29,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:34:29,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:29,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:34:29,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 22:34:29,178 INFO L87 Difference]: Start difference. First operand 263 states and 362 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-22 22:34:29,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:29,203 INFO L93 Difference]: Finished difference Result 379 states and 518 transitions. [2022-07-22 22:34:29,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:34:29,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 78 [2022-07-22 22:34:29,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:29,205 INFO L225 Difference]: With dead ends: 379 [2022-07-22 22:34:29,206 INFO L226 Difference]: Without dead ends: 264 [2022-07-22 22:34:29,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:34:29,207 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 2 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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 [2022-07-22 22:34:29,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 462 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:34:29,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-07-22 22:34:29,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2022-07-22 22:34:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 183 states have (on average 1.2240437158469946) internal successors, (224), 187 states have internal predecessors, (224), 64 states have call successors, (64), 13 states have call predecessors, (64), 15 states have return successors, (73), 62 states have call predecessors, (73), 63 states have call successors, (73) [2022-07-22 22:34:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 361 transitions. [2022-07-22 22:34:29,223 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 361 transitions. Word has length 78 [2022-07-22 22:34:29,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:29,223 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 361 transitions. [2022-07-22 22:34:29,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-22 22:34:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 361 transitions. [2022-07-22 22:34:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-22 22:34:29,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:29,225 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:29,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 22:34:29,225 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:29,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:29,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1294978694, now seen corresponding path program 1 times [2022-07-22 22:34:29,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:29,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481129826] [2022-07-22 22:34:29,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:29,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:34:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:34:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:34:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:34:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 22:34:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-22 22:34:29,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:29,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481129826] [2022-07-22 22:34:29,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481129826] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:29,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:29,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 22:34:29,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925669725] [2022-07-22 22:34:29,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:29,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:34:29,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:29,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:34:29,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:34:29,406 INFO L87 Difference]: Start difference. First operand 263 states and 361 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) [2022-07-22 22:34:29,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:29,450 INFO L93 Difference]: Finished difference Result 334 states and 445 transitions. [2022-07-22 22:34:29,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:34:29,451 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 [2022-07-22 22:34:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:29,452 INFO L225 Difference]: With dead ends: 334 [2022-07-22 22:34:29,452 INFO L226 Difference]: Without dead ends: 263 [2022-07-22 22:34:29,453 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:34:29,453 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 16 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:29,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 627 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:34:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-22 22:34:29,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 254. [2022-07-22 22:34:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 177 states have (on average 1.1977401129943503) internal successors, (212), 180 states have internal predecessors, (212), 62 states have call successors, (62), 13 states have call predecessors, (62), 14 states have return successors, (68), 60 states have call predecessors, (68), 61 states have call successors, (68) [2022-07-22 22:34:29,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 342 transitions. [2022-07-22 22:34:29,470 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 342 transitions. Word has length 78 [2022-07-22 22:34:29,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:29,471 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 342 transitions. [2022-07-22 22:34:29,471 INFO L496 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) [2022-07-22 22:34:29,471 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 342 transitions. [2022-07-22 22:34:29,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-22 22:34:29,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:29,473 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:29,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 22:34:29,473 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:29,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:29,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1823272801, now seen corresponding path program 1 times [2022-07-22 22:34:29,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:29,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318297952] [2022-07-22 22:34:29,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:29,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:34:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:34:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 22:34:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:34:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:34:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:29,794 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-22 22:34:29,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:29,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318297952] [2022-07-22 22:34:29,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318297952] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:29,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447110632] [2022-07-22 22:34:29,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:29,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:29,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:29,800 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) [2022-07-22 22:34:29,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 22:34:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:30,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 2523 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-22 22:34:30,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:30,800 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 22:34:30,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:34:31,016 INFO L390 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 [2022-07-22 22:34:31,050 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-22 22:34:31,051 INFO L390 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 [2022-07-22 22:34:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 22:34:31,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447110632] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:34:31,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:34:31,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2022-07-22 22:34:31,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291437893] [2022-07-22 22:34:31,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:34:31,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-22 22:34:31,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:31,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 22:34:31,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-07-22 22:34:31,063 INFO L87 Difference]: Start difference. First operand 254 states and 342 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) [2022-07-22 22:34:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:31,731 INFO L93 Difference]: Finished difference Result 371 states and 505 transitions. [2022-07-22 22:34:31,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 22:34:31,732 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 [2022-07-22 22:34:31,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:31,733 INFO L225 Difference]: With dead ends: 371 [2022-07-22 22:34:31,734 INFO L226 Difference]: Without dead ends: 318 [2022-07-22 22:34:31,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 16 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-07-22 22:34:31,735 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 196 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:31,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1250 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 351 Invalid, 0 Unknown, 125 Unchecked, 0.4s Time] [2022-07-22 22:34:31,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-07-22 22:34:31,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 253. [2022-07-22 22:34:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 176 states have (on average 1.1875) internal successors, (209), 179 states have internal predecessors, (209), 61 states have call successors, (61), 14 states have call predecessors, (61), 15 states have return successors, (66), 59 states have call predecessors, (66), 59 states have call successors, (66) [2022-07-22 22:34:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 336 transitions. [2022-07-22 22:34:31,757 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 336 transitions. Word has length 79 [2022-07-22 22:34:31,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:31,757 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 336 transitions. [2022-07-22 22:34:31,758 INFO L496 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) [2022-07-22 22:34:31,758 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 336 transitions. [2022-07-22 22:34:31,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-22 22:34:31,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:31,759 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:31,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 22:34:31,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-22 22:34:31,984 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:31,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:31,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1762517655, now seen corresponding path program 1 times [2022-07-22 22:34:31,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:31,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911208458] [2022-07-22 22:34:31,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:31,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:32,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:32,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:32,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:34:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:32,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:32,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 22:34:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:32,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:34:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:32,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:34:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:32,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:34:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:32,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 22:34:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:32,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:34:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 22:34:32,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:32,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911208458] [2022-07-22 22:34:32,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911208458] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:32,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:32,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-22 22:34:32,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143051277] [2022-07-22 22:34:32,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:32,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 22:34:32,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:32,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 22:34:32,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:34:32,452 INFO L87 Difference]: Start difference. First operand 253 states and 336 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) [2022-07-22 22:34:33,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:33,235 INFO L93 Difference]: Finished difference Result 319 states and 428 transitions. [2022-07-22 22:34:33,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 22:34:33,238 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 [2022-07-22 22:34:33,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:33,240 INFO L225 Difference]: With dead ends: 319 [2022-07-22 22:34:33,240 INFO L226 Difference]: Without dead ends: 312 [2022-07-22 22:34:33,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-07-22 22:34:33,242 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 157 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:33,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 870 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 22:34:33,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-22 22:34:33,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 258. [2022-07-22 22:34:33,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 180 states have (on average 1.1833333333333333) internal successors, (213), 184 states have internal predecessors, (213), 61 states have call successors, (61), 14 states have call predecessors, (61), 16 states have return successors, (68), 59 states have call predecessors, (68), 59 states have call successors, (68) [2022-07-22 22:34:33,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 342 transitions. [2022-07-22 22:34:33,263 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 342 transitions. Word has length 86 [2022-07-22 22:34:33,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:33,264 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 342 transitions. [2022-07-22 22:34:33,264 INFO L496 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) [2022-07-22 22:34:33,264 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 342 transitions. [2022-07-22 22:34:33,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-22 22:34:33,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:33,266 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:33,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 22:34:33,266 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:33,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:33,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1504352217, now seen corresponding path program 1 times [2022-07-22 22:34:33,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:33,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829778789] [2022-07-22 22:34:33,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:33,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:34:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 22:34:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:34:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:34:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:34:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 22:34:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:34:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,513 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 22:34:33,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:33,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829778789] [2022-07-22 22:34:33,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829778789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:33,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:33,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 22:34:33,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874462408] [2022-07-22 22:34:33,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:33,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:34:33,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:33,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:34:33,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:34:33,515 INFO L87 Difference]: Start difference. First operand 258 states and 342 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) [2022-07-22 22:34:33,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:33,790 INFO L93 Difference]: Finished difference Result 377 states and 487 transitions. [2022-07-22 22:34:33,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:34:33,791 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 [2022-07-22 22:34:33,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:33,793 INFO L225 Difference]: With dead ends: 377 [2022-07-22 22:34:33,793 INFO L226 Difference]: Without dead ends: 251 [2022-07-22 22:34:33,793 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:34:33,794 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 55 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:33,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 358 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:34:33,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-22 22:34:33,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2022-07-22 22:34:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 172 states have (on average 1.180232558139535) internal successors, (203), 175 states have internal predecessors, (203), 61 states have call successors, (61), 14 states have call predecessors, (61), 15 states have return successors, (65), 59 states have call predecessors, (65), 59 states have call successors, (65) [2022-07-22 22:34:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 329 transitions. [2022-07-22 22:34:33,813 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 329 transitions. Word has length 86 [2022-07-22 22:34:33,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:33,814 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 329 transitions. [2022-07-22 22:34:33,814 INFO L496 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) [2022-07-22 22:34:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 329 transitions. [2022-07-22 22:34:33,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-22 22:34:33,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:33,815 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:33,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 22:34:33,816 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:33,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:33,816 INFO L85 PathProgramCache]: Analyzing trace with hash 858492976, now seen corresponding path program 1 times [2022-07-22 22:34:33,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:33,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537764685] [2022-07-22 22:34:33,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:33,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:34:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 22:34:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 22:34:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:33,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 22:34:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:34,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:34:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:34,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 22:34:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:34,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 22:34:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:34,129 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-22 22:34:34,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:34,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537764685] [2022-07-22 22:34:34,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537764685] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:34,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:34,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-22 22:34:34,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679184877] [2022-07-22 22:34:34,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:34,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 22:34:34,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:34,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 22:34:34,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:34:34,130 INFO L87 Difference]: Start difference. First operand 249 states and 329 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) [2022-07-22 22:34:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:34,857 INFO L93 Difference]: Finished difference Result 259 states and 338 transitions. [2022-07-22 22:34:34,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 22:34:34,858 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 [2022-07-22 22:34:34,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:34,859 INFO L225 Difference]: With dead ends: 259 [2022-07-22 22:34:34,859 INFO L226 Difference]: Without dead ends: 215 [2022-07-22 22:34:34,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-07-22 22:34:34,860 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 76 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:34,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1032 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 22:34:34,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-07-22 22:34:34,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 185. [2022-07-22 22:34:34,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 129 states have (on average 1.1627906976744187) internal successors, (150), 133 states have internal predecessors, (150), 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) [2022-07-22 22:34:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 233 transitions. [2022-07-22 22:34:34,877 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 233 transitions. Word has length 88 [2022-07-22 22:34:34,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:34,877 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 233 transitions. [2022-07-22 22:34:34,878 INFO L496 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) [2022-07-22 22:34:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 233 transitions. [2022-07-22 22:34:34,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-22 22:34:34,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:34,880 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:34,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 22:34:34,880 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:34,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:34,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1641071482, now seen corresponding path program 1 times [2022-07-22 22:34:34,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:34,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851577277] [2022-07-22 22:34:34,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:34,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:35,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:35,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:34:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:35,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:35,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:35,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:35,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:35,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:35,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:34:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:35,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:34:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:35,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 22:34:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:35,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:34:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:35,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 22:34:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:35,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 22:34:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:35,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 22:34:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:35,342 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-22 22:34:35,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:35,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851577277] [2022-07-22 22:34:35,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851577277] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:35,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604361944] [2022-07-22 22:34:35,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:35,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:35,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:35,345 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) [2022-07-22 22:34:35,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 22:34:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:35,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 2646 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 22:34:35,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:35,902 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-22 22:34:35,902 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:34:35,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604361944] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:35,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:34:35,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 22 [2022-07-22 22:34:35,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009453886] [2022-07-22 22:34:35,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:35,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 22:34:35,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:35,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 22:34:35,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2022-07-22 22:34:35,904 INFO L87 Difference]: Start difference. First operand 185 states and 233 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) [2022-07-22 22:34:36,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:36,074 INFO L93 Difference]: Finished difference Result 223 states and 275 transitions. [2022-07-22 22:34:36,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 22:34:36,074 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 [2022-07-22 22:34:36,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:36,078 INFO L225 Difference]: With dead ends: 223 [2022-07-22 22:34:36,078 INFO L226 Difference]: Without dead ends: 185 [2022-07-22 22:34:36,079 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:34:36,080 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 50 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:36,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1198 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:34:36,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-22 22:34:36,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-07-22 22:34:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 129 states have (on average 1.1550387596899225) internal successors, (149), 133 states have internal predecessors, (149), 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) [2022-07-22 22:34:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 232 transitions. [2022-07-22 22:34:36,100 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 232 transitions. Word has length 99 [2022-07-22 22:34:36,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:36,101 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 232 transitions. [2022-07-22 22:34:36,101 INFO L496 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) [2022-07-22 22:34:36,101 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 232 transitions. [2022-07-22 22:34:36,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-22 22:34:36,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:36,102 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:36,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-22 22:34:36,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:36,327 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:36,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:36,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1774035915, now seen corresponding path program 1 times [2022-07-22 22:34:36,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:36,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134402778] [2022-07-22 22:34:36,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:36,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:36,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:36,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:34:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:36,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:36,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:36,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:36,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:36,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:36,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:34:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:36,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:34:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:36,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 22:34:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:36,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:34:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:36,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 22:34:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:36,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 22:34:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:36,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:34:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-22 22:34:36,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:36,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134402778] [2022-07-22 22:34:36,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134402778] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:36,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954348003] [2022-07-22 22:34:36,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:36,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:36,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:36,924 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) [2022-07-22 22:34:36,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-22 22:34:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:37,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 2639 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 22:34:37,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-22 22:34:37,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:34:37,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954348003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:37,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:34:37,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2022-07-22 22:34:37,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100049550] [2022-07-22 22:34:37,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:37,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:34:37,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:37,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:34:37,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2022-07-22 22:34:37,560 INFO L87 Difference]: Start difference. First operand 185 states and 232 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) [2022-07-22 22:34:37,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:37,693 INFO L93 Difference]: Finished difference Result 279 states and 359 transitions. [2022-07-22 22:34:37,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:34:37,694 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 [2022-07-22 22:34:37,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:37,696 INFO L225 Difference]: With dead ends: 279 [2022-07-22 22:34:37,696 INFO L226 Difference]: Without dead ends: 216 [2022-07-22 22:34:37,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2022-07-22 22:34:37,697 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 19 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:37,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 728 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:34:37,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-22 22:34:37,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 195. [2022-07-22 22:34:37,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 135 states have (on average 1.1333333333333333) internal successors, (153), 139 states have internal predecessors, (153), 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) [2022-07-22 22:34:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 247 transitions. [2022-07-22 22:34:37,712 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 247 transitions. Word has length 100 [2022-07-22 22:34:37,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:37,712 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 247 transitions. [2022-07-22 22:34:37,712 INFO L496 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) [2022-07-22 22:34:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 247 transitions. [2022-07-22 22:34:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-22 22:34:37,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:37,714 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:37,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-22 22:34:37,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-22 22:34:37,939 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:37,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:37,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1103291491, now seen corresponding path program 1 times [2022-07-22 22:34:37,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:37,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291629646] [2022-07-22 22:34:37,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:37,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:38,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:38,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:34:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:38,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:38,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:38,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:38,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:38,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:38,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:34:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:38,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:34:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:38,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 22:34:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:38,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:34:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:38,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 22:34:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:38,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 22:34:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:38,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 22:34:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:38,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 22:34:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-22 22:34:38,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:38,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291629646] [2022-07-22 22:34:38,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291629646] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:38,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367316526] [2022-07-22 22:34:38,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:38,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:38,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:38,442 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) [2022-07-22 22:34:38,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-22 22:34:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:38,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 2667 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 22:34:38,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 23 proven. 28 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 22:34:39,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:34:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 22:34:39,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367316526] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:39,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 22:34:39,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18, 7] total 27 [2022-07-22 22:34:39,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814848974] [2022-07-22 22:34:39,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:39,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:34:39,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:39,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:34:39,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=641, Unknown=0, NotChecked=0, Total=702 [2022-07-22 22:34:39,161 INFO L87 Difference]: Start difference. First operand 195 states and 247 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) [2022-07-22 22:34:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:39,357 INFO L93 Difference]: Finished difference Result 272 states and 342 transitions. [2022-07-22 22:34:39,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:34:39,358 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 [2022-07-22 22:34:39,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:39,360 INFO L225 Difference]: With dead ends: 272 [2022-07-22 22:34:39,360 INFO L226 Difference]: Without dead ends: 216 [2022-07-22 22:34:39,361 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:34:39,361 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 210 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:39,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 579 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:34:39,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-22 22:34:39,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 195. [2022-07-22 22:34:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 135 states have (on average 1.1185185185185185) internal successors, (151), 139 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) [2022-07-22 22:34:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 245 transitions. [2022-07-22 22:34:39,376 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 245 transitions. Word has length 109 [2022-07-22 22:34:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:39,377 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 245 transitions. [2022-07-22 22:34:39,377 INFO L496 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) [2022-07-22 22:34:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 245 transitions. [2022-07-22 22:34:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-22 22:34:39,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:39,378 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:39,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-22 22:34:39,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-22 22:34:39,591 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:39,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2087155491, now seen corresponding path program 1 times [2022-07-22 22:34:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:39,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768915364] [2022-07-22 22:34:39,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:39,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:39,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:39,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:34:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:39,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:39,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:39,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:39,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:34:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:34:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 22:34:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:34:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 22:34:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 22:34:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 22:34:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 22:34:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-22 22:34:40,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:40,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768915364] [2022-07-22 22:34:40,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768915364] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:40,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236391273] [2022-07-22 22:34:40,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:40,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:40,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:40,070 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) [2022-07-22 22:34:40,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-22 22:34:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:40,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 2662 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 22:34:40,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 22:34:40,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:34:40,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236391273] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:40,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:34:40,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18] total 25 [2022-07-22 22:34:40,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473945806] [2022-07-22 22:34:40,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:40,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 22:34:40,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:40,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 22:34:40,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2022-07-22 22:34:40,700 INFO L87 Difference]: Start difference. First operand 195 states and 245 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) [2022-07-22 22:34:40,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:40,822 INFO L93 Difference]: Finished difference Result 275 states and 330 transitions. [2022-07-22 22:34:40,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 22:34:40,823 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 [2022-07-22 22:34:40,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:40,824 INFO L225 Difference]: With dead ends: 275 [2022-07-22 22:34:40,824 INFO L226 Difference]: Without dead ends: 185 [2022-07-22 22:34:40,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-07-22 22:34:40,826 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 33 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:40,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1246 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:34:40,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-22 22:34:40,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-07-22 22:34:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 129 states have (on average 1.1085271317829457) internal successors, (143), 133 states have internal predecessors, (143), 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) [2022-07-22 22:34:40,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 226 transitions. [2022-07-22 22:34:40,840 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 226 transitions. Word has length 109 [2022-07-22 22:34:40,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:40,841 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 226 transitions. [2022-07-22 22:34:40,841 INFO L496 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) [2022-07-22 22:34:40,841 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 226 transitions. [2022-07-22 22:34:40,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-22 22:34:40,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:40,842 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:40,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-22 22:34:41,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:41,055 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:41,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:41,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1526938213, now seen corresponding path program 1 times [2022-07-22 22:34:41,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:41,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359261620] [2022-07-22 22:34:41,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:41,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:34:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:34:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:34:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 22:34:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:34:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 22:34:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 22:34:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 22:34:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 22:34:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-22 22:34:41,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:41,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359261620] [2022-07-22 22:34:41,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359261620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:41,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:41,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 22:34:41,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891374382] [2022-07-22 22:34:41,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:41,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:34:41,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:41,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:34:41,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:34:41,307 INFO L87 Difference]: Start difference. First operand 185 states and 226 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) [2022-07-22 22:34:41,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:41,551 INFO L93 Difference]: Finished difference Result 223 states and 268 transitions. [2022-07-22 22:34:41,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:34:41,552 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 [2022-07-22 22:34:41,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:41,553 INFO L225 Difference]: With dead ends: 223 [2022-07-22 22:34:41,553 INFO L226 Difference]: Without dead ends: 166 [2022-07-22 22:34:41,554 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:34:41,554 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 93 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:41,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 310 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:34:41,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-22 22:34:41,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-07-22 22:34:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 119 states have internal predecessors, (127), 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) [2022-07-22 22:34:41,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 198 transitions. [2022-07-22 22:34:41,570 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 198 transitions. Word has length 109 [2022-07-22 22:34:41,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:41,570 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 198 transitions. [2022-07-22 22:34:41,571 INFO L496 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) [2022-07-22 22:34:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 198 transitions. [2022-07-22 22:34:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-22 22:34:41,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:41,573 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:41,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-22 22:34:41,573 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:41,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:41,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2132558451, now seen corresponding path program 1 times [2022-07-22 22:34:41,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:41,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446985933] [2022-07-22 22:34:41,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:41,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:34:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:34:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:34:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 22:34:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:34:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 22:34:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 22:34:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 22:34:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 22:34:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:34:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 22:34:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-22 22:34:41,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:41,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446985933] [2022-07-22 22:34:41,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446985933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:41,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:41,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 22:34:41,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018947474] [2022-07-22 22:34:41,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:41,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:34:41,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:41,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:34:41,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:34:41,855 INFO L87 Difference]: Start difference. First operand 166 states and 198 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) [2022-07-22 22:34:42,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:42,157 INFO L93 Difference]: Finished difference Result 207 states and 243 transitions. [2022-07-22 22:34:42,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:34:42,158 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 [2022-07-22 22:34:42,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:42,159 INFO L225 Difference]: With dead ends: 207 [2022-07-22 22:34:42,159 INFO L226 Difference]: Without dead ends: 166 [2022-07-22 22:34:42,159 INFO L412 NwaCegarLoop]: 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 [2022-07-22 22:34:42,160 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 95 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:42,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 431 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:34:42,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-22 22:34:42,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-07-22 22:34:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 116 states have (on average 1.0862068965517242) internal successors, (126), 119 states have internal predecessors, (126), 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) [2022-07-22 22:34:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 197 transitions. [2022-07-22 22:34:42,176 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 197 transitions. Word has length 134 [2022-07-22 22:34:42,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:42,177 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 197 transitions. [2022-07-22 22:34:42,181 INFO L496 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) [2022-07-22 22:34:42,181 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 197 transitions. [2022-07-22 22:34:42,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-22 22:34:42,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:42,182 INFO L195 NwaCegarLoop]: 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] [2022-07-22 22:34:42,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-22 22:34:42,183 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:42,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:42,183 INFO L85 PathProgramCache]: Analyzing trace with hash 284756267, now seen corresponding path program 1 times [2022-07-22 22:34:42,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:42,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977368324] [2022-07-22 22:34:42,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:42,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:34:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:34:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:34:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 22:34:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:34:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 22:34:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 22:34:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 22:34:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 22:34:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 22:34:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-22 22:34:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:42,640 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-22 22:34:42,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:42,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977368324] [2022-07-22 22:34:42,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977368324] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:42,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561074194] [2022-07-22 22:34:42,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:42,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:42,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:42,643 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) [2022-07-22 22:34:42,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-22 22:34:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:43,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 2752 conjuncts, 101 conjunts are in the unsatisfiable core [2022-07-22 22:34:43,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:46,005 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-22 22:34:46,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:34:53,801 WARN L233 SmtUtils]: Spent 6.38s on a formula simplification. DAG size of input: 38 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 22:34:54,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561074194] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:54,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 22:34:54,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 34] total 44 [2022-07-22 22:34:54,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526993239] [2022-07-22 22:34:54,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 22:34:54,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-22 22:34:54,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:54,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-22 22:34:54,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2992, Unknown=0, NotChecked=0, Total=3192 [2022-07-22 22:34:54,070 INFO L87 Difference]: Start difference. First operand 166 states and 197 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) [2022-07-22 22:34:54,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:54,953 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2022-07-22 22:34:54,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 22:34:54,953 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 [2022-07-22 22:34:54,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:54,954 INFO L225 Difference]: With dead ends: 181 [2022-07-22 22:34:54,954 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 22:34:54,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 142 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=287, Invalid=4405, Unknown=0, NotChecked=0, Total=4692 [2022-07-22 22:34:54,956 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 54 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:54,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 388 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 560 Invalid, 0 Unknown, 54 Unchecked, 0.4s Time] [2022-07-22 22:34:54,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 22:34:54,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 22:34:54,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 22:34:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 22:34:54,957 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2022-07-22 22:34:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:54,957 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 22:34:54,957 INFO L496 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) [2022-07-22 22:34:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 22:34:54,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 22:34:54,960 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 22:34:54,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-22 22:34:55,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-22 22:34:55,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 22:34:57,218 INFO L895 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))) [2022-07-22 22:34:57,218 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2022-07-22 22:34:57,218 INFO L895 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)))) [2022-07-22 22:34:57,218 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-07-22 22:34:57,218 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (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|)) (or .cse0 (<= (+ (* 18446744073709551616 (div (+ 18446744073709551615 (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15)) (= |#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)))) (<= (+ |ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ 18446744073709551615 .cse1 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616))) (+ .cse1 15)))) (= |old(#valid)| |#valid|)))) [2022-07-22 22:34:57,219 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-07-22 22:34:57,219 INFO L895 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)))) [2022-07-22 22:34:57,219 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-07-22 22:34:57,219 INFO L895 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|))) [2022-07-22 22:34:57,219 INFO L895 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|))) [2022-07-22 22:34:57,219 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-07-22 22:34:57,219 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-07-22 22:34:57,219 INFO L895 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|))) [2022-07-22 22:34:57,219 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-07-22 22:34:57,219 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2022-07-22 22:34:57,219 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-22 22:34:57,219 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-07-22 22:34:57,220 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-07-22 22:34:57,220 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-07-22 22:34:57,220 INFO L895 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|))) [2022-07-22 22:34:57,220 INFO L902 garLoopResultBuilder]: At program point aws_array_eqENTRY(lines 7684 7704) the Hoare annotation is: true [2022-07-22 22:34:57,220 INFO L899 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2022-07-22 22:34:57,220 INFO L899 garLoopResultBuilder]: For program point aws_array_eqEXIT(lines 7684 7704) no Hoare annotation was computed. [2022-07-22 22:34:57,220 INFO L902 garLoopResultBuilder]: At program point L7686(line 7686) the Hoare annotation is: true [2022-07-22 22:34:57,220 INFO L899 garLoopResultBuilder]: For program point L7688(lines 7685 7704) no Hoare annotation was computed. [2022-07-22 22:34:57,220 INFO L899 garLoopResultBuilder]: For program point aws_array_eqFINAL(lines 7684 7704) no Hoare annotation was computed. [2022-07-22 22:34:57,220 INFO L902 garLoopResultBuilder]: At program point L7686-1(line 7686) the Hoare annotation is: true [2022-07-22 22:34:57,220 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-22 22:34:57,220 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-22 22:34:57,221 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-22 22:34:57,221 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-22 22:34:57,221 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-22 22:34:57,221 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-22 22:34:57,221 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-22 22:34:57,221 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-07-22 22:34:57,221 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-07-22 22:34:57,222 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-07-22 22:34:57,222 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-07-22 22:34:57,222 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-07-22 22:34:57,222 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-07-22 22:34:57,223 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-07-22 22:34:57,223 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-07-22 22:34:57,223 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-07-22 22:34:57,223 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-07-22 22:34:57,224 INFO L902 garLoopResultBuilder]: At program point aws_byte_cursor_is_validENTRY(lines 7368 7372) the Hoare annotation is: true [2022-07-22 22:34:57,224 INFO L899 garLoopResultBuilder]: For program point L7371(line 7371) no Hoare annotation was computed. [2022-07-22 22:34:57,224 INFO L899 garLoopResultBuilder]: For program point L7371-5(line 7371) no Hoare annotation was computed. [2022-07-22 22:34:57,224 INFO L899 garLoopResultBuilder]: For program point L7371-4(line 7371) no Hoare annotation was computed. [2022-07-22 22:34:57,224 INFO L899 garLoopResultBuilder]: For program point L7371-2(line 7371) no Hoare annotation was computed. [2022-07-22 22:34:57,224 INFO L899 garLoopResultBuilder]: For program point L7371-8(line 7371) no Hoare annotation was computed. [2022-07-22 22:34:57,224 INFO L899 garLoopResultBuilder]: For program point L7371-6(line 7371) no Hoare annotation was computed. [2022-07-22 22:34:57,224 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7368 7372) no Hoare annotation was computed. [2022-07-22 22:34:57,225 INFO L899 garLoopResultBuilder]: For program point L7371-11(line 7371) no Hoare annotation was computed. [2022-07-22 22:34:57,227 INFO L899 garLoopResultBuilder]: For program point L7371-10(line 7371) no Hoare annotation was computed. [2022-07-22 22:34:57,227 INFO L899 garLoopResultBuilder]: For program point L7370(lines 7370 7371) no Hoare annotation was computed. [2022-07-22 22:34:57,227 INFO L899 garLoopResultBuilder]: For program point L7370-2(lines 7370 7371) no Hoare annotation was computed. [2022-07-22 22:34:57,227 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7368 7372) no Hoare annotation was computed. [2022-07-22 22:34:57,227 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-22 22:34:57,227 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-22 22:34:57,227 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-22 22:34:57,227 INFO L899 garLoopResultBuilder]: For program point L6675-1(line 6675) no Hoare annotation was computed. [2022-07-22 22:34:57,227 INFO L895 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|)) [2022-07-22 22:34:57,227 INFO L899 garLoopResultBuilder]: For program point L9549(lines 9549 9550) no Hoare annotation was computed. [2022-07-22 22:34:57,227 INFO L899 garLoopResultBuilder]: For program point L9549-2(lines 9549 9550) no Hoare annotation was computed. [2022-07-22 22:34:57,227 INFO L899 garLoopResultBuilder]: For program point L9549-3(lines 9549 9559) no Hoare annotation was computed. [2022-07-22 22:34:57,228 INFO L895 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))) [2022-07-22 22:34:57,228 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 22:34:57,228 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 22:34:57,228 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2022-07-22 22:34:57,228 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-07-22 22:34:57,228 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-07-22 22:34:57,228 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2022-07-22 22:34:57,228 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-07-22 22:34:57,228 INFO L895 garLoopResultBuilder]: At program point L9560(line 9560) the Hoare annotation is: (and (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (<= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1360#1| 1) (<= 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1360#1|) (< 0 |#StackHeapBarrier|)) [2022-07-22 22:34:57,228 INFO L899 garLoopResultBuilder]: For program point L9560-1(line 9560) no Hoare annotation was computed. [2022-07-22 22:34:57,229 INFO L895 garLoopResultBuilder]: At program point L9329-4(line 9329) 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|)) (.cse9 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0)) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.offset| 0)) (.cse15 (not .cse7)) (.cse16 (not .cse9)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base| 0)) (.cse12 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse13 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse17 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse2 (<= .cse18 (* (div .cse18 18446744073709551616) 18446744073709551616))) (.cse10 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.offset| 0)) (.cse11 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse19 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base|)) (.cse20 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse14 (= |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|)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse8 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1291#1| .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse15 .cse16 .cse3 .cse4 .cse11 .cse12 .cse13 .cse14 .cse5 .cse8) (and .cse0 .cse17 .cse1 (<= 0 (+ (* (div (* (- 1) .cse18) 18446744073709551616) 18446744073709551616) .cse18)) .cse15 .cse16 .cse3 .cse4 .cse11 .cse14 .cse5 .cse8) (and .cse9 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1291#1| .cse10 .cse11 .cse19 .cse20 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse17 .cse2 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1291#1| .cse10 .cse11 .cse19 .cse20 .cse14 .cse5 .cse6 .cse7 .cse8)))) [2022-07-22 22:34:57,229 INFO L899 garLoopResultBuilder]: For program point L9329-5(line 9329) no Hoare annotation was computed. [2022-07-22 22:34:57,229 INFO L899 garLoopResultBuilder]: For program point L9329(line 9329) no Hoare annotation was computed. [2022-07-22 22:34:57,229 INFO L895 garLoopResultBuilder]: At program point L9552(line 9552) the Hoare annotation is: false [2022-07-22 22:34:57,229 INFO L895 garLoopResultBuilder]: At program point L9329-2(line 9329) the Hoare annotation is: (let ((.cse13 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (let ((.cse4 (not .cse13))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.offset| 0)) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base| 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 (let ((.cse14 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.offset| 0))) (or (and .cse13 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1291#1| .cse14) (and (not |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1291#1|) (or .cse4 (not .cse14)))))) (.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))))) [2022-07-22 22:34:57,229 INFO L895 garLoopResultBuilder]: At program point L9552-1(line 9552) the Hoare annotation is: false [2022-07-22 22:34:57,230 INFO L899 garLoopResultBuilder]: For program point L9329-3(line 9329) no Hoare annotation was computed. [2022-07-22 22:34:57,230 INFO L899 garLoopResultBuilder]: For program point L9552-2(line 9552) no Hoare annotation was computed. [2022-07-22 22:34:57,230 INFO L895 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))) [2022-07-22 22:34:57,230 INFO L895 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|)) (.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)) (.cse3 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.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) (and (<= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1350#1| 0) (<= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1350#1|) .cse3 .cse6))) [2022-07-22 22:34:57,230 INFO L899 garLoopResultBuilder]: For program point L9544-2(line 9544) no Hoare annotation was computed. [2022-07-22 22:34:57,230 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-07-22 22:34:57,230 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2022-07-22 22:34:57,230 INFO L899 garLoopResultBuilder]: For program point L9330(line 9330) no Hoare annotation was computed. [2022-07-22 22:34:57,231 INFO L899 garLoopResultBuilder]: For program point L9330-5(line 9330) no Hoare annotation was computed. [2022-07-22 22:34:57,231 INFO L899 garLoopResultBuilder]: For program point L9553(lines 9553 9558) no Hoare annotation was computed. [2022-07-22 22:34:57,231 INFO L895 garLoopResultBuilder]: At program point L9330-2(line 9330) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0)) (.cse1 (< 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base|)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse5 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base|)) (.cse6 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse7 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse8 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse9 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse10 (< 0 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse11 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse12 (< 0 |#StackHeapBarrier|))) (or (and .cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) .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 (= |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)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-07-22 22:34:57,231 INFO L899 garLoopResultBuilder]: For program point L9330-3(line 9330) no Hoare annotation was computed. [2022-07-22 22:34:57,231 INFO L895 garLoopResultBuilder]: At program point L9330-4(line 9330) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0)) (.cse10 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse20 (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 ((.cse5 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.offset| 0)) (.cse3 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base|)) (.cse4 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse9 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse12 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse19 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.offset| 0)) (.cse18 (<= .cse20 (* (div .cse20 18446744073709551616) 18446744073709551616))) (.cse16 (not .cse10)) (.cse17 (not .cse0)) (.cse14 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse15 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1352#1.base| 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|)) (.cse7 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse8 (< 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 .cse12 .cse13 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1293#1| .cse1 .cse14 .cse15 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse13 .cse16 .cse17 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1293#1| .cse14 .cse15 .cse2 .cse5 .cse6 .cse7 .cse8 .cse11) (and .cse12 .cse13 .cse18 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1293#1| .cse14 .cse15 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse19 (<= 0 (+ (* (div (* (- 1) .cse20) 18446744073709551616) 18446744073709551616) .cse20)) .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse19 .cse13 .cse18 .cse16 .cse17 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1293#1| .cse14 .cse15 .cse2 .cse7 .cse8 .cse11)))) [2022-07-22 22:34:57,231 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 22:34:57,231 INFO L902 garLoopResultBuilder]: At program point L9562(line 9562) the Hoare annotation is: true [2022-07-22 22:34:57,231 INFO L899 garLoopResultBuilder]: For program point L9537(lines 9537 9561) no Hoare annotation was computed. [2022-07-22 22:34:57,231 INFO L899 garLoopResultBuilder]: For program point L9331(lines 9331 9339) no Hoare annotation was computed. [2022-07-22 22:34:57,231 INFO L895 garLoopResultBuilder]: At program point L9554(line 9554) the Hoare annotation is: false [2022-07-22 22:34:57,231 INFO L899 garLoopResultBuilder]: For program point L6672(lines 6672 6676) no Hoare annotation was computed. [2022-07-22 22:34:57,231 INFO L899 garLoopResultBuilder]: For program point L9554-1(line 9554) no Hoare annotation was computed. [2022-07-22 22:34:57,232 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2022-07-22 22:34:57,232 INFO L895 garLoopResultBuilder]: At program point L9538(line 9538) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2022-07-22 22:34:57,232 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-07-22 22:34:57,232 INFO L899 garLoopResultBuilder]: For program point L9538-5(lines 9538 9539) no Hoare annotation was computed. [2022-07-22 22:34:57,232 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 22:34:57,232 INFO L899 garLoopResultBuilder]: For program point L9340(lines 9340 9348) no Hoare annotation was computed. [2022-07-22 22:34:57,232 INFO L899 garLoopResultBuilder]: For program point L9538-1(lines 9538 9539) no Hoare annotation was computed. [2022-07-22 22:34:57,232 INFO L895 garLoopResultBuilder]: At program point L9538-2(line 9538) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2022-07-22 22:34:57,233 INFO L899 garLoopResultBuilder]: For program point L9538-3(line 9538) no Hoare annotation was computed. [2022-07-22 22:34:57,233 INFO L899 garLoopResultBuilder]: For program point L9555(lines 9555 9557) no Hoare annotation was computed. [2022-07-22 22:34:57,233 INFO L899 garLoopResultBuilder]: For program point L6673-3(lines 6673 6675) no Hoare annotation was computed. [2022-07-22 22:34:57,233 INFO L899 garLoopResultBuilder]: For program point L6673-1(lines 6673 6675) no Hoare annotation was computed. [2022-07-22 22:34:57,233 INFO L895 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|)) [2022-07-22 22:34:57,233 INFO L895 garLoopResultBuilder]: At program point L9349(line 9349) the Hoare annotation is: false [2022-07-22 22:34:57,233 INFO L899 garLoopResultBuilder]: For program point L9349-1(line 9349) no Hoare annotation was computed. [2022-07-22 22:34:57,234 INFO L895 garLoopResultBuilder]: At program point L9349-2(lines 9327 9350) the Hoare annotation is: (let ((.cse8 (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_~str#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse5 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse6 (< 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse9 (= |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)) (.cse7 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_#res#1| 0) (not .cse0) (not .cse1) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse2 (<= 0 (+ (* (div (* (- 1) .cse8) 18446744073709551616) 18446744073709551616) .cse8)) .cse3 .cse5 .cse6 .cse7))) (and (<= .cse8 (* (div .cse8 18446744073709551616) 18446744073709551616)) .cse6 .cse9 .cse0 .cse7) (and .cse1 .cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.offset| 0) .cse3 .cse4 .cse5 .cse6 .cse9 .cse0 .cse7))) [2022-07-22 22:34:57,234 INFO L895 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))) [2022-07-22 22:34:57,234 INFO L899 garLoopResultBuilder]: For program point L9548-1(line 9548) no Hoare annotation was computed. [2022-07-22 22:34:57,234 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-22 22:34:57,234 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-22 22:34:57,234 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-22 22:34:57,235 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-22 22:34:57,235 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-22 22:34:57,235 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-22 22:34:57,238 INFO L356 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, 1, 1] [2022-07-22 22:34:57,239 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 22:34:57,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:34:57,247 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:34:57,252 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:34:57,253 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:34:57,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 10:34:57 BoogieIcfgContainer [2022-07-22 22:34:57,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 22:34:57,257 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 22:34:57,257 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 22:34:57,257 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 22:34:57,258 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:34:13" (3/4) ... [2022-07-22 22:34:57,260 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 22:34:57,266 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-07-22 22:34:57,266 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-22 22:34:57,266 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2022-07-22 22:34:57,266 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq [2022-07-22 22:34:57,266 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-22 22:34:57,266 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-22 22:34:57,267 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-22 22:34:57,267 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-22 22:34:57,267 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-22 22:34:57,267 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-07-22 22:34:57,282 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 127 nodes and edges [2022-07-22 22:34:57,283 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2022-07-22 22:34:57,284 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-07-22 22:34:57,285 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-22 22:34:57,286 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-22 22:34:57,287 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-22 22:34:57,288 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 22:34:57,289 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 22:34:57,315 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)) || (((((((((str == 0 && cursor == 0) && str == 0) && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 1 < cursor) && str == 0) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown) [2022-07-22 22:34:57,316 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) [2022-07-22 22:34:57,686 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 22:34:57,687 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 22:34:57,687 INFO L158 Benchmark]: Toolchain (without parser) took 47804.81ms. Allocated memory was 88.1MB in the beginning and 522.2MB in the end (delta: 434.1MB). Free memory was 63.9MB in the beginning and 171.2MB in the end (delta: -107.2MB). Peak memory consumption was 325.2MB. Max. memory is 16.1GB. [2022-07-22 22:34:57,688 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 88.1MB. Free memory was 42.6MB in the beginning and 42.5MB in the end (delta: 49.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 22:34:57,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2151.36ms. Allocated memory was 88.1MB in the beginning and 167.8MB in the end (delta: 79.7MB). Free memory was 63.9MB in the beginning and 101.8MB in the end (delta: -37.9MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. [2022-07-22 22:34:57,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 200.36ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 90.2MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 22:34:57,688 INFO L158 Benchmark]: Boogie Preprocessor took 107.97ms. Allocated memory is still 167.8MB. Free memory was 90.2MB in the beginning and 83.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-22 22:34:57,688 INFO L158 Benchmark]: RCFGBuilder took 1402.59ms. Allocated memory is still 167.8MB. Free memory was 83.9MB in the beginning and 96.5MB in the end (delta: -12.7MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2022-07-22 22:34:57,689 INFO L158 Benchmark]: TraceAbstraction took 43500.54ms. Allocated memory was 167.8MB in the beginning and 522.2MB in the end (delta: 354.4MB). Free memory was 96.5MB in the beginning and 303.3MB in the end (delta: -206.8MB). Peak memory consumption was 310.2MB. Max. memory is 16.1GB. [2022-07-22 22:34:57,689 INFO L158 Benchmark]: Witness Printer took 429.88ms. Allocated memory is still 522.2MB. Free memory was 303.3MB in the beginning and 171.2MB in the end (delta: 132.1MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2022-07-22 22:34:57,690 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.20ms. Allocated memory is still 88.1MB. Free memory was 42.6MB in the beginning and 42.5MB in the end (delta: 49.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2151.36ms. Allocated memory was 88.1MB in the beginning and 167.8MB in the end (delta: 79.7MB). Free memory was 63.9MB in the beginning and 101.8MB in the end (delta: -37.9MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 200.36ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 90.2MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.97ms. Allocated memory is still 167.8MB. Free memory was 90.2MB in the beginning and 83.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1402.59ms. Allocated memory is still 167.8MB. Free memory was 83.9MB in the beginning and 96.5MB in the end (delta: -12.7MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. * TraceAbstraction took 43500.54ms. Allocated memory was 167.8MB in the beginning and 522.2MB in the end (delta: 354.4MB). Free memory was 96.5MB in the beginning and 303.3MB in the end (delta: -206.8MB). Peak memory consumption was 310.2MB. Max. memory is 16.1GB. * Witness Printer took 429.88ms. Allocated memory is still 522.2MB. Free memory was 303.3MB in the beginning and 171.2MB in the end (delta: 132.1MB). Peak memory consumption was 132.1MB. 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: 43.4s, OverallIterations: 26, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2482 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2336 mSDsluCounter, 19798 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 376 IncrementalHoareTripleChecker+Unchecked, 15912 mSDsCounter, 745 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5160 IncrementalHoareTripleChecker+Invalid, 6281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 745 mSolverCounterUnsat, 3886 mSDtfsCounter, 5160 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2575 GetRequests, 2141 SyntacticMatches, 35 SemanticMatches, 399 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1904 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=275occurred in iteration=7, InterpolantAutomatonStates: 231, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 351 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 42 LocationsWithAnnotation, 502 PreInvPairs, 554 NumberOfFragments, 1562 HoareAnnotationTreeSize, 502 FomulaSimplifications, 717 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 42 FomulaSimplificationsInter, 19117 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 6.0s SatisfiabilityAnalysisTime, 21.4s InterpolantComputationTime, 3459 NumberOfCodeBlocks, 3459 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3868 ConstructedInterpolants, 106 QuantifiedInterpolants, 16571 SizeOfPredicates, 117 NumberOfNonLiveVariables, 38463 ConjunctsInSsa, 315 ConjunctsInUnsatCore, 47 InterpolantComputations, 21 PerfectInterpolantSequences, 1790/2063 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 [2022-07-22 22:34:57,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:34:57,709 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:34:57,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 22:34:57,712 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)) || (((((((((str == 0 && cursor == 0) && str == 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! [2022-07-22 22:34:57,747 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