./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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_byte_buf_init_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 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:37:16,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:37:16,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:37:16,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:37:16,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:37:16,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:37:16,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:37:16,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:37:16,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:37:16,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:37:16,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:37:16,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:37:16,644 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:37:16,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:37:16,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:37:16,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:37:16,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:37:16,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:37:16,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:37:16,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:37:16,665 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:37:16,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:37:16,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:37:16,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:37:16,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:37:16,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:37:16,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:37:16,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:37:16,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:37:16,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:37:16,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:37:16,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:37:16,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:37:16,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:37:16,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:37:16,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:37:16,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:37:16,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:37:16,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:37:16,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:37:16,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:37:16,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:37:16,680 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 22:37:16,699 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:37:16,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:37:16,700 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:37:16,700 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:37:16,700 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:37:16,701 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:37:16,701 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:37:16,701 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:37:16,701 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:37:16,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:37:16,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:37:16,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:37:16,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:37:16,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:37:16,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:37:16,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:37:16,703 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:37:16,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:37:16,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:37:16,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:37:16,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:37:16,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:37:16,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:37:16,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:37:16,704 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:37:16,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:37:16,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:37:16,704 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:37:16,705 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:37:16,705 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:37:16,705 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 -> 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 [2022-07-13 22:37:16,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:37:16,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:37:16,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:37:16,905 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:37:16,906 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:37:16,907 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2022-07-13 22:37:16,957 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78024cadb/7fc91f8fcda04fb18181e21d2ce4449b/FLAGa0f33bc33 [2022-07-13 22:37:17,563 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:37:17,563 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2022-07-13 22:37:17,600 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78024cadb/7fc91f8fcda04fb18181e21d2ce4449b/FLAGa0f33bc33 [2022-07-13 22:37:17,982 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78024cadb/7fc91f8fcda04fb18181e21d2ce4449b [2022-07-13 22:37:17,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:37:17,984 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:37:17,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:37:17,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:37:18,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:37:18,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:37:17" (1/1) ... [2022-07-13 22:37:18,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b05a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:37:18, skipping insertion in model container [2022-07-13 22:37:18,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:37:17" (1/1) ... [2022-07-13 22:37:18,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:37:18,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:37:18,295 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_byte_buf_init_harness.i[4491,4504] [2022-07-13 22:37:18,301 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_byte_buf_init_harness.i[4551,4564] [2022-07-13 22:37:18,762 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:18,762 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:18,762 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:18,763 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:18,763 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:18,771 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:18,771 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:18,773 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:18,773 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:18,960 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:37:18,961 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:37:18,961 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:37:18,962 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:37:18,963 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:37:18,964 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:37:18,964 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:37:18,965 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:37:18,965 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:37:18,965 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:37:19,057 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:37:19,147 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:19,147 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:19,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:37:19,240 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:37:19,258 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_byte_buf_init_harness.i[4491,4504] [2022-07-13 22:37:19,258 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_byte_buf_init_harness.i[4551,4564] [2022-07-13 22:37:19,282 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:19,284 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:19,285 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:19,285 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:19,288 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:19,292 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:19,294 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:19,295 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:19,296 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:19,335 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:37:19,336 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:37:19,337 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:37:19,337 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:37:19,338 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:37:19,338 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:37:19,338 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:37:19,339 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:37:19,339 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:37:19,340 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:37:19,362 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:37:19,407 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:19,408 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:37:19,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:37:19,596 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:37:19,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:37:19 WrapperNode [2022-07-13 22:37:19,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:37:19,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:37:19,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:37:19,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:37:19,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:37:19" (1/1) ... [2022-07-13 22:37:19,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:37:19" (1/1) ... [2022-07-13 22:37:19,755 INFO L137 Inliner]: procedures = 690, calls = 2496, calls flagged for inlining = 54, calls inlined = 5, statements flattened = 779 [2022-07-13 22:37:19,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:37:19,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:37:19,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:37:19,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:37:19,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:37:19" (1/1) ... [2022-07-13 22:37:19,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:37:19" (1/1) ... [2022-07-13 22:37:19,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:37:19" (1/1) ... [2022-07-13 22:37:19,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:37:19" (1/1) ... [2022-07-13 22:37:19,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:37:19" (1/1) ... [2022-07-13 22:37:19,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:37:19" (1/1) ... [2022-07-13 22:37:19,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:37:19" (1/1) ... [2022-07-13 22:37:19,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:37:19,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:37:19,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:37:19,836 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:37:19,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:37:19" (1/1) ... [2022-07-13 22:37:19,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:37:19,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:37:19,884 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-13 22:37:19,907 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-13 22:37:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-13 22:37:19,914 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-13 22:37:19,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:37:19,914 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-13 22:37:19,914 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-13 22:37:19,914 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-07-13 22:37:19,914 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-07-13 22:37:19,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:37:19,915 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-13 22:37:19,916 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-13 22:37:19,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:37:19,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:37:19,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:37:19,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:37:19,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:37:19,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:37:19,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:37:19,917 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-13 22:37:19,917 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-13 22:37:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-07-13 22:37:19,918 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-07-13 22:37:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:37:19,918 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:37:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-07-13 22:37:19,918 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-07-13 22:37:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:37:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:37:19,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:37:19,919 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-13 22:37:19,919 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-13 22:37:19,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:37:19,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:37:20,144 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:37:20,145 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:37:20,946 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:37:20,955 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:37:20,956 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 22:37:20,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:37:20 BoogieIcfgContainer [2022-07-13 22:37:20,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:37:20,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:37:20,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:37:20,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:37:20,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:37:17" (1/3) ... [2022-07-13 22:37:20,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4555156a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:37:20, skipping insertion in model container [2022-07-13 22:37:20,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:37:19" (2/3) ... [2022-07-13 22:37:20,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4555156a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:37:20, skipping insertion in model container [2022-07-13 22:37:20,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:37:20" (3/3) ... [2022-07-13 22:37:20,964 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_init_harness.i [2022-07-13 22:37:20,974 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:37:20,974 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:37:21,026 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:37:21,035 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@33e65a52, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@11acfa14 [2022-07-13 22:37:21,036 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:37:21,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 68 states have internal predecessors, (83), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-13 22:37:21,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 22:37:21,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:21,047 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 22:37:21,048 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:21,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:21,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1013294361, now seen corresponding path program 1 times [2022-07-13 22:37:21,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:21,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648817752] [2022-07-13 22:37:21,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:21,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:21,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:21,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:21,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:21,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:37:21,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:21,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648817752] [2022-07-13 22:37:21,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648817752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:21,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:21,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 22:37:21,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133570249] [2022-07-13 22:37:21,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:21,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 22:37:21,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:21,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 22:37:21,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 22:37:21,558 INFO L87 Difference]: Start difference. First operand has 99 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 68 states have internal predecessors, (83), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 22:37:21,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:21,596 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2022-07-13 22:37:21,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 22:37:21,598 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-07-13 22:37:21,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:21,608 INFO L225 Difference]: With dead ends: 193 [2022-07-13 22:37:21,608 INFO L226 Difference]: Without dead ends: 93 [2022-07-13 22:37:21,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 22:37:21,620 INFO L413 NwaCegarLoop]: 121 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, 121 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-13 22:37:21,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:37:21,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-13 22:37:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-07-13 22:37:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 63 states have internal predecessors, (75), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-07-13 22:37:21,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2022-07-13 22:37:21,665 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 31 [2022-07-13 22:37:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:21,668 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2022-07-13 22:37:21,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 22:37:21,668 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2022-07-13 22:37:21,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 22:37:21,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:21,671 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 22:37:21,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:37:21,671 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:21,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:21,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1912179751, now seen corresponding path program 1 times [2022-07-13 22:37:21,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:21,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333780569] [2022-07-13 22:37:21,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:21,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:21,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:21,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:21,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:21,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:37:21,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:21,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333780569] [2022-07-13 22:37:21,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333780569] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:21,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:21,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 22:37:21,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842614953] [2022-07-13 22:37:21,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:21,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:37:21,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:21,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:37:21,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:37:21,862 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 22:37:21,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:21,925 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2022-07-13 22:37:21,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:37:21,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-07-13 22:37:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:21,929 INFO L225 Difference]: With dead ends: 147 [2022-07-13 22:37:21,929 INFO L226 Difference]: Without dead ends: 110 [2022-07-13 22:37:21,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-13 22:37:21,930 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 9 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:21,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 339 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:37:21,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-13 22:37:21,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2022-07-13 22:37:21,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-07-13 22:37:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2022-07-13 22:37:21,938 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 31 [2022-07-13 22:37:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:21,938 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2022-07-13 22:37:21,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 22:37:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2022-07-13 22:37:21,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 22:37:21,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:21,940 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 22:37:21,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 22:37:21,940 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:21,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:21,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2124622107, now seen corresponding path program 1 times [2022-07-13 22:37:21,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:21,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732339133] [2022-07-13 22:37:21,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:21,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:22,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:22,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:22,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:22,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:37:22,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:22,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732339133] [2022-07-13 22:37:22,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732339133] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:22,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:22,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:37:22,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969803696] [2022-07-13 22:37:22,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:22,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:37:22,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:22,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:37:22,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:37:22,157 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 22:37:22,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:22,221 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2022-07-13 22:37:22,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:37:22,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-07-13 22:37:22,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:22,223 INFO L225 Difference]: With dead ends: 134 [2022-07-13 22:37:22,223 INFO L226 Difference]: Without dead ends: 96 [2022-07-13 22:37:22,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:37:22,224 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 46 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:22,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 456 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:37:22,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-13 22:37:22,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-13 22:37:22,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-07-13 22:37:22,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-07-13 22:37:22,230 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 31 [2022-07-13 22:37:22,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:22,230 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-07-13 22:37:22,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 22:37:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-07-13 22:37:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 22:37:22,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:22,232 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 22:37:22,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 22:37:22,232 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:22,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:22,232 INFO L85 PathProgramCache]: Analyzing trace with hash 966724818, now seen corresponding path program 1 times [2022-07-13 22:37:22,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:22,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75599329] [2022-07-13 22:37:22,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:22,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:22,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:22,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:22,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:22,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:37:22,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:22,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75599329] [2022-07-13 22:37:22,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75599329] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:22,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:22,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 22:37:22,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087053473] [2022-07-13 22:37:22,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:22,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:37:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:22,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:37:22,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:37:22,423 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 22:37:22,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:22,457 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2022-07-13 22:37:22,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:37:22,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-07-13 22:37:22,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:22,461 INFO L225 Difference]: With dead ends: 141 [2022-07-13 22:37:22,461 INFO L226 Difference]: Without dead ends: 106 [2022-07-13 22:37:22,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-13 22:37:22,464 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 29 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:22,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 320 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:37:22,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-13 22:37:22,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2022-07-13 22:37:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-07-13 22:37:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2022-07-13 22:37:22,470 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 37 [2022-07-13 22:37:22,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:22,470 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2022-07-13 22:37:22,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 22:37:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-07-13 22:37:22,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 22:37:22,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:22,472 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 22:37:22,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 22:37:22,472 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:22,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:22,473 INFO L85 PathProgramCache]: Analyzing trace with hash 265660240, now seen corresponding path program 1 times [2022-07-13 22:37:22,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:22,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890715026] [2022-07-13 22:37:22,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:22,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:22,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:22,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:22,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:22,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:22,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:37:22,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:22,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890715026] [2022-07-13 22:37:22,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890715026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:22,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:22,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:37:22,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135012496] [2022-07-13 22:37:22,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:22,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:37:22,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:22,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:37:22,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:37:22,726 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 22:37:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:22,777 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2022-07-13 22:37:22,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:37:22,778 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-07-13 22:37:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:22,779 INFO L225 Difference]: With dead ends: 110 [2022-07-13 22:37:22,780 INFO L226 Difference]: Without dead ends: 108 [2022-07-13 22:37:22,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 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-13 22:37:22,781 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 22 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:22,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 726 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:37:22,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-13 22:37:22,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2022-07-13 22:37:22,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 75 states have internal predecessors, (85), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2022-07-13 22:37:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2022-07-13 22:37:22,799 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 37 [2022-07-13 22:37:22,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:22,801 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2022-07-13 22:37:22,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 22:37:22,801 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2022-07-13 22:37:22,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 22:37:22,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:22,806 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:37:22,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 22:37:22,807 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:22,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:22,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1062822234, now seen corresponding path program 1 times [2022-07-13 22:37:22,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:22,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559745397] [2022-07-13 22:37:22,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:22,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:22,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:22,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:22,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:22,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:37:23,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:23,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559745397] [2022-07-13 22:37:23,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559745397] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:23,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:23,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:37:23,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623936531] [2022-07-13 22:37:23,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:23,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:37:23,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:23,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:37:23,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:37:23,064 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 22:37:23,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:23,283 INFO L93 Difference]: Finished difference Result 184 states and 229 transitions. [2022-07-13 22:37:23,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:37:23,284 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-07-13 22:37:23,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:23,285 INFO L225 Difference]: With dead ends: 184 [2022-07-13 22:37:23,285 INFO L226 Difference]: Without dead ends: 143 [2022-07-13 22:37:23,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:37:23,287 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 78 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:23,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 633 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:37:23,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-13 22:37:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 121. [2022-07-13 22:37:23,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 86 states have (on average 1.186046511627907) internal successors, (102), 89 states have internal predecessors, (102), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-07-13 22:37:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2022-07-13 22:37:23,301 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 41 [2022-07-13 22:37:23,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:23,301 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2022-07-13 22:37:23,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 22:37:23,302 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2022-07-13 22:37:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 22:37:23,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:23,304 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:37:23,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 22:37:23,304 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:23,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:23,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1952281384, now seen corresponding path program 1 times [2022-07-13 22:37:23,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:23,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094139048] [2022-07-13 22:37:23,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:23,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:23,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:23,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:23,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:23,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:37:23,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:23,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094139048] [2022-07-13 22:37:23,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094139048] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:23,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:23,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:37:23,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215182488] [2022-07-13 22:37:23,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:23,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:37:23,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:23,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:37:23,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:37:23,532 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 22:37:23,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:23,769 INFO L93 Difference]: Finished difference Result 210 states and 261 transitions. [2022-07-13 22:37:23,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:37:23,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-07-13 22:37:23,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:23,771 INFO L225 Difference]: With dead ends: 210 [2022-07-13 22:37:23,771 INFO L226 Difference]: Without dead ends: 155 [2022-07-13 22:37:23,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:37:23,772 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 56 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:23,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 622 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:37:23,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-13 22:37:23,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 123. [2022-07-13 22:37:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 91 states have internal predecessors, (105), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-07-13 22:37:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2022-07-13 22:37:23,780 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 41 [2022-07-13 22:37:23,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:23,780 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2022-07-13 22:37:23,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 22:37:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2022-07-13 22:37:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 22:37:23,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:23,781 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:37:23,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 22:37:23,781 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:23,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:23,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1694115946, now seen corresponding path program 1 times [2022-07-13 22:37:23,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:23,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141641021] [2022-07-13 22:37:23,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:23,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:24,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:24,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:24,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:24,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:37:24,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:24,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141641021] [2022-07-13 22:37:24,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141641021] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:24,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:24,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 22:37:24,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040810594] [2022-07-13 22:37:24,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:24,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 22:37:24,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:24,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 22:37:24,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:37:24,231 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 22:37:24,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:24,677 INFO L93 Difference]: Finished difference Result 212 states and 270 transitions. [2022-07-13 22:37:24,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:37:24,677 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2022-07-13 22:37:24,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:24,678 INFO L225 Difference]: With dead ends: 212 [2022-07-13 22:37:24,678 INFO L226 Difference]: Without dead ends: 155 [2022-07-13 22:37:24,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:37:24,679 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 237 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:24,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 568 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:37:24,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-13 22:37:24,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 137. [2022-07-13 22:37:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 100 states have (on average 1.21) internal successors, (121), 105 states have internal predecessors, (121), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2022-07-13 22:37:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2022-07-13 22:37:24,691 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 41 [2022-07-13 22:37:24,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:24,692 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2022-07-13 22:37:24,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 22:37:24,692 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2022-07-13 22:37:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 22:37:24,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:24,693 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:37:24,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 22:37:24,693 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:24,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:24,694 INFO L85 PathProgramCache]: Analyzing trace with hash -267360230, now seen corresponding path program 1 times [2022-07-13 22:37:24,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:24,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039907814] [2022-07-13 22:37:24,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:24,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:24,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:24,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:24,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:24,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:37:24,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:24,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039907814] [2022-07-13 22:37:24,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039907814] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:24,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:24,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:37:24,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831292955] [2022-07-13 22:37:24,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:24,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:37:24,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:24,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:37:24,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:37:24,870 INFO L87 Difference]: Start difference. First operand 137 states and 170 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 22:37:24,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:24,944 INFO L93 Difference]: Finished difference Result 225 states and 287 transitions. [2022-07-13 22:37:24,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:37:24,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-07-13 22:37:24,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:24,946 INFO L225 Difference]: With dead ends: 225 [2022-07-13 22:37:24,946 INFO L226 Difference]: Without dead ends: 156 [2022-07-13 22:37:24,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:37:24,947 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 30 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:24,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 340 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:37:24,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-13 22:37:24,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 138. [2022-07-13 22:37:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 101 states have (on average 1.198019801980198) internal successors, (121), 106 states have internal predecessors, (121), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2022-07-13 22:37:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2022-07-13 22:37:24,955 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 41 [2022-07-13 22:37:24,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:24,956 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2022-07-13 22:37:24,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 22:37:24,956 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2022-07-13 22:37:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 22:37:24,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:24,957 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 22:37:24,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 22:37:24,957 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:24,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:24,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1627279489, now seen corresponding path program 1 times [2022-07-13 22:37:24,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:24,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682946105] [2022-07-13 22:37:24,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:24,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:25,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:25,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:25,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:25,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:25,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:37:25,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:25,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682946105] [2022-07-13 22:37:25,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682946105] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:25,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:25,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:37:25,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619934489] [2022-07-13 22:37:25,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:25,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:37:25,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:25,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:37:25,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:37:25,148 INFO L87 Difference]: Start difference. First operand 138 states and 170 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 22:37:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:25,252 INFO L93 Difference]: Finished difference Result 164 states and 199 transitions. [2022-07-13 22:37:25,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:37:25,253 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-07-13 22:37:25,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:25,255 INFO L225 Difference]: With dead ends: 164 [2022-07-13 22:37:25,255 INFO L226 Difference]: Without dead ends: 162 [2022-07-13 22:37:25,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:37:25,256 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 26 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:25,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 925 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:37:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-13 22:37:25,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2022-07-13 22:37:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 114 states have internal predecessors, (128), 22 states have call successors, (22), 11 states have call predecessors, (22), 15 states have return successors, (29), 20 states have call predecessors, (29), 21 states have call successors, (29) [2022-07-13 22:37:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2022-07-13 22:37:25,270 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 43 [2022-07-13 22:37:25,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:25,270 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2022-07-13 22:37:25,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 22:37:25,270 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2022-07-13 22:37:25,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 22:37:25,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:25,271 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 22:37:25,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 22:37:25,272 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:25,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:25,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1966623229, now seen corresponding path program 1 times [2022-07-13 22:37:25,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:25,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708365150] [2022-07-13 22:37:25,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:25,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:25,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:25,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:25,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:25,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:37:25,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:25,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708365150] [2022-07-13 22:37:25,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708365150] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:25,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:25,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:37:25,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642657400] [2022-07-13 22:37:25,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:25,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:37:25,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:25,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:37:25,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:37:25,496 INFO L87 Difference]: Start difference. First operand 146 states and 179 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 22:37:25,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:25,643 INFO L93 Difference]: Finished difference Result 250 states and 311 transitions. [2022-07-13 22:37:25,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:37:25,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2022-07-13 22:37:25,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:25,653 INFO L225 Difference]: With dead ends: 250 [2022-07-13 22:37:25,653 INFO L226 Difference]: Without dead ends: 172 [2022-07-13 22:37:25,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:37:25,654 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 44 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:25,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 458 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:37:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-13 22:37:25,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 139. [2022-07-13 22:37:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 102 states have (on average 1.196078431372549) internal successors, (122), 107 states have internal predecessors, (122), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-07-13 22:37:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 170 transitions. [2022-07-13 22:37:25,661 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 170 transitions. Word has length 43 [2022-07-13 22:37:25,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:25,661 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 170 transitions. [2022-07-13 22:37:25,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 22:37:25,662 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 170 transitions. [2022-07-13 22:37:25,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 22:37:25,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:25,662 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:37:25,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 22:37:25,663 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:25,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:25,663 INFO L85 PathProgramCache]: Analyzing trace with hash 598348136, now seen corresponding path program 1 times [2022-07-13 22:37:25,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:25,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335070631] [2022-07-13 22:37:25,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:25,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:25,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:25,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:25,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:25,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:25,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:37:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:25,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:37:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 22:37:25,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:25,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335070631] [2022-07-13 22:37:25,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335070631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:25,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:25,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:37:25,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596990968] [2022-07-13 22:37:25,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:25,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:37:25,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:25,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:37:25,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:37:25,825 INFO L87 Difference]: Start difference. First operand 139 states and 170 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 22:37:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:25,868 INFO L93 Difference]: Finished difference Result 151 states and 184 transitions. [2022-07-13 22:37:25,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:37:25,869 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2022-07-13 22:37:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:25,870 INFO L225 Difference]: With dead ends: 151 [2022-07-13 22:37:25,870 INFO L226 Difference]: Without dead ends: 149 [2022-07-13 22:37:25,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 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-13 22:37:25,871 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 22 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:25,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 741 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:37:25,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-13 22:37:25,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2022-07-13 22:37:25,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 114 states have internal predecessors, (128), 23 states have call successors, (23), 12 states have call predecessors, (23), 16 states have return successors, (30), 21 states have call predecessors, (30), 22 states have call successors, (30) [2022-07-13 22:37:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 181 transitions. [2022-07-13 22:37:25,877 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 181 transitions. Word has length 57 [2022-07-13 22:37:25,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:25,877 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 181 transitions. [2022-07-13 22:37:25,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 22:37:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 181 transitions. [2022-07-13 22:37:25,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 22:37:25,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:25,879 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 22:37:25,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 22:37:25,879 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:25,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:25,879 INFO L85 PathProgramCache]: Analyzing trace with hash 803127154, now seen corresponding path program 1 times [2022-07-13 22:37:25,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:25,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775005830] [2022-07-13 22:37:25,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:25,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:25,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:26,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:26,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:26,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:26,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:37:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:26,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:37:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 22:37:26,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:26,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775005830] [2022-07-13 22:37:26,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775005830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:26,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:26,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:37:26,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700398872] [2022-07-13 22:37:26,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:26,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:37:26,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:26,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:37:26,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:37:26,090 INFO L87 Difference]: Start difference. First operand 148 states and 181 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-13 22:37:26,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:26,286 INFO L93 Difference]: Finished difference Result 191 states and 238 transitions. [2022-07-13 22:37:26,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:37:26,287 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 61 [2022-07-13 22:37:26,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:26,287 INFO L225 Difference]: With dead ends: 191 [2022-07-13 22:37:26,288 INFO L226 Difference]: Without dead ends: 178 [2022-07-13 22:37:26,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:37:26,288 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 130 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:26,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 603 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:37:26,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-13 22:37:26,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2022-07-13 22:37:26,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.173913043478261) internal successors, (135), 123 states have internal predecessors, (135), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (36), 21 states have call predecessors, (36), 23 states have call successors, (36) [2022-07-13 22:37:26,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2022-07-13 22:37:26,295 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 61 [2022-07-13 22:37:26,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:26,295 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2022-07-13 22:37:26,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-13 22:37:26,295 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2022-07-13 22:37:26,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 22:37:26,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:26,296 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:37:26,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 22:37:26,297 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:26,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:26,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2082990832, now seen corresponding path program 1 times [2022-07-13 22:37:26,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:26,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021901564] [2022-07-13 22:37:26,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:26,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:26,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:26,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:26,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:26,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:26,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:37:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:26,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:37:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:26,504 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 22:37:26,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:26,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021901564] [2022-07-13 22:37:26,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021901564] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:26,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:26,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:37:26,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704552543] [2022-07-13 22:37:26,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:26,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:37:26,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:26,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:37:26,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:37:26,507 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-13 22:37:26,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:26,742 INFO L93 Difference]: Finished difference Result 204 states and 252 transitions. [2022-07-13 22:37:26,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:37:26,742 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 61 [2022-07-13 22:37:26,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:26,743 INFO L225 Difference]: With dead ends: 204 [2022-07-13 22:37:26,744 INFO L226 Difference]: Without dead ends: 191 [2022-07-13 22:37:26,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:37:26,744 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 66 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:26,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 752 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:37:26,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-13 22:37:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 157. [2022-07-13 22:37:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.173913043478261) internal successors, (135), 123 states have internal predecessors, (135), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (36), 21 states have call predecessors, (36), 23 states have call successors, (36) [2022-07-13 22:37:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2022-07-13 22:37:26,758 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 61 [2022-07-13 22:37:26,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:26,759 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2022-07-13 22:37:26,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-13 22:37:26,759 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2022-07-13 22:37:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 22:37:26,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:26,760 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:37:26,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 22:37:26,760 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:26,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:26,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1953811026, now seen corresponding path program 1 times [2022-07-13 22:37:26,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:26,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145691442] [2022-07-13 22:37:26,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:26,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:26,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:26,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:26,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:26,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:27,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:37:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:27,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:37:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:27,185 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 22:37:27,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:27,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145691442] [2022-07-13 22:37:27,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145691442] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:37:27,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976320625] [2022-07-13 22:37:27,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:27,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:37:27,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:37:27,189 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-13 22:37:27,190 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-13 22:37:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:27,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 2459 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-13 22:37:27,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:37:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:37:28,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:37:28,693 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-13 22:37:28,694 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-13 22:37:28,703 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-07-13 22:37:28,704 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 24 treesize of output 12 [2022-07-13 22:37:28,818 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-13 22:37:28,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-13 22:37:28,828 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-07-13 22:37:28,828 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 24 treesize of output 12 [2022-07-13 22:37:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 22:37:28,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976320625] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:37:28,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:37:28,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 12] total 31 [2022-07-13 22:37:28,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836075005] [2022-07-13 22:37:28,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:37:28,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-13 22:37:28,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:28,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-13 22:37:28,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2022-07-13 22:37:28,871 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 8 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-07-13 22:37:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:29,931 INFO L93 Difference]: Finished difference Result 288 states and 345 transitions. [2022-07-13 22:37:29,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 22:37:29,932 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 8 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 61 [2022-07-13 22:37:29,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:29,933 INFO L225 Difference]: With dead ends: 288 [2022-07-13 22:37:29,933 INFO L226 Difference]: Without dead ends: 234 [2022-07-13 22:37:29,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 113 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=313, Invalid=1849, Unknown=0, NotChecked=0, Total=2162 [2022-07-13 22:37:29,935 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 382 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1765 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:29,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1765 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 795 Invalid, 0 Unknown, 178 Unchecked, 0.5s Time] [2022-07-13 22:37:29,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-13 22:37:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 207. [2022-07-13 22:37:29,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 153 states have (on average 1.1568627450980393) internal successors, (177), 162 states have internal predecessors, (177), 31 states have call successors, (31), 16 states have call predecessors, (31), 22 states have return successors, (43), 28 states have call predecessors, (43), 29 states have call successors, (43) [2022-07-13 22:37:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 251 transitions. [2022-07-13 22:37:29,947 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 251 transitions. Word has length 61 [2022-07-13 22:37:29,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:29,947 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 251 transitions. [2022-07-13 22:37:29,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 8 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-07-13 22:37:29,948 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 251 transitions. [2022-07-13 22:37:29,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 22:37:29,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:29,949 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:37:29,973 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-13 22:37:30,163 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,SelfDestructingSolverStorable14 [2022-07-13 22:37:30,163 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:30,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:30,164 INFO L85 PathProgramCache]: Analyzing trace with hash 151989603, now seen corresponding path program 1 times [2022-07-13 22:37:30,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:30,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329310055] [2022-07-13 22:37:30,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:30,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:30,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:30,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:30,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:30,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:30,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:37:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:30,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:37:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:30,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:37:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 22:37:30,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:30,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329310055] [2022-07-13 22:37:30,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329310055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:30,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:30,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:37:30,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791167831] [2022-07-13 22:37:30,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:30,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:37:30,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:30,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:37:30,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:37:30,475 INFO L87 Difference]: Start difference. First operand 207 states and 251 transitions. Second operand has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 22:37:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:30,640 INFO L93 Difference]: Finished difference Result 225 states and 272 transitions. [2022-07-13 22:37:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:37:30,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2022-07-13 22:37:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:30,642 INFO L225 Difference]: With dead ends: 225 [2022-07-13 22:37:30,642 INFO L226 Difference]: Without dead ends: 223 [2022-07-13 22:37:30,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:37:30,642 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 39 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:30,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 570 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:37:30,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-13 22:37:30,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2022-07-13 22:37:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 160 states have (on average 1.15) internal successors, (184), 169 states have internal predecessors, (184), 34 states have call successors, (34), 18 states have call predecessors, (34), 24 states have return successors, (46), 31 states have call predecessors, (46), 32 states have call successors, (46) [2022-07-13 22:37:30,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 264 transitions. [2022-07-13 22:37:30,652 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 264 transitions. Word has length 63 [2022-07-13 22:37:30,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:30,652 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 264 transitions. [2022-07-13 22:37:30,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 22:37:30,653 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 264 transitions. [2022-07-13 22:37:30,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 22:37:30,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:30,654 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:37:30,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 22:37:30,654 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:30,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:30,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1802659993, now seen corresponding path program 1 times [2022-07-13 22:37:30,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:30,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656378409] [2022-07-13 22:37:30,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:30,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:30,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:30,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:30,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:30,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:30,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:37:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:30,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:37:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 22:37:30,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:30,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656378409] [2022-07-13 22:37:30,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656378409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:30,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:30,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:37:30,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296512000] [2022-07-13 22:37:30,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:30,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:37:30,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:30,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:37:30,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:37:30,844 INFO L87 Difference]: Start difference. First operand 219 states and 264 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 22:37:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:30,944 INFO L93 Difference]: Finished difference Result 247 states and 294 transitions. [2022-07-13 22:37:30,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:37:30,945 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2022-07-13 22:37:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:30,946 INFO L225 Difference]: With dead ends: 247 [2022-07-13 22:37:30,946 INFO L226 Difference]: Without dead ends: 245 [2022-07-13 22:37:30,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:37:30,947 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 26 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:30,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 946 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:37:30,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-07-13 22:37:30,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 227. [2022-07-13 22:37:30,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 167 states have (on average 1.1437125748502994) internal successors, (191), 177 states have internal predecessors, (191), 34 states have call successors, (34), 18 states have call predecessors, (34), 25 states have return successors, (47), 31 states have call predecessors, (47), 32 states have call successors, (47) [2022-07-13 22:37:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 272 transitions. [2022-07-13 22:37:30,957 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 272 transitions. Word has length 63 [2022-07-13 22:37:30,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:30,957 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 272 transitions. [2022-07-13 22:37:30,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 22:37:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 272 transitions. [2022-07-13 22:37:30,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 22:37:30,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:30,958 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:37:30,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 22:37:30,958 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:30,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:30,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1791242725, now seen corresponding path program 1 times [2022-07-13 22:37:30,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:30,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282637187] [2022-07-13 22:37:30,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:30,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:37:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:37:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 22:37:31,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:31,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282637187] [2022-07-13 22:37:31,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282637187] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:31,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:31,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:37:31,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345104365] [2022-07-13 22:37:31,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:31,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:37:31,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:31,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:37:31,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:37:31,169 INFO L87 Difference]: Start difference. First operand 227 states and 272 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-13 22:37:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:31,346 INFO L93 Difference]: Finished difference Result 269 states and 317 transitions. [2022-07-13 22:37:31,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:37:31,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 63 [2022-07-13 22:37:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:31,348 INFO L225 Difference]: With dead ends: 269 [2022-07-13 22:37:31,348 INFO L226 Difference]: Without dead ends: 231 [2022-07-13 22:37:31,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:37:31,349 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 51 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:31,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 604 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:37:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-13 22:37:31,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 214. [2022-07-13 22:37:31,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 157 states have (on average 1.1464968152866242) internal successors, (180), 165 states have internal predecessors, (180), 33 states have call successors, (33), 18 states have call predecessors, (33), 23 states have return successors, (43), 30 states have call predecessors, (43), 31 states have call successors, (43) [2022-07-13 22:37:31,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 256 transitions. [2022-07-13 22:37:31,358 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 256 transitions. Word has length 63 [2022-07-13 22:37:31,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:31,358 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 256 transitions. [2022-07-13 22:37:31,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-13 22:37:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 256 transitions. [2022-07-13 22:37:31,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-13 22:37:31,359 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:31,359 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:37:31,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 22:37:31,359 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:31,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:31,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1204360676, now seen corresponding path program 1 times [2022-07-13 22:37:31,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:31,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300775543] [2022-07-13 22:37:31,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:31,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:37:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:37:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:37:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:37:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 22:37:31,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:31,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300775543] [2022-07-13 22:37:31,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300775543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:31,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:31,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:37:31,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4310091] [2022-07-13 22:37:31,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:31,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:37:31,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:31,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:37:31,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:37:31,559 INFO L87 Difference]: Start difference. First operand 214 states and 256 transitions. Second operand has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 22:37:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:31,680 INFO L93 Difference]: Finished difference Result 228 states and 270 transitions. [2022-07-13 22:37:31,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:37:31,680 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 69 [2022-07-13 22:37:31,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:31,681 INFO L225 Difference]: With dead ends: 228 [2022-07-13 22:37:31,681 INFO L226 Difference]: Without dead ends: 224 [2022-07-13 22:37:31,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:37:31,682 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 20 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:31,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 670 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:37:31,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-13 22:37:31,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2022-07-13 22:37:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 163 states have (on average 1.1349693251533743) internal successors, (185), 170 states have internal predecessors, (185), 34 states have call successors, (34), 20 states have call predecessors, (34), 24 states have return successors, (44), 31 states have call predecessors, (44), 32 states have call successors, (44) [2022-07-13 22:37:31,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 263 transitions. [2022-07-13 22:37:31,691 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 263 transitions. Word has length 69 [2022-07-13 22:37:31,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:31,692 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 263 transitions. [2022-07-13 22:37:31,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 22:37:31,692 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 263 transitions. [2022-07-13 22:37:31,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 22:37:31,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:31,694 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:37:31,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 22:37:31,694 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:31,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:31,695 INFO L85 PathProgramCache]: Analyzing trace with hash 348625887, now seen corresponding path program 1 times [2022-07-13 22:37:31,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:31,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032849903] [2022-07-13 22:37:31,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:31,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:37:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:31,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:37:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 22:37:32,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:32,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032849903] [2022-07-13 22:37:32,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032849903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:32,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:32,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 22:37:32,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436531143] [2022-07-13 22:37:32,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:32,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 22:37:32,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:32,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 22:37:32,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:37:32,077 INFO L87 Difference]: Start difference. First operand 222 states and 263 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-13 22:37:32,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:32,607 INFO L93 Difference]: Finished difference Result 280 states and 334 transitions. [2022-07-13 22:37:32,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 22:37:32,607 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 67 [2022-07-13 22:37:32,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:32,608 INFO L225 Difference]: With dead ends: 280 [2022-07-13 22:37:32,609 INFO L226 Difference]: Without dead ends: 254 [2022-07-13 22:37:32,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:37:32,610 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 222 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:32,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 571 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:37:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-07-13 22:37:32,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 227. [2022-07-13 22:37:32,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 166 states have (on average 1.1325301204819278) internal successors, (188), 173 states have internal predecessors, (188), 36 states have call successors, (36), 20 states have call predecessors, (36), 24 states have return successors, (47), 33 states have call predecessors, (47), 34 states have call successors, (47) [2022-07-13 22:37:32,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 271 transitions. [2022-07-13 22:37:32,620 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 271 transitions. Word has length 67 [2022-07-13 22:37:32,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:32,620 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 271 transitions. [2022-07-13 22:37:32,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-13 22:37:32,620 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 271 transitions. [2022-07-13 22:37:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-13 22:37:32,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:32,621 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:37:32,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 22:37:32,622 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:32,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:32,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2139701523, now seen corresponding path program 1 times [2022-07-13 22:37:32,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:32,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968327341] [2022-07-13 22:37:32,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:32,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:32,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:32,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:32,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:32,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:32,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:37:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:32,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:37:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:32,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:37:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:32,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:37:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:32,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:37:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:32,943 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 22:37:32,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:32,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968327341] [2022-07-13 22:37:32,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968327341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:32,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:32,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 22:37:32,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954458219] [2022-07-13 22:37:32,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:32,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:37:32,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:32,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:37:32,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:37:32,945 INFO L87 Difference]: Start difference. First operand 227 states and 271 transitions. Second operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 22:37:33,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:33,231 INFO L93 Difference]: Finished difference Result 235 states and 278 transitions. [2022-07-13 22:37:33,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:37:33,235 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 75 [2022-07-13 22:37:33,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:33,236 INFO L225 Difference]: With dead ends: 235 [2022-07-13 22:37:33,236 INFO L226 Difference]: Without dead ends: 154 [2022-07-13 22:37:33,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:37:33,237 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 158 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:33,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 648 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:37:33,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-13 22:37:33,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 140. [2022-07-13 22:37:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 100 states have (on average 1.17) internal successors, (117), 105 states have internal predecessors, (117), 24 states have call successors, (24), 12 states have call predecessors, (24), 15 states have return successors, (26), 22 states have call predecessors, (26), 22 states have call successors, (26) [2022-07-13 22:37:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 167 transitions. [2022-07-13 22:37:33,243 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 167 transitions. Word has length 75 [2022-07-13 22:37:33,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:33,243 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 167 transitions. [2022-07-13 22:37:33,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 22:37:33,243 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 167 transitions. [2022-07-13 22:37:33,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-13 22:37:33,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:33,244 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:37:33,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 22:37:33,244 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:33,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:33,244 INFO L85 PathProgramCache]: Analyzing trace with hash 35307555, now seen corresponding path program 1 times [2022-07-13 22:37:33,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:33,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189086198] [2022-07-13 22:37:33,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:33,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:37:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:37:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:37:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:37:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,424 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 22:37:33,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:33,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189086198] [2022-07-13 22:37:33,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189086198] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:33,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:33,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:37:33,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303665446] [2022-07-13 22:37:33,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:33,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:37:33,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:33,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:37:33,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:37:33,426 INFO L87 Difference]: Start difference. First operand 140 states and 167 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:37:33,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:33,717 INFO L93 Difference]: Finished difference Result 243 states and 292 transitions. [2022-07-13 22:37:33,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:37:33,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 79 [2022-07-13 22:37:33,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:33,720 INFO L225 Difference]: With dead ends: 243 [2022-07-13 22:37:33,720 INFO L226 Difference]: Without dead ends: 153 [2022-07-13 22:37:33,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:37:33,721 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 58 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:33,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 303 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:37:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-13 22:37:33,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2022-07-13 22:37:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 104 states have (on average 1.1634615384615385) internal successors, (121), 109 states have internal predecessors, (121), 24 states have call successors, (24), 12 states have call predecessors, (24), 16 states have return successors, (27), 23 states have call predecessors, (27), 22 states have call successors, (27) [2022-07-13 22:37:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 172 transitions. [2022-07-13 22:37:33,740 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 172 transitions. Word has length 79 [2022-07-13 22:37:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:33,740 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 172 transitions. [2022-07-13 22:37:33,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:37:33,740 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 172 transitions. [2022-07-13 22:37:33,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-13 22:37:33,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:33,741 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-13 22:37:33,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 22:37:33,741 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:33,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:33,741 INFO L85 PathProgramCache]: Analyzing trace with hash -277501736, now seen corresponding path program 1 times [2022-07-13 22:37:33,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:33,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27846070] [2022-07-13 22:37:33,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:33,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:37:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:37:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:37:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:37:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:37:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 22:37:33,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:33,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27846070] [2022-07-13 22:37:33,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27846070] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:33,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:33,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 22:37:33,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621069775] [2022-07-13 22:37:33,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:33,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:37:33,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:33,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:37:33,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:37:33,951 INFO L87 Difference]: Start difference. First operand 145 states and 172 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 22:37:34,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:34,474 INFO L93 Difference]: Finished difference Result 244 states and 298 transitions. [2022-07-13 22:37:34,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 22:37:34,475 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 85 [2022-07-13 22:37:34,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:34,477 INFO L225 Difference]: With dead ends: 244 [2022-07-13 22:37:34,477 INFO L226 Difference]: Without dead ends: 177 [2022-07-13 22:37:34,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:37:34,478 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 75 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:34,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 342 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:37:34,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-13 22:37:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 152. [2022-07-13 22:37:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 110 states have (on average 1.1636363636363636) internal successors, (128), 115 states have internal predecessors, (128), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (28), 24 states have call predecessors, (28), 22 states have call successors, (28) [2022-07-13 22:37:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 180 transitions. [2022-07-13 22:37:34,485 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 180 transitions. Word has length 85 [2022-07-13 22:37:34,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:34,485 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 180 transitions. [2022-07-13 22:37:34,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 22:37:34,485 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2022-07-13 22:37:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-13 22:37:34,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:34,486 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-13 22:37:34,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 22:37:34,486 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:34,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:34,487 INFO L85 PathProgramCache]: Analyzing trace with hash -58647018, now seen corresponding path program 1 times [2022-07-13 22:37:34,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:34,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946738929] [2022-07-13 22:37:34,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:34,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:34,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:34,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:34,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:34,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:37:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:34,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:34,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:34,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:37:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:34,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:37:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:34,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:34,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:34,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:37:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:34,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:37:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 22:37:34,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:34,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946738929] [2022-07-13 22:37:34,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946738929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:34,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:34,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:37:34,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214210646] [2022-07-13 22:37:34,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:34,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:37:34,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:34,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:37:34,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:37:34,678 INFO L87 Difference]: Start difference. First operand 152 states and 180 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 22:37:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:34,897 INFO L93 Difference]: Finished difference Result 224 states and 264 transitions. [2022-07-13 22:37:34,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:37:34,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 85 [2022-07-13 22:37:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:34,898 INFO L225 Difference]: With dead ends: 224 [2022-07-13 22:37:34,898 INFO L226 Difference]: Without dead ends: 156 [2022-07-13 22:37:34,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:37:34,899 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 71 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:34,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 216 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:37:34,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-13 22:37:34,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2022-07-13 22:37:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 109 states have (on average 1.146788990825688) internal successors, (125), 114 states have internal predecessors, (125), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (28), 24 states have call predecessors, (28), 22 states have call successors, (28) [2022-07-13 22:37:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 177 transitions. [2022-07-13 22:37:34,905 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 177 transitions. Word has length 85 [2022-07-13 22:37:34,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:34,905 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 177 transitions. [2022-07-13 22:37:34,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 22:37:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 177 transitions. [2022-07-13 22:37:34,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-13 22:37:34,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:34,906 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-13 22:37:34,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 22:37:34,906 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:34,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:34,907 INFO L85 PathProgramCache]: Analyzing trace with hash 2136981433, now seen corresponding path program 1 times [2022-07-13 22:37:34,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:34,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357428356] [2022-07-13 22:37:34,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:34,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:34,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:34,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:34,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:34,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:37:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:37:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:37:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:37:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 22:37:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 22:37:35,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:35,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357428356] [2022-07-13 22:37:35,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357428356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:35,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:35,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:37:35,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796384783] [2022-07-13 22:37:35,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:35,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:37:35,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:35,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:37:35,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:37:35,055 INFO L87 Difference]: Start difference. First operand 151 states and 177 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-13 22:37:35,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:35,244 INFO L93 Difference]: Finished difference Result 211 states and 245 transitions. [2022-07-13 22:37:35,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:37:35,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2022-07-13 22:37:35,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:35,246 INFO L225 Difference]: With dead ends: 211 [2022-07-13 22:37:35,246 INFO L226 Difference]: Without dead ends: 100 [2022-07-13 22:37:35,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:37:35,247 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 63 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:35,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 209 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:37:35,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-13 22:37:35,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-07-13 22:37:35,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 71 states have internal predecessors, (74), 17 states have call successors, (17), 10 states have call predecessors, (17), 11 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-07-13 22:37:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2022-07-13 22:37:35,253 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 87 [2022-07-13 22:37:35,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:35,253 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2022-07-13 22:37:35,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-13 22:37:35,254 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2022-07-13 22:37:35,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 22:37:35,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:35,254 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:37:35,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 22:37:35,255 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:35,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:35,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1322477714, now seen corresponding path program 1 times [2022-07-13 22:37:35,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:35,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322047361] [2022-07-13 22:37:35,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:35,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:37:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:37:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:37:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:37:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:37:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 22:37:35,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:35,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322047361] [2022-07-13 22:37:35,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322047361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:35,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:37:35,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 22:37:35,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376938412] [2022-07-13 22:37:35,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:35,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 22:37:35,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:35,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 22:37:35,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:37:35,726 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-13 22:37:36,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:36,146 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2022-07-13 22:37:36,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:37:36,147 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 90 [2022-07-13 22:37:36,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:36,147 INFO L225 Difference]: With dead ends: 152 [2022-07-13 22:37:36,147 INFO L226 Difference]: Without dead ends: 95 [2022-07-13 22:37:36,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:37:36,148 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 189 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:36,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 203 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:37:36,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-13 22:37:36,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-07-13 22:37:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 69 states have internal predecessors, (70), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-13 22:37:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2022-07-13 22:37:36,152 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 90 [2022-07-13 22:37:36,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:36,153 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2022-07-13 22:37:36,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-13 22:37:36,153 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2022-07-13 22:37:36,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-13 22:37:36,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:37:36,154 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:37:36,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 22:37:36,154 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:37:36,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:37:36,154 INFO L85 PathProgramCache]: Analyzing trace with hash -11289161, now seen corresponding path program 1 times [2022-07-13 22:37:36,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:37:36,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329698186] [2022-07-13 22:37:36,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:36,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:37:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:36,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:37:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:36,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:37:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:36,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:37:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:36,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:37:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:36,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:36,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:36,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 22:37:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:36,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:37:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:36,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:37:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:36,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:36,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:37:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:36,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:37:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:36,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:37:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:36,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:37:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:36,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:37:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:36,758 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-13 22:37:36,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:37:36,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329698186] [2022-07-13 22:37:36,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329698186] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:37:36,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102931562] [2022-07-13 22:37:36,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:37:36,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:37:36,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:37:36,761 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-13 22:37:36,762 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-13 22:37:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:37:37,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 2617 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 22:37:37,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:37:37,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-13 22:37:37,620 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-13 22:37:37,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:37:37,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102931562] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:37:37,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:37:37,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 19 [2022-07-13 22:37:37,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560551406] [2022-07-13 22:37:37,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:37:37,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:37:37,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:37:37,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:37:37,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:37:37,622 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-13 22:37:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:37:37,669 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-07-13 22:37:37,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:37:37,670 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 116 [2022-07-13 22:37:37,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:37:37,670 INFO L225 Difference]: With dead ends: 95 [2022-07-13 22:37:37,670 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 22:37:37,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 132 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2022-07-13 22:37:37,672 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 16 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:37:37,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 393 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 42 Unchecked, 0.0s Time] [2022-07-13 22:37:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 22:37:37,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 22:37:37,673 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-13 22:37:37,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 22:37:37,673 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2022-07-13 22:37:37,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:37:37,673 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 22:37:37,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-13 22:37:37,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 22:37:37,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 22:37:37,676 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 22:37:37,699 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-13 22:37:37,891 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,SelfDestructingSolverStorable26 [2022-07-13 22:37:37,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 22:37:40,033 INFO L895 garLoopResultBuilder]: At program point L6894(line 6894) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-07-13 22:37:40,034 INFO L895 garLoopResultBuilder]: At program point can_fail_mallocENTRY(lines 6893 6897) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-07-13 22:37:40,034 INFO L899 garLoopResultBuilder]: For program point L6896-1(line 6896) no Hoare annotation was computed. [2022-07-13 22:37:40,034 INFO L895 garLoopResultBuilder]: At program point L6896(line 6896) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-07-13 22:37:40,034 INFO L899 garLoopResultBuilder]: For program point L6894-3(lines 6894 6896) no Hoare annotation was computed. [2022-07-13 22:37:40,034 INFO L899 garLoopResultBuilder]: For program point L6894-1(lines 6894 6896) no Hoare annotation was computed. [2022-07-13 22:37:40,034 INFO L899 garLoopResultBuilder]: For program point can_fail_mallocFINAL(lines 6893 6897) no Hoare annotation was computed. [2022-07-13 22:37:40,035 INFO L899 garLoopResultBuilder]: For program point can_fail_mallocEXIT(lines 6893 6897) no Hoare annotation was computed. [2022-07-13 22:37:40,035 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6876 6881) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-07-13 22:37:40,035 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6876 6881) no Hoare annotation was computed. [2022-07-13 22:37:40,035 INFO L899 garLoopResultBuilder]: For program point L6877-1(lines 6877 6879) no Hoare annotation was computed. [2022-07-13 22:37:40,035 INFO L895 garLoopResultBuilder]: At program point L6877(lines 6877 6879) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-07-13 22:37:40,035 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6876 6881) no Hoare annotation was computed. [2022-07-13 22:37:40,035 INFO L895 garLoopResultBuilder]: At program point aws_mem_acquireENTRY(lines 6922 6932) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-07-13 22:37:40,035 INFO L899 garLoopResultBuilder]: For program point aws_mem_acquireEXIT(lines 6922 6932) no Hoare annotation was computed. [2022-07-13 22:37:40,035 INFO L899 garLoopResultBuilder]: For program point L6928-2(lines 6928 6930) no Hoare annotation was computed. [2022-07-13 22:37:40,035 INFO L899 garLoopResultBuilder]: For program point L6927(line 6927) no Hoare annotation was computed. [2022-07-13 22:37:40,035 INFO L899 garLoopResultBuilder]: For program point L6928(lines 6928 6930) no Hoare annotation was computed. [2022-07-13 22:37:40,035 INFO L899 garLoopResultBuilder]: For program point L6929-1(line 6929) no Hoare annotation was computed. [2022-07-13 22:37:40,035 INFO L895 garLoopResultBuilder]: At program point L6929(line 6929) the Hoare annotation is: (or (and (< 0 (+ aws_mem_acquire_~mem~0.offset 1)) (<= aws_mem_acquire_~mem~0.base 0) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (<= aws_mem_acquire_~mem~0.offset 0) (< 0 (+ aws_mem_acquire_~mem~0.base 1))) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-07-13 22:37:40,036 INFO L895 garLoopResultBuilder]: At program point L6923-1(line 6923) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-07-13 22:37:40,036 INFO L895 garLoopResultBuilder]: At program point L6923(line 6923) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-07-13 22:37:40,036 INFO L895 garLoopResultBuilder]: At program point L6925-1(line 6925) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-07-13 22:37:40,036 INFO L895 garLoopResultBuilder]: At program point L6925(line 6925) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-07-13 22:37:40,036 INFO L899 garLoopResultBuilder]: For program point aws_mem_acquireFINAL(lines 6922 6932) no Hoare annotation was computed. [2022-07-13 22:37:40,036 INFO L899 garLoopResultBuilder]: For program point L6923-2(line 6923) no Hoare annotation was computed. [2022-07-13 22:37:40,036 INFO L899 garLoopResultBuilder]: For program point L7162(line 7162) no Hoare annotation was computed. [2022-07-13 22:37:40,037 INFO L899 garLoopResultBuilder]: For program point L7162-4(line 7162) no Hoare annotation was computed. [2022-07-13 22:37:40,037 INFO L899 garLoopResultBuilder]: For program point L7162-3(line 7162) no Hoare annotation was computed. [2022-07-13 22:37:40,037 INFO L899 garLoopResultBuilder]: For program point L7162-2(line 7162) no Hoare annotation was computed. [2022-07-13 22:37:40,037 INFO L899 garLoopResultBuilder]: For program point L7162-8(line 7162) no Hoare annotation was computed. [2022-07-13 22:37:40,037 INFO L902 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7157 7163) the Hoare annotation is: true [2022-07-13 22:37:40,037 INFO L899 garLoopResultBuilder]: For program point L7162-6(line 7162) no Hoare annotation was computed. [2022-07-13 22:37:40,037 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7157 7163) no Hoare annotation was computed. [2022-07-13 22:37:40,038 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7157 7163) no Hoare annotation was computed. [2022-07-13 22:37:40,038 INFO L899 garLoopResultBuilder]: For program point L7159-1(line 7159) no Hoare annotation was computed. [2022-07-13 22:37:40,038 INFO L899 garLoopResultBuilder]: For program point L7159(lines 7159 7162) no Hoare annotation was computed. [2022-07-13 22:37:40,038 INFO L899 garLoopResultBuilder]: For program point L7159-4(lines 7159 7160) no Hoare annotation was computed. [2022-07-13 22:37:40,038 INFO L899 garLoopResultBuilder]: For program point L7159-3(line 7159) no Hoare annotation was computed. [2022-07-13 22:37:40,038 INFO L899 garLoopResultBuilder]: For program point L7159-9(lines 7159 7162) no Hoare annotation was computed. [2022-07-13 22:37:40,038 INFO L899 garLoopResultBuilder]: For program point L7159-7(lines 7159 7162) no Hoare annotation was computed. [2022-07-13 22:37:40,038 INFO L899 garLoopResultBuilder]: For program point L7159-6(lines 7159 7160) no Hoare annotation was computed. [2022-07-13 22:37:40,039 INFO L899 garLoopResultBuilder]: For program point L7159-11(lines 7159 7162) no Hoare annotation was computed. [2022-07-13 22:37:40,039 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-13 22:37:40,039 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-13 22:37:40,039 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-13 22:37:40,039 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-13 22:37:40,039 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-13 22:37:40,039 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-13 22:37:40,040 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-13 22:37:40,040 INFO L895 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (or (= ~tl_last_error~0 |old(~tl_last_error~0)|) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-07-13 22:37:40,040 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7101) no Hoare annotation was computed. [2022-07-13 22:37:40,040 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2022-07-13 22:37:40,040 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2022-07-13 22:37:40,040 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6883 6885) no Hoare annotation was computed. [2022-07-13 22:37:40,040 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6883 6885) no Hoare annotation was computed. [2022-07-13 22:37:40,040 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6883 6885) the Hoare annotation is: true [2022-07-13 22:37:40,041 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validFINAL(lines 6917 6920) no Hoare annotation was computed. [2022-07-13 22:37:40,041 INFO L899 garLoopResultBuilder]: For program point L6919-1(line 6919) no Hoare annotation was computed. [2022-07-13 22:37:40,041 INFO L902 garLoopResultBuilder]: At program point L6919(line 6919) the Hoare annotation is: true [2022-07-13 22:37:40,041 INFO L902 garLoopResultBuilder]: At program point aws_allocator_is_validENTRY(lines 6917 6920) the Hoare annotation is: true [2022-07-13 22:37:40,041 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validEXIT(lines 6917 6920) no Hoare annotation was computed. [2022-07-13 22:37:40,041 INFO L899 garLoopResultBuilder]: For program point L7117-2(lines 7117 7121) no Hoare annotation was computed. [2022-07-13 22:37:40,041 INFO L895 garLoopResultBuilder]: At program point L8752(line 8752) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24))) (and (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1151#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1151#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2022-07-13 22:37:40,042 INFO L899 garLoopResultBuilder]: For program point L8752-1(line 8752) no Hoare annotation was computed. [2022-07-13 22:37:40,042 INFO L899 garLoopResultBuilder]: For program point L7117(lines 7117 7118) no Hoare annotation was computed. [2022-07-13 22:37:40,042 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 22:37:40,042 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 22:37:40,042 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 22:37:40,042 INFO L895 garLoopResultBuilder]: At program point L7126(line 7126) the Hoare annotation is: (let ((.cse14 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse14) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse14))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse13 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse13)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= (mod |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616) 0)) .cse12 .cse13)))) [2022-07-13 22:37:40,043 INFO L902 garLoopResultBuilder]: At program point L8757(line 8757) the Hoare annotation is: true [2022-07-13 22:37:40,043 INFO L899 garLoopResultBuilder]: For program point L7126-2(line 7126) no Hoare annotation was computed. [2022-07-13 22:37:40,043 INFO L895 garLoopResultBuilder]: At program point L7126-1(line 7126) the Hoare annotation is: (let ((.cse19 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse10 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse10 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse2 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse4 (<= 1 |ULTIMATE.start_aws_byte_buf_init_#t~ret591#1|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.base| 0))) (.cse7 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse19) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse11 (<= |ULTIMATE.start_aws_byte_buf_init_#t~ret591#1| 1)) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse19))) (.cse14 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse16 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse17 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (let ((.cse9 (select .cse10 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse9 (+ 18446744073709551615 (* (div (+ (- 1) .cse9) 18446744073709551616) 18446744073709551616)))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse18 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse18) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse18) 0) .cse17))))) [2022-07-13 22:37:40,043 INFO L899 garLoopResultBuilder]: For program point L8749(lines 8749 8755) no Hoare annotation was computed. [2022-07-13 22:37:40,043 INFO L899 garLoopResultBuilder]: For program point L8749-2(lines 8749 8755) no Hoare annotation was computed. [2022-07-13 22:37:40,043 INFO L895 garLoopResultBuilder]: At program point L8753(line 8753) the Hoare annotation is: (and (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (= |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1152#1| 0) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2022-07-13 22:37:40,044 INFO L899 garLoopResultBuilder]: For program point L8753-1(line 8753) no Hoare annotation was computed. [2022-07-13 22:37:40,044 INFO L899 garLoopResultBuilder]: For program point L8741(lines 8741 8756) no Hoare annotation was computed. [2022-07-13 22:37:40,044 INFO L899 garLoopResultBuilder]: For program point L7114-1(lines 7114 7116) no Hoare annotation was computed. [2022-07-13 22:37:40,044 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 22:37:40,044 INFO L895 garLoopResultBuilder]: At program point L7127(lines 7110 7128) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse15 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse13 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse13)) (and .cse3 .cse4 .cse5 .cse7 .cse8 (<= (+ |ULTIMATE.start_aws_byte_buf_init_#res#1| 1) 0) .cse10 .cse11 (not (= (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse14 (select .cse15 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse14 (+ 18446744073709551615 (* (div (+ (- 1) .cse14) 18446744073709551616) 18446744073709551616)))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2022-07-13 22:37:40,044 INFO L895 garLoopResultBuilder]: At program point L8754(line 8754) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (= (+ (* (div |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1153#1| 18446744073709551616) 18446744073709551616) |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1153#1|)) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2022-07-13 22:37:40,044 INFO L895 garLoopResultBuilder]: At program point L8746(line 8746) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) [2022-07-13 22:37:40,045 INFO L899 garLoopResultBuilder]: For program point L8754-1(line 8754) no Hoare annotation was computed. [2022-07-13 22:37:40,045 INFO L895 garLoopResultBuilder]: At program point L7111-1(line 7111) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) [2022-07-13 22:37:40,045 INFO L895 garLoopResultBuilder]: At program point L7111(line 7111) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) [2022-07-13 22:37:40,045 INFO L899 garLoopResultBuilder]: For program point L8746-1(line 8746) no Hoare annotation was computed. [2022-07-13 22:37:40,045 INFO L899 garLoopResultBuilder]: For program point L8751-2(line 8751) no Hoare annotation was computed. [2022-07-13 22:37:40,045 INFO L899 garLoopResultBuilder]: For program point L7116-1(line 7116) no Hoare annotation was computed. [2022-07-13 22:37:40,045 INFO L895 garLoopResultBuilder]: At program point L7116(line 7116) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (not (= (mod |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616) 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) [2022-07-13 22:37:40,046 INFO L895 garLoopResultBuilder]: At program point L8751(line 8751) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse15 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse13 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse13)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse14 (select .cse15 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse14 (+ 18446744073709551615 (* (div (+ (- 1) .cse14) 18446744073709551616) 18446744073709551616)))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2022-07-13 22:37:40,046 INFO L895 garLoopResultBuilder]: At program point L8751-1(line 8751) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24))) (and (<= |ULTIMATE.start_aws_byte_buf_init_harness_#t~ret1150#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (<= 1 |ULTIMATE.start_aws_byte_buf_init_harness_#t~ret1150#1|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2022-07-13 22:37:40,046 INFO L899 garLoopResultBuilder]: For program point L7112(lines 7110 7128) no Hoare annotation was computed. [2022-07-13 22:37:40,046 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-13 22:37:40,046 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-13 22:37:40,046 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-13 22:37:40,046 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-13 22:37:40,046 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-13 22:37:40,047 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-13 22:37:40,049 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, 1] [2022-07-13 22:37:40,050 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 22:37:40,065 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 22:37:40,070 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:37:40,070 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 22:37:40,070 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:37:40,071 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:37:40,071 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 22:37:40,079 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 22:37:40,080 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:37:40,080 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 22:37:40,081 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:37:40,084 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:37:40,085 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 22:37:40,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 10:37:40 BoogieIcfgContainer [2022-07-13 22:37:40,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 22:37:40,094 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 22:37:40,094 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 22:37:40,094 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 22:37:40,095 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:37:20" (3/4) ... [2022-07-13 22:37:40,097 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 22:37:40,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_allocator_is_valid [2022-07-13 22:37:40,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_malloc [2022-07-13 22:37:40,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-13 22:37:40,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_acquire [2022-07-13 22:37:40,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-07-13 22:37:40,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-13 22:37:40,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-13 22:37:40,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-13 22:37:40,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2022-07-13 22:37:40,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-13 22:37:40,112 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 123 nodes and edges [2022-07-13 22:37:40,113 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2022-07-13 22:37:40,114 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2022-07-13 22:37:40,115 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-13 22:37:40,115 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-13 22:37:40,116 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-13 22:37:40,117 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 22:37:40,117 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 22:37:40,141 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][8 + buf] == 0) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && allocator == allocator) && allocator == allocator) && #memory_$Pointer$[buf][8 + buf] == 0) && s_can_fail_allocator_static <= 0) || ((((((((((0 <= s_can_fail_allocator_static && buf == 0) && capacity == capacity) && buf == buf) && !(buf == 0)) && \result + 1 <= 0) && buf == buf) && allocator == allocator) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && allocator == allocator) && s_can_fail_allocator_static <= 0)) || (((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + (-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616 * 18446744073709551616) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && allocator == allocator) && allocator == allocator) && s_can_fail_allocator_static <= 0) [2022-07-13 22:37:40,428 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 22:37:40,428 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 22:37:40,428 INFO L158 Benchmark]: Toolchain (without parser) took 22444.04ms. Allocated memory was 109.1MB in the beginning and 509.6MB in the end (delta: 400.6MB). Free memory was 72.2MB in the beginning and 399.1MB in the end (delta: -326.9MB). Peak memory consumption was 346.1MB. Max. memory is 16.1GB. [2022-07-13 22:37:40,429 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 22:37:40,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1605.47ms. Allocated memory was 109.1MB in the beginning and 148.9MB in the end (delta: 39.8MB). Free memory was 72.0MB in the beginning and 89.8MB in the end (delta: -17.9MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. [2022-07-13 22:37:40,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 158.22ms. Allocated memory is still 148.9MB. Free memory was 89.8MB in the beginning and 78.5MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 22:37:40,429 INFO L158 Benchmark]: Boogie Preprocessor took 79.56ms. Allocated memory is still 148.9MB. Free memory was 78.5MB in the beginning and 72.3MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 22:37:40,429 INFO L158 Benchmark]: RCFGBuilder took 1121.28ms. Allocated memory was 148.9MB in the beginning and 226.5MB in the end (delta: 77.6MB). Free memory was 72.3MB in the beginning and 128.2MB in the end (delta: -55.9MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2022-07-13 22:37:40,430 INFO L158 Benchmark]: TraceAbstraction took 19135.08ms. Allocated memory was 226.5MB in the beginning and 509.6MB in the end (delta: 283.1MB). Free memory was 128.2MB in the beginning and 223.0MB in the end (delta: -94.8MB). Peak memory consumption was 269.4MB. Max. memory is 16.1GB. [2022-07-13 22:37:40,430 INFO L158 Benchmark]: Witness Printer took 334.15ms. Allocated memory is still 509.6MB. Free memory was 223.0MB in the beginning and 399.1MB in the end (delta: -176.1MB). Peak memory consumption was 95.5MB. Max. memory is 16.1GB. [2022-07-13 22:37:40,431 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1605.47ms. Allocated memory was 109.1MB in the beginning and 148.9MB in the end (delta: 39.8MB). Free memory was 72.0MB in the beginning and 89.8MB in the end (delta: -17.9MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 158.22ms. Allocated memory is still 148.9MB. Free memory was 89.8MB in the beginning and 78.5MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.56ms. Allocated memory is still 148.9MB. Free memory was 78.5MB in the beginning and 72.3MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1121.28ms. Allocated memory was 148.9MB in the beginning and 226.5MB in the end (delta: 77.6MB). Free memory was 72.3MB in the beginning and 128.2MB in the end (delta: -55.9MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19135.08ms. Allocated memory was 226.5MB in the beginning and 509.6MB in the end (delta: 283.1MB). Free memory was 128.2MB in the beginning and 223.0MB in the end (delta: -94.8MB). Peak memory consumption was 269.4MB. Max. memory is 16.1GB. * Witness Printer took 334.15ms. Allocated memory is still 509.6MB. Free memory was 223.0MB in the beginning and 399.1MB in the end (delta: -176.1MB). Peak memory consumption was 95.5MB. 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$.offset - 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$.offset - 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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - 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$.offset - 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$.offset * 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, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.0s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2287 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2165 mSDsluCounter, 15044 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 220 IncrementalHoareTripleChecker+Unchecked, 12223 mSDsCounter, 576 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5272 IncrementalHoareTripleChecker+Invalid, 6068 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 576 mSolverCounterUnsat, 2821 mSDtfsCounter, 5272 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 931 GetRequests, 616 SyntacticMatches, 12 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=17, InterpolantAutomatonStates: 239, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 367 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 185 PreInvPairs, 212 NumberOfFragments, 1275 HoareAnnotationTreeSize, 185 FomulaSimplifications, 267 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 32 FomulaSimplificationsInter, 104184 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 1776 NumberOfCodeBlocks, 1776 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1807 ConstructedInterpolants, 55 QuantifiedInterpolants, 9842 SizeOfPredicates, 37 NumberOfNonLiveVariables, 5076 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 30 InterpolantComputations, 26 PerfectInterpolantSequences, 542/575 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: 7110]: Loop Invariant [2022-07-13 22:37:40,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 22:37:40,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:37:40,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 22:37:40,447 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:37:40,447 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:37:40,448 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 22:37:40,449 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 22:37:40,454 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:37:40,455 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 22:37:40,455 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:37:40,455 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:37:40,456 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][8 + buf] == 0) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && allocator == allocator) && allocator == allocator) && #memory_$Pointer$[buf][8 + buf] == 0) && s_can_fail_allocator_static <= 0) || ((((((((((0 <= s_can_fail_allocator_static && buf == 0) && capacity == capacity) && buf == buf) && !(buf == 0)) && \result + 1 <= 0) && buf == buf) && allocator == allocator) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && allocator == allocator) && s_can_fail_allocator_static <= 0)) || (((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + (-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616 * 18446744073709551616) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && allocator == allocator) && allocator == allocator) && s_can_fail_allocator_static <= 0) - InvariantResult [Line: 8757]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-13 22:37:40,485 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